Adaptative high-gain extended Kalman filter and applications
Adaptative high-gain extended Kalman filter and applications
Adaptative high-gain extended Kalman filter and applications
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
tel-00559107, version 1 - 24 Jan 2011<br />
For t ∈ [kδt;(k + 1)δt[,<br />
<strong>and</strong><br />
d ˜ S<br />
dt<br />
d˜ɛ<br />
dt<br />
� �<br />
= θ − A(u)+ 1<br />
θ ˜b ∗ �′<br />
(z, u)<br />
5.2 Continuous-discrete Framework<br />
�<br />
= θ A(u)˜ɛ + 1<br />
� �<br />
˜b(˜z, u) − b(˜x, u)<br />
θ<br />
�<br />
, (5.29)<br />
˜S − ˜ �<br />
S A(u)+ 1<br />
θ ˜b ∗ �<br />
(z, u) − ˜ SQ˜ �<br />
S . (5.30)<br />
We now consider the Lyapunov function ˜ɛ ′ ˜ S˜ɛ <strong>and</strong> use identities (5.29, 5.30) to obtain the<br />
equality below:<br />
�<br />
d ˜ɛ ′ �<br />
S˜ɛ ˜ �<br />
2<br />
dt = θ θ ˜ɛ′ � �<br />
S˜<br />
˜b(˜z, u) − ˜b(˜x, u) − ˜b ∗ (˜z, u)˜ɛ − ˜ɛ ′ �<br />
SQ ˜ S˜ɛ ˜ .<br />
(5.31)<br />
Similarly, at time kδt,<br />
�<br />
˜ɛk(+) = Id − θδt ˜ S −1 ′<br />
k (+)C r−1 �<br />
C ˜ɛk(−), (5.32)<br />
<strong>and</strong>,<br />
˜Sk(+) = ˜ Sk(−)+θδtC ′<br />
r −1 C. (5.33)<br />
As we did for the differential equations, we use (5.32) <strong>and</strong> (5.33) to compute the Lyapunov<br />
function at time kδt:<br />
�<br />
˜ɛ ′ �<br />
S˜ɛ ˜ (+) = ˜ɛ′ k<br />
k (−)<br />
�<br />
Id − θδt ˜ S −1<br />
k<br />
�<br />
From (5.33), we replace<br />
(+)C ′<br />
×<br />
= ˜ɛ ′<br />
k (−)<br />
�<br />
˜Sk(+) − 2θδtC ′<br />
r−1C r−1 �′<br />
C<br />
Id − θδt ˜ S −1<br />
k<br />
˜Sk(+)<br />
(+)C ′<br />
r −1 C<br />
�<br />
˜ɛk(−)<br />
+(θδt) 2 C ′<br />
r −1 C ˜ Sk(+) −1 C ′<br />
r −1 C<br />
�<br />
θδtC ′<br />
r−1 � �<br />
C with ˜Sk(+) − ˜ �<br />
Sk(−) :<br />
�<br />
˜ɛ ′ �<br />
S˜ɛ ˜ (+) = ˜ɛ′<br />
k<br />
From equation (5.33) we write:<br />
S −1<br />
k<br />
k (−)<br />
= ˜ɛ ′<br />
k (−)<br />
�<br />
˜Sk(−) ˜ Sk(+) −1 �<br />
Sk(−) ˜<br />
� ˜Sk(−) −1 ˜ Sk(+) ˜ Sk(−) −1<br />
−1<br />
(−)Sk(+)Sk (−) =S−1<br />
k (−)+θδt<br />
<strong>and</strong> compute [S −1<br />
k<br />
This results in:<br />
�<br />
˜ɛ ′ �<br />
S˜ɛ ˜<br />
k (+) = ˜ɛ′ � Sk(−) ˜ − C ′<br />
( r<br />
θδt + C ˜ S −1<br />
=<br />
k<br />
�<br />
˜ɛ ′ �<br />
S˜ɛ ˜ (−) − ˜ɛ′ k (−)<br />
�<br />
C ′<br />
( r<br />
r S−1<br />
k<br />
(−)C ′<br />
˜ɛk(−)<br />
� −1<br />
˜ɛk(−).<br />
�<br />
˜ɛk(−).<br />
(5.34)<br />
(5.35)<br />
CS −1<br />
k (−), (5.36)<br />
(−)Sk(+)S −1<br />
k (−)]−1 by using Lemma 64 with λ = θδt<br />
r <strong>and</strong> M = ˜ S −1<br />
k (−).<br />
k<br />
109<br />
′<br />
(−)C ) −1 �<br />
C ˜ɛ<br />
θδt + C ˜ S −1<br />
k<br />
(−)C ′<br />
) −1 C<br />
�<br />
˜ɛk(−).<br />
(5.37)