Professional Documents
Culture Documents
Abstract:
This paper investigates the problem of robust fault
detection for a class of uncertain systems with time-delay and
unknown input. The objective is to minimize the difference
between the residual and the fault, and to enhance the
robustness to unknown inputs, control inputs and model
uncertainties. Attention is focused on formulating the design
of robust fault detection filters as H filtering problem. The
sufficient condition for the existence of the above filters is
established by means of linear matrix inequalities. A
numerical example is given to illustrate the effectiveness of the
proposed method.
Problem formulation
Keywords:
Uncertain system with time-delay; robust fault detection;
H filtering; linear matrix inequality; residual
1.
y (t ) = Cx (t ) + D d d ( t ) + D f f (t ),
(1)
x (0) = 0.
Introduction
A = HF (t ) E1 , Ad = HF (t ) E2 , B = HF (t ) E3 .
where F (t ) is uncertain matrix and satisfies
F T (t ) F (t ) I .
Throughout this paper, all matrices are assumed to be
compatible if their dimensions are not explicitly stated, and
the system (1) is asymptotically stable.
The problem of observer-based fault detection is to
find an asymptotically stable filter as the residual generator,
and then determine whether or not the faults occur by
comparing the residual with the prescribed threshold.
For the system (1), construct the following fault
detection filter:
xF (t ) = AF xF (t ) + BF y(t ),
r(t ) = CF xF (t ) + DF y(t ).
(2)
Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, 18-21 August 2005
where xF (t ) R n , r (t ) R s is the residual.
In order to enhance the sensitiveness of residual to
fault as well as the robustness to control inputs, unknown
inputs and model uncertainties, the fault is weighted as
f ( s ) = Q( s ) f ( s ) , where Q( s ) RH is a given weighted
function. The state-space realization of f (t ) is shown as:
xQ (t ) = AQ xQ (t ) + BQ f (t ),
(3)
f (t ) = CQ xQ (t ) + DQ f (t ).
where xQ (t ) R q , f (t ) R s .
Denote re (t ) = r (t ) f (t ) , then the overall dynamic system
can be written as the following augmented system:
(t ) = A (t ) + Ad (t d ) + BW (t ),
(4)
re (t ) = C (t ) + DW (t ),
where
(t ) = [ xT (t ) xFT (t ) xQT (t ]T , W (t ) = [u T (t ) d T (t ) f T (t )]T
A+ A
A = BF C
0
B + B
B= 0
0
D = 0
0
AF
0
Ad + Ad
Ad =
0
0 ,
AQ
Bf
BF Dd BF D f , C = DF C
BQ
0
DF Dd
DF D f DQ .
0 0
0 0 ,
0 0
CQ ,
(5)
WL2 0
re
W
2
2
= sup
WL2 0
) (
1
2
W T (t)W (t )dt
1
2
sup
d L2 , uL2 , f = 0
r (t )
2,T
t0 + T
t0
r T (t )r (t )dt
(7)
2,T
t0 +T
t0
r T (t )r (t )dt
(8)
Bd
CF
J (r ) = r (t )
PAd
0
<0
(10)
0
S
then the system (9) is asymptotically stable, and, under the
zero initial condition, satisfies z < w .
2
2
CT
DT
I
*
PB
I
*
*
1111
Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, 18-21 August 2005
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
0
0
4
*
*
*
*
*
*
*
*
*
*
RB
XB
0
I + 3 E3T E3
*
*
*
*
*
*
*
*
*
RBd
RB f
6
VBQ
CDFT
CQT
0
DdT DFT
DTf DFT DQT
I
*
*
*
*
*
*
0
0
I
*
*
*
*
*
0
0
I
*
*
*
*
*
*
*
*
*
*
X R >0
where
(12)
1 = RA + AT R + T + S 2 + 1 E1T E1 ,
2 = RA + AT X + C T Z T + M T + S 2 + 1 E1T E1 ,
3 = XA + AT X + ZC + C T Z T + S 2 + 1 E1T E1 ,
4 = S1 + AQT V + VAQ , 5 = XBd + ZDd ,
6 = XB f + ZD f , 7 = C T DFT + N T .
Furthermore, the parameter matrices of RFDF are given by
(13)
AF = ( R X ) 1 M , BF = ( R X ) 1 Z , CF = N
Proof. Suppose that the augmented system (4) is
asymptotically stable and satisfies (6), using Lemma 1, then
there exist symmetric positive definite matrices
P R (2 n + q )(2 n + q ) , S R (2 n + q )(2 n + q ) such that (14) holds
AT P + PA + S
PB
I
*
*
CT
DT
I
*
PAd
0
<0
0
Ad 0 = 0 0 0 , A0 = BF C AF 0 ,
0
0 0 0
0 AQ
(14)
0
0
0
0
0
0
0
0
S3
*
0
0
0
0
0
0
0
0
0
S1
*
*
*
*
*
*
RH
XH
0
0
0
0
0
0
0
0
1I
*
*
RH
XH
0
0
0
0
0
0
0
0
0
2 I
*
RH
XH
0
0
0
0
0 <0
0
0
0
0
3 I
B
Bd
A 0 0
A = 0 0 0 , B0 = 0 B F Dd
0
0 0 0
0
B 0 0
B = 0 0 0 .
0 0 0
Bf
BF D f
BQ
(11)
0
0
3 E3T E3
B P
0
0
0
T
Ad P
where
0
0
0
0
0 P Ad 21 PHH T P
0
0
0
0
0
0
0
0
0
0
0
0
0
(15)
0
0
0
0
0
0
0 2 E2T E2
H = H T 0 0 , E1 = [ E1 0 0] , E2 = [ E2 0 0] .
Substituting (15) into (14) and using the Schur complement,
then (16) is equivalent to (14):
Denote
Bd
Bf
0
B
A
, B0 =
A0 =
,
BF C AF
0 BF Dd BF D f
BQ = 0 0 BQ , C0 = [ DF C CF ] .
1112
Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, 18-21 August 2005
T
T
*
0
0
0
0
I + 3 E3 E3 D
*
*
0
0
0
0
I
*
*
* S + 2 E2T E2 0
0
0 <0
*
*
*
*
0
1I 0
*
*
*
*
* 2 I 0
*
*
*
*
*
* 3 I
A0 0
B0
then A0 =
(17)
, B0 = , C = C0 C Q .
0 AQ
BQ
Without loss of generality, matrices P, S are selected as:
where
S
U 0
P=
, S=
0 V
0
T
S1
2 n 2 n
(18)
q q
0 <U =U R
, 0 <V =V R ,
T
2 n 2 n
0< S = S R
, 0 < S1 = S1T R q q .
U12 U 22
Y12 Y22
where U11 R nn , Y11 R nn .
I
S2 0
Y
I U11
denote J Y = 11T
JU = 0 U T S = 0 S
Y
0
12
3
12
T
n n
T
n n
where 0 < S 2 = S 2 R , 0 < S3 = S3 R .
Substituting (17) and (18) into (16), the new inequality is
given. Performing the congruence transformation to the
1 2
*
3
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
where
RB
RBd
RB f
XB
I + 3 E E3
T
3
RAd
RH
RH
XAd
XH
XH
D D
D D
T
F
CD
0
T
d
T
f
T
F
T
F
S1 + 2 E E2
S2
1 I
2 I
X R >0
16
T
2
(21)
1 = RA + AT R + T + S1 + 1 E1T E1 ,
1113
RH
XH
0
0
0
0 <0
0
0
0
3 I
2 = RA + AT X + C T Z T + M T + S1 + 1 E1T E1 ,
3 = XA + AT X + ZC + C T Z T + S1 + 1 E1T E1 ,
4 = XBd + ZDd , 5 = XB f + ZD f ,
(20)
Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, 18-21 August 2005
6 = C T DFT + N T .
1 5 t 15
The fault to be detected f (t ) =
0 otherwise
By Theorem 1, the following results are obtained :
9.6093 1.8493
0.9511
, BF =
AF =
,
1.0295
1.0876 11.0486
sup
d L2 , uL2, f = 0
2,30
Numerical example
0 10
0.8 1
0.1
1
1
= 0.4909
5
,
5+ s
then AQ = 5, BQ = 5, CQ = 1, DQ = 0
Suppose that the unknown input d (t ) is random
noise whose amplitude is no more than 0.5 and the control
1114
Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, Guangzhou, 18-21 August 2005
5.
Conclusions
[4]
[8]
[9]
1115