Delay-Adaptive Feedback For Linear Feedforward Systems
Delay-Adaptive Feedback For Linear Feedforward Systems
In this paper we consider both the state and input delays to be ξ (x, t ) = X2 (t + D1 (x − 1)) (21)
unknown, that is, we consider the system u(x, t ) = U (t + D2 (x − 1)). (22)
Ẋ1 (t ) = F1 X1 (t ) + H1 X2 (t − D1 ) + B1 U (t − D2 ) (12) Using the certainty equivalence principle the controller (8) is taken
Ẋ2 (t ) = F2 X2 (t ) + B2 U (t − D2 ), (13) as
� 1
with D1 and D2 unknown. Since D1 and D2 are unknown, in addition
A(D̂1 )D̂2 (t ) X1 (t ) + D̂1 (t ) e−F1 D̂1 (t )y H1 ξ (y, t )dy
to the predictor based controller, we must design two estimators, U (t ) = K (D̂1 )e 0
one for each of the delays. We employ projector operators and X2 (t )
assume a bound on the length of the delays to be known. � 1
Assumption 1. There exist known constants D1 , D1 and D2 such + K (D̂1 )D̂2 (t ) eA(D̂1 )D̂2 (t )(1−y) Bu(y, t )dy. (23)
0
that D1 ∈ [D1 , D1 ] and D2 ∈ [0, D2 ].
The update laws for the estimations of the unknown delays D1 and
Our controller is based on the transformed system (i.e., on the D2 are given by
system
�� without� state
� ��delay). As indicated in Section 1, the pair
F1 e−D1 F1 H1
, B1
must be completely controllable. Under
˙
D̂1 (t ) = γ1 Proj[D ,D1 ] {τD1 } (24)
0 F2 B2 1
this assumption we can find a stabilizing state feedback. In the case ˙
of unknown state delay D1 , we must assume that there exists a D̂2 (t ) = γ2 Proj[0,D2 ] {τD2 }, (25)
stabilizing state feedback for all values of the state delay in a given
where the projector operators are defined as
interval. We thus make the following assumption.
�� � � ��
Assumption 2. The pair F1 e−D1 F1 H1
, BB12 is completely � � 0 if D̂i = Di and τDi < 0
0 F Proj[D ,Di ] τDi = (26)
0 if D̂i = Di and τDi > 0 ,
2
i
controllable ∀D1 ∈ [D1 , D1 ]. Furthermore, we assume that there τDi else
exists a triple of vector/matrix-valued
� � functions (K�(D1 ), P (D� 1 ),
Q (D1 )) such that K (D1 ) ∈ C 1 [D1 , D1 ] , P (D1 ) ∈ C 1 [D1 , D1 ] , Q and where
� �
(D1 ) ∈ C 0 [D1 , D1 ] , the matrices P (D1 ) and Q (D1 ) are positive �1 2 T
definite and symmetric, and the following Lyapunov equation is 0
(1 + x)w(x, t )K (D̂1 )eA(D̂1 )D̂2 (t )x dx − a2
Z (t )P (D̂1 )
τD1 =
satisfied ∀D1 ∈ [D1 , D1 ]: Γ (t )
T
× R2 ( t ) (27)
(A(D1 ) + BK (D1 )) P (D1 ) + P (D1 ) (A(D1 ) + BK (D1 )) �1
= −Q (D1 ), ∀D1 ∈ [D1 , D1 ]. (14)
(1 + x)w(x, t )K (D̂1 )eA(D̂1 )D̂2 (t )x dx
τD2 = − 0
� Γ (t ) �
Our final assumption is needed in the choice of the normaliza- × Bu(0, t ) + A(D̂1 )Z (t ) (28)
tion coefficients in the adaptation laws for the delay estimates.
� 1
Assumption 3. The quantities λ = infD1 ∈[D ,D1 ] min{λmin (Q (D1 )), Γ (t ) = 1 + Z T (t )P (D̂1 )Z (t ) + a2 (1 + x)w 2 (x, t )dx
1 0
� 1
λmin (P (D1 ))} and λ = supD1 ∈[D1 ,D1 ] λmax (P (D1 )) exist and are
known. +k (1 + x)ξ T (x, t )ξ (x, t )dx, (29)
0
N. Bekiaris-Liberis, M. Krstic / Systems & Control Letters 59 (2010) 277–283 279
D̂ D̃1
with Using relations (16) and (17), the fact that D1 = 1 − and
1 D1
λD1 integrating by parts the last integral in (42) we obtain
k≤ (30)
8
Ż1 (t ) = F1 X1 (t ) + H1 ξ (0, t ) + B1 u(0, t )
D2 sup |P (D̂1 )B|2 � 1
Thus now, system (15)–(20) is mapped to the target system that is Using relations (52)–(55) together with Young’s and Cauchy–
comprised of (50) and (51). Moreover, the inverse transformation Schwartz’s inequalities, relations (65)–(66) and (57) we get the
of the state X (t ) is easily obtained from Eqs. (32)–(33) and the bounds of the lemma with
inverse transformation of (35) is given by
� � � Mp1 = MK2 e2MA D2 MR2 (73)
A(D̂1 )+BK (D̂1 ) D̂2 (t )x � �
u(x, t ) = w(x, t ) + K (D̂1 ) e Z (t )
Mp2 = 3 max MK2 e2MA D2 |B|2 , MK2 MA2 e2MA D2 (74)
� x � � � ��
A(D̂1 )+BK (D̂1 ) D̂2 (t )(x−y) �2
+ D̂2 (t ) e Bw(y, t )dy . (56) Mq1 = 3 max MK� D2 + D2 MK MA� |B|2 e2MA D2 ,
0
� �2 2M D �
We first prove that the signals in (50) and (51) that multiply the MK2 e2MA D2 MR1 , MK� + MK MA D2 �
e A 2
(75)
˙
‘‘disturbances’’ D̂i and D̃i , i = 1, 2., are bounded with respect to � �2
the system’s transformed states Z (t ), ξ (x, t ) and w(x, t ). Before Mq2 = MK2 1 + D2 MA e2MA D2 . � (76)
doing that, we point out that boundness of the transformed states
is equivalent to boundness of the original states.
Lemma 3. There exist constants k, a2 , γ1 and γ2 such that for the
Lemma 1. There exist constants Mu , Mw , MX and MZ such that Lyapunov function
� �
�u(t )�2 ≤ Mu �w(t )�2 + |Z (t )|2 (57) D̃21 (t ) D̃22 (t )
� � V (t ) = D2 log (1 + Ξ (t )) + a2 D2 + a2 , (77)
|X (t )|2 ≤ MX |Z (t )|2 + �ξ (t )�2 (58) D1 γ1 γ2
� � where
�w(t )�2 ≤ Mw �u(t )�2 + |Z (t )|2 (59) �
� � � � 1
T
|Z (t )|2 ≤ MZ |X (t )|2 + �ξ (t )�2 . (60) Ξ (t ) = Z (t ) P D̂1 Z (t ) + k (1 + x)ξ T (x, t )ξ (x, t )dx
0
� 1
Proof. First observe that the signals K (D̂1 ), P (D̂1 ) and A(D̂1 ) are
+ a2 (1 + x)w 2 (x, t )dx, (78)
continuously differentiable with respect to D̂1 . Moreover, since D̂1 0
and D̂2 are uniformly bounded, the signals K (D̂1 ), P (D̂1 ) and A(D̂1 ) the following holds
and their derivatives are also uniformly bounded. Denote by MK ,
MP and MA the bounds of K (D̂1 ), P (D̂1 ) and A(D̂1 ) respectively, and V (t ) ≤ V (0). (79)
with MK� , MP� and MA� the bounds of their derivatives. From relations
(32)–(33) and (35), (56) and using Young’s and Cauchy–Schwartz’s Proof. Taking the time derivative of the above function we obtain
inequalities it easy to show that the above bounds hold with
� � D̃1 � ˙ � D̃2 � ˙ �
2 V̇ (t ) = −2a2 D2 D̂1 (t ) − γ1 τD1 − 2a2 D̂2 (t ) − γ2 τD2
Mu = 3 max 1 + MK2 D2 e2D2 (MA +|B|MK ) 2
|B| , MK2 e2D2 (MA +|B|MK ) (61) D1 γ1 γ2
� � �
2 D2
MZ = 2 max 1, D1 e2|F1 |D1 |H1 | 2
(62) + −Z T (t )Q (D̂1 )Z (t ) + 2Z T (t )P (D̂1 )Bw(0, t )
1 + Ξ (t )
� 2
�
MX = 2 max 1, D1 e2|F1 |D1 |H1 |2 (63) 2k k
+ Z2T (t )Z2 (t ) − |ξ (0, t )|2
� 2
� D1 D1
Mw = 3 max 1 + MK2 D2 e2MA D2 |B|2 , MK2 e2MA D2 . � (64) � 1
a2 k
− w2 (0, t ) − ξ T (x, t )ξ (x, t )dx
D2 D1 0
We are now ready to state the following lemma � �
1
a2 ˙ ∂ P (D̂1 )
Lemma 2. There exist constants MR1 , MR2 , Mp1 , Mp2 , Mq1 and Mq2 − w (x, t )dx + D̂1 (t ) Z T (t )
2
Z (t )
D2 0 ∂ D̂1
such that the following bounds hold � 1 �
T
|R1 (t )|2 ≤ MR1 �ξ (t )�2 (65) + 2Z (t )P (D̂1 )R1 (t ) − 2a2 (1 + x)w(x, t )q1 (x, t )dx
0
� � �
|R2 (t )|2 ≤ MR2 |Z (t )|2 + |ξ (0, t )|2 + �ξ (t )�2 (66) � 1
� � − 2a2 D̂˙ 2 (t ) (1 + x)w(x, t )q2 (x, t )dx . (80)
p21 (x, t ) ≤ Mp1 |Z (t )|2 + |ξ (0, t )|2 + �ξ (t )�2 (67) 0
� �
p22 (x, t ) ≤ Mp2 |Z (t )|2 + u2 (0, t ) (68) Using the properties of the projector operators and relations
� � (24)–(25) we get
q21 (x, t ) ≤ Mq1 |Z (t )|2 + �u(t )�2 + �ξ (t )�2 (69)
�
q22 (x, t ) ≤ Mq2 �u(t )� , 2
(70) D2 2k
V̇ (t ) ≤ −Z T (t )Q (D̂1 )Z (t ) + Z2T (t )Z2 (t )
1 + Ξ (t ) D1
for all x ∈ [0, 1].
Proof. From relations (49) and (34) and by using Young’s and k a2
− |ξ (0, t )|2 − w 2 (0, t ) + Z T (t )P (D̂1 )Bw(0, t )
Cauchy–Schwartz’s inequalities we get the bounds for R1 (t ) and D1 D2
R2 (t ) with
� 1 � 1
k T a2
� �2 − ξ (x, t )ξ (x, t )dx − w2 (x, t )dx
D1 D2
MR1 = 1 + D1 |F1 | e2D2 |F1 | |H1 |2 (71) 0
�
0
� � ∂ P (D̂1 )
MR2 = 3|H1 |2 max e2D2 |F1 | |F1 |2 , 1, D1 |F1 |2 e2D2 |F1 | .
2
(72) + D̂˙ 1 (t ) Z T (t ) Z (t ) + 2Z T (t )P (D̂1 )R1 (t )
∂ D̂1
N. Bekiaris-Liberis, M. Krstic / Systems & Control Letters 59 (2010) 277–283 281
� 1
�
max {B1 , B2 }
− 2a2 (1 + x)w(x, t )q1 (x, t )dx m2 = � �, (91)
0 min λ, k, a2
� �
1 we get
− 2a2 D̂˙ 2 (t ) (1 + x)w(x, t )q2 (x, t )dx . (81) �
0 D2
V̇ (t ) ≤ − (m1 − m2 (γ1 + γ2 )) |Z (t )|2 + w 2 (0, t )
1 + Ξ (t )
Then using Young’s inequality and (30)–(31) we get �
� + �w(t )�2 + |ξ (0, t )|2 + �ξ (t )�2 . (92)
D2 λ k k
V̇ (t ) ≤ − |Z (t )|2 − |ξ (0, t )|2 − �ξ (t )�2
1 + Ξ (t ) 2 D1 D1 Thus when γ1 + γ2 ≤
m1
, V̇ (t ) is negative definite and thus
m2
�
a2 2 a2 ∂ P (D̂1 )
− w (0, t ) − �w(t )�2 + D̂˙ 1 (t ) Z T (t ) Z (t ) V (t ) ≤ V (0). � (93)
2D2 D2 ∂ D̂1
� 1 �
To prove the stability bound of Theorem 1 we use the following
+ 2Z T (t )P (D̂1 )R1 (t ) − 2a2 (1 + x)w(x, t )q1 (x, t )dx lemma.
0
� �
1 Lemma 4. There exist constants M and M such that
− 2a2 D̂˙ 2 (t ) (1 + x)w(x, t )q2 (x, t )dx . (82)
0 M Ξ (t ) ≤ Π (t ) ≤ M Ξ (t ), (94)
Using bounds (65)–(70) together with relations (26) and where
(24)–(25), and by employing Young’s inequality one more time we
get Π (t ) = |X (t )|2 + �ξ (t )�2 + �u(t )�2 . (95)
|D̂˙ 1 (t )| ≤ γ1 |τD1�| �
Proof. Immediate, using (57)–(60) with
|Z (t )|2 + |ξ (0, t )|2 + �ξ (t )�2 + �w(t )�2 M = max {Mu + MX , MX + 1} (96)
≤ γ1 M1 (83)
1 + Ξ (t ) M = max {Mw + MZ , MZ + 1} . � (97)
� �
˙ |Z (t )|2 + w2 (0, t ) + �w(t )�2
|D̂2 (t )| ≤ γ2 |τD2 | ≤ γ2 M2 , (84) We are now ready to derive the stability estimate of Theorem 1.
1 + Ξ (t )
Using (77) it follows that
where � �
� � V (t )
1 1 Ξ (t ) ≤ e D2 − 1 (98)
M1 = max Mp1 + MP + MP MR2 , 1 (85)
a2 a2 � �
� � V (t ) V (t )
M2 = max 1, 2Mp2 2Mp2 MK2 , + Mp2 . (86) D̃21 + D̃22 ≤ C2 ≤ C2 e D2 − 1 , (99)
D2
Plugging in the above bound to (82) (and applying once more
where
Young’s and Cauchy–Schwartz’s inequalities) we get
� �
� γ2 D2 + γ1 D1
D2 λ k k C2 = . (100)
V̇ (t ) ≤ − |Z (t )|2 − |ξ (0, t )|2 − �ξ (t )�2 a2
1 + Ξ (t ) 2 D1 D1
Consequently
a2 2 a2 2
− w (0, t ) − �w(t )� � �
2D2 D2 � � V (t )
� � Ω ( t ) ≤ M + C2 e D2
−1 . (101)
|Z (t )| + |ξ (0, t )|2 + �ξ (t )�2 + �w(t )�2
2
+ B1 γ1
1 + Ξ (t ) Moreover, from (77) we take
� � � �� �
× |Z (t )|2 + �ξ (t )�2 + �w(t )�2 V (0) ≤ max λ, k, a2 |Z (0)|2 + �ξ (0)�2 + �w(0)�2
� �
� � a2 a2 D2 � 2 �
|Z (t )|2 + w2 (0, t ) + �w(t )�2 + max , D̃1 (0) + D̃22 (0) , (102)
+ B2 γ2 γ2 γ1 D1
1 + Ξ (t )
� �� and using Lemma 4 we have
2 2
× |Z (t )| + �w(t )� , (87) V (0) ≤ C3 Ω (0), (103)
where
where � � � � ��
� � 1 D2 max λ, k, a2
B1 = M1 max MP + MP + a2 Mq1 + 2a2 Mq1 Mu + 2a2 Mq1 , C3 = max max , , . (104)
� 2γ2 2γ1 D1 M
MP MR1 + 2a2 Mq1 , 2a2 + 2a2 Mq1 Mu (88)
� � Thus, by setting
B2 = 2M2 a2 1 + Mq2 Mu . (89)
Now by defining the constants R = M + C2 (105)
� � ρ = C3 , (106)
λ k a2
m1 = min , , (90)
2 D1 2D2 we get the stability result in Theorem 1.
282 N. Bekiaris-Liberis, M. Krstic / Systems & Control Letters 59 (2010) 277–283
Fig. 2. The estimations of the unknown delays for the cases D̂2 (0) = 0 and D̂2
(0) = 1.6.
Fig. 1. System’s response for the cases D̂2 (0) = 0 and D̂2 (0) = 1.6.
We now turn our attention to proving the convergence of X (t ) at 0.25. The lower bounds for the unknown delays are D1 = 0.1
and U (t ) to zero. We use here an alternative to Barbalat’s Lemma for D1 and 0 for D2 . Analogously the upper bounds are chosen as
from [23]. We first point out that from (93) it follows that |Z (t )|, twice the real values of the delays i.e., D1 = 0.8 and D2 = 1.6.
�w(t )�, �ξ (t )�, D̂1 and D̂2 are uniformly bounded. Moreover, The initial conditions are chosen as X1 (0) = 0.5, X2 (0) = 0.5 and
using (57) and (58) we get the uniform boundness of |X (t )| and X2 (θ ) = 0.5, ∀θ ∈ [−D1 , 0], and finally D̂1 (0) = D1 = 0.1. The
�u(t )�. Using (23) it follows that U (t ) is uniformly bounded. From � chosen as a2 = 200, k �= 0.005, γ1 = 25,
controller parameters are
dX 2 (t )
(24)–(25), (83)–(84) and (50) we conclude that dt is uniformly γ2 = 25 and K (D̂1 ) = −10.0625e0.25D̂1 −8.5 .
bounded. Finally, since from (92) it turns out that |Z (t )| and �ξ (t )�
Figs. 1–3 show two distinct simulations, starting from two
are square integrable, using (58) and the alternative to Barbalat’s
extreme initial values for the input delay estimate, one at zero, and
Lemma from [23], we conclude that limt →∞ X (t ) = 0. We now
the other at twice the true delay value. In Figs. 1 and 3 we observe
turn our attention to proving the convergence of U (t ). Using (92)
that, as Theorem 1 predicts, convergence to zero is achieved for the
we also get that �w(t )� is square integrable in time. Thus, with the
states and the input, despite starting with initial estimate for the
help of (57) and by the square integrability of |Z (t )| we conclude
input delay at the two extreme values and for the state delay at the
using (23) that U (t ) is square integrable. It only remains to show
lower bound. In Fig. 2 one can see the evolution of the estimates for
dU 2 (t )
that dt
is uniformly bounded. Hence, it is sufficient to show that the two distinct simulation cases. The estimates for the two delays,
˙
U̇ (t ) is uniformly bounded. From (23) one can observe that since D̂1 after a transient response, converge to stabilizing for the system
˙ values.
and D̂2 are uniformly bounded, with the help of (16) and (19) we
dU 2 (t )
conclude the uniform boundness of dt
.
6. Conclusions
5. Simulations
In this paper we presented an adaptive control design for a
We give here a simulation example to illustrate the effective- system in feedforward form with simultaneous unknown input
ness of the proposed adaptive scheme. We choose a second order and state delays. The design of the controller is based on predictor
feedforward system with parameters F1 = F2 = 0.25, H1 = 1, feedback. The update laws for the estimation of the unknown
D1 = 0.4 and D2 = 0.8. This is an unstable system with two poles delays are based on the construction of a Lyapunov function with
N. Bekiaris-Liberis, M. Krstic / Systems & Control Letters 59 (2010) 277–283 283