z-logo
Premium
ROBUST FAULT DETECTION AND ISOLATION FOR UNCERTAIN LINEAR RETARDED SYSTEMS
Author(s) -
Jiang Canghua,
Zhou Donghua,
Gao Furong
Publication year - 2006
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1111/j.1934-6093.2006.tb00264.x
Subject(s) - control theory (sociology) , fault detection and isolation , robustness (evolution) , observer (physics) , multiplicative function , bounded function , state observer , actuator , linear system , fault (geology) , computer science , mathematics , nonlinear system , control (management) , artificial intelligence , mathematical analysis , biochemistry , chemistry , physics , quantum mechanics , gene , seismology , geology
A robust fault detection and isolation scheme is proposed for uncertain continuous linear systems with discrete state delays for both additive and multiplicative faults. Model uncertainties, disturbances and noises are represented as unstructured unknown inputs. The proposed scheme consists of a Luenberger observer for fault detection and a group of adaptive observers, one for each class of faults, for fault isolation. The threshold determination and fault isolation are based on a multi‐observer strategy. Robustness to model uncertainties and disturbances can be guaranteed for the scheme by selecting proper thresholds. All the signals, i.e. , the fault estimate and the state and output estimation errors of each isolation observer can be shown to be uniformly bounded, and the estimate of the fault by the matched observer is shown to be satisfactory in the sense of extended H 2 norm. Furthermore, the sensitivity to fault and the fault isolability condition are analyzed also in the paper. Simulations of a heating process for detecting and isolating an actuator gain fault and an additive fault show the proposed scheme is effective.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here