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 />
2.6 On Adaptive High-<strong>gain</strong> Observers<br />
(of matrices). The corresponding matrix (denoted S or P ) is called the Riccati matrix. It is<br />
a symmetric <strong>and</strong> positive definite matrix 12 . Since S is a (n × n) symmetric square matrix,<br />
we only need to compute the upper or the lower part of the matrix (i.e. there are n(n+1)<br />
2<br />
equations to solve).<br />
Definition 15<br />
The <strong>high</strong>-<strong>gain</strong> <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> is defined by the two equations below:<br />
�<br />
dz<br />
dt = A(u)z + b(z, u) − S−1C ′<br />
R−1 (Cz − y)<br />
dS<br />
dt = −(A(u)+b∗ (z, u)) ′<br />
S − S(A (u)+b∗ (z, u)) + C ′<br />
R−1C − SQθS.<br />
(2.9)<br />
The matrices Q <strong>and</strong> R are originally the covariance matrices of the state <strong>and</strong> output<br />
noise respectively, <strong>and</strong> therefore are expected to be symmetric <strong>and</strong> positive definite. Since<br />
this observer is developed within the frame of the deterministic observation theory, those two<br />
matrices will be used as tuning parameters. Qθ is defined as Qθ = θ 2 ∆ −1 Q∆ −1 where θ > 1<br />
is a fixed parameter <strong>and</strong><br />
⎛<br />
1 0 · · · 0<br />
⎜<br />
∆ = ⎜<br />
0<br />
⎜<br />
⎝ .<br />
1<br />
θ<br />
. ..<br />
. ..<br />
. ..<br />
.<br />
0<br />
0 · · · 0 1<br />
θn−1 ⎞<br />
⎟<br />
⎠ .<br />
In most cases, normal form representations are not used when implementing an <strong>extended</strong><br />
<strong>Kalman</strong> <strong>filter</strong> (case θ = 1). The Jacobian matrices of f <strong>and</strong> h (computed with respect to the<br />
variable x) are used in the Riccati equation:<br />
dS<br />
dt<br />
� �′ � � � �′<br />
∂f<br />
∂f ∂h<br />
= −<br />
S − S<br />
+<br />
R<br />
∂x |x=z ∂x |x=z ∂x |x=z<br />
−1<br />
� �<br />
∂h<br />
− SQθS.<br />
∂x |x=z<br />
Refer to Chapter 1 for a more detailed explanation.<br />
Theorem 16 ([47, 57])<br />
For θ large enough <strong>and</strong> for all T>0, the <strong>high</strong>-<strong>gain</strong> <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> (2.9) satisfies<br />
the inequality below for all t> T<br />
θ :<br />
�z(t) − x(t)� 2 ≤ θ n−1 k(T )�z( T<br />
) − x(T<br />
θ θ )�2 T<br />
−(θω(t)−µ(T ))(t−<br />
e θ )<br />
for some positive continuous functions k(T ), ω(T ) <strong>and</strong> µ(T ).<br />
2.6 On Adaptive High-<strong>gain</strong> Observers<br />
In this section, we review a few adaptation strategies for the <strong>high</strong>-<strong>gain</strong> parameter that<br />
can be found in the literature. Strategies that are based on Luenberger like 13 observers are<br />
12 The fact that the solution of the Riccati equation of the observer (2.9) remains definite positive is not<br />
obvious <strong>and</strong> must be proven. Such a proof can be found in [57], Lemma 6.2.15 <strong>and</strong> Appendix B in the<br />
continuous discrete case.<br />
13 Here Luenberger like has to be understood in a broad sense. That is: observers with a correction <strong>gain</strong><br />
matrix that is not computed online <strong>and</strong>, most of the time, computed following a pole placement-like scheme.<br />
21