论文信息 - On computing achievable fault signatures

On computing achievable fault signatures

Abstract The knowledge of achievable fault signatures is a valuable information in designing residual generators providing structured residual sets for fault detection and isolation. We propose an efficient computational approach to determine the achievable fault signatures for a given additive fault model. The proposed procedure relies on recently developed numerically reliable nullspace updating techniques involving orthogonal reductions to Kronecker-like forms. The new procedure is general, being applicable to both proper as well as non-proper systems, and is significantly more efficient than an exhaustive search based approach.

Andreas Varga

[1] Janos Gertler,et al. Fault detection and diagnosis in engineering systems , 1998 .

[2] A. Varga. On computing least order fault detectors using rational nullspace bases , 2003 .

[3] Zhiguo Yuan,et al. Improving the observer-based FDI design for efficient fault isolation , 1997 .

[4] Andreas Varga. Linear FDI-Techniques and Software Tools , 2008 .

[5] Andreas Varga. On designing least order residual generators for fault detection and isolation , 2007 .

[6] M. Nyberg,et al. A Minimal Polynomial Basis Solution to Residual Generation for Fault Diagnosis in Linear Systems , 1999 .

[7] Ramine Nikoukhah,et al. Innovations generation in the presence of unknown inputs: Application to robust failure detection , 1994, Autom..

[8] Andras Varga. Computation of Kronecker-like forms of a system pencil: applications, algorithms and software , 1996, Proceedings of Joint Conference on Control Applications Intelligent Control and Computer Aided Control System Design.

[9] Andreas Varga. Monitoring actuator failures for a large transport aircraft – the nominal case , 2009 .

[10] J. Gertler. Designing dynamic consistency relations for fault detection and isolation , 2000 .

[11] A. Varga. On computing nullspace bases { a fault detection perspective , 2008 .

[12] Tgj Theo Beelen. New algorithms for computing the Kronecker structure of a pencil with applications to systems and control theory , 1987 .