Conference Paper

Complete Fault Diagnosis of Uncertain Polynomial Systems

DOI: 10.3182/20100705-3-BE-2011.0089 Conference: DYCOPS, At Leuven, Belgium
Source: OAI


The increase in complexity in process control goes along with an increasing need for complete and guaranteed fault diagnosis. In this contribution, we propose a set-based method for complete fault diagnosis for polynomial systems. It is based on a reformulation of the diagnosis problem as a nonlinear feasibility problem, which is subsequently relaxed into a semidefinite program. This is done by exploiting the polynomial/rational structure of the discrete-time model equations. We assume the measurements of the output and the input to be available as uncertain, but bounded convex sets. The applicability of the method is demonstrated considering a two-tank system subject to multiple faults.

Download full-text


Available from: Steffen Borchers
  • [Show abstract] [Hide abstract]
    ABSTRACT: Outer bounds for the evolution of state trajectories of uncertain systems are useful for many purposes such as robust control design, state and parameter estimation, model invalidation, safety evaluation, fault detection and diagnosis, and experimental design. Obtaining tight outer bounds for trajectory bundles of uncertain nonlinear systems subject to disturbances is a challenging task. This paper proposes a new approach to obtaining such bounds with reasonable computa- tional requirements for discrete-time polynomial systems with uncertain initial state and fixed and/or time-varying uncertain parameters and disturbances. The map describing the dynamics of the uncertain system is reformulated as a linear fractional transformation, which is used to bound the state trajectories by employing polynomial-time algorithms for computing upper and lower bounds for the skewed structured singular value. Three different algorithms to efficiently calculate outer bounds on the evolution of the system trajectories are presented, which have different tradeoffs between computational complexity and conservatism. The tradeoffs are illustrated in numerical examples, which demonstrate the small conservatism of the tightest bounds.
    No preview · Article · Sep 2011 · IEEE Transactions on Automatic Control
  • [Show abstract] [Hide abstract]
    ABSTRACT: To ensure the safe operation of technical processes, the occurrence of a fault has to be reliably detected for a supervisory component to react in time. We investigate the sensitivity of the measured outputs with respect to abrupt or parametric faults for polynomial hybrid systems. For this we define a sensitivity measure based on the reachable sets of the outputs. The approach allows for the consideration of discrete changes in variables as well as unknown-but-bounded parameters or output measurements. Guaranteed outer bounds of the reachable sets are derived by employing mixed-integer relaxations. Furthermore, we present an algorithm to derive an upper bound on the allowed measurement error such that the faults can be detected and isolated within a specified amount of time. The upper bounds can be used to select or optimize sensors to guarantee complete fault diagnosibility. We illustrate the proposed algorithm considering fault detection and isolation for a three tank system.
    No preview · Conference Paper · Aug 2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Effective fault diagnosis depends on the detectability of the faults in the measurements, which can be improved by a suitable input signal. This article presents a deterministic method for computing the set of inputs that guarantee fault diagnosis, referred to as separating inputs. The process of interest is described, under nominal and various faulty conditions, by linear discrete-time models subject to bounded process and measurement noise. It is shown that the set of separating inputs can be efficiently computed in terms of the complement of one or several zonotopes, depending on the number of fault models. In practice, it is essential to choose elements from this set that are minimally harmful with respect to other control objectives. It is shown that this can be done efficiently through the solution of a mixed-integer quadratic program. The method is demonstrated for a numerical example.
    No preview · Conference Paper · Jun 2013
Show more