Adaptative high-gain extended Kalman filter and applications
Adaptative high-gain extended Kalman filter and applications
Adaptative high-gain extended Kalman filter and applications
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
tel-00559107, version 1 - 24 Jan 2011<br />
2.6.6 E. Busvelle <strong>and</strong> J-P. Gauthier<br />
2.6 On Adaptive High-<strong>gain</strong> Observers<br />
The article [38] of E. Busvelle <strong>and</strong> J-P Gauthier propose an observer that is <strong>high</strong>-<strong>gain</strong> at<br />
time 0 <strong>and</strong> then decreases toward 1. In a nutshell, the observer evolves from a pure <strong>high</strong>-<strong>gain</strong><br />
mode that ensures convergence to an <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> configuration that efficiently<br />
smooths the noise. To achieve this, the <strong>high</strong>-<strong>gain</strong> parameter is allowed to decrease <strong>and</strong> the<br />
convergence is proven. This article is, in some sense, the starting point of the present Ph.D.<br />
work.<br />
Definition 28<br />
The <strong>high</strong>-<strong>gain</strong> <strong>and</strong> non <strong>high</strong>-<strong>gain</strong> <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong>, for a system as defined<br />
in Section 2.4, is given by the three equations:<br />
⎧<br />
⎪⎨<br />
dz<br />
dt = A(u)z + b(z, u) − S(t)−1C ′<br />
R−1 (Cz − y(t))<br />
dS<br />
dt = −(A(u)+b∗ (z, u)) ′<br />
S − S(A(u)+b∗ (z, u)) + C ′<br />
R−1C − SQθS (2.19)<br />
⎪⎩<br />
dθ<br />
dt<br />
= λ(1 − θ)<br />
where Qθ = θ 2 ∆ −1 Q∆ −1 , ∆ = diag( � 1, 1<br />
θ<br />
, ..., ( 1<br />
θ )n−1� ), Q <strong>and</strong> R as in (2.9), <strong>and</strong> λ is a<br />
positive parameter.<br />
If θ (0) = 1, then θ (t) ≡ 1 <strong>and</strong> (2.19) is nothing else than a classical <strong>extended</strong> <strong>Kalman</strong><br />
<strong>filter</strong> applied in a canonical form of coordinates. Therefore it may not converge, depending<br />
on the initial conditions of the system.<br />
If λ =0<strong>and</strong> θ (0) = θ0 are large, then θ (t) ≡ θ0 remains large <strong>and</strong> (2.19) is a <strong>high</strong>-<strong>gain</strong><br />
<strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> as defined above in Equation (2.9).<br />
The idea in (2.19) is to set θ (0) to a sufficiently large value, <strong>and</strong> to set λ to a sufficiently<br />
small value such that the observer converges exponentially quickly at the beginning. The<br />
estimated state reaches the vicinity of the real trajectory before θ becomes too small <strong>and</strong> the<br />
local convergence of the <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> guarantees that it will remain close to the<br />
state of the system.<br />
Theorem 29<br />
For any ε ∗ > 0, there exists λ0 such that for all 0 ≤ λ ≤ λ0, for all θ0 large enough, for<br />
all S0 ≥ c Id, for all χ ⊂ R n , χ a compact subset, for all ε0 = z0 − x0,with (z0,x0) ∈ χ 2 , with<br />
x0 ∈ χ the following estimation holds for all t ≥ 0:<br />
Moreover the short term estimate<br />
||ε(t)|| 2 ≤ ||ε (0) || 2 ε ∗ e −at .<br />
||ε(t)|| 2 ≤ ||ε(0)|| 2 θ(t) 2(n−1) e −(a1θ(T )−a2)t<br />
holds for all T>0 <strong>and</strong> for all 0 ≤ t ≤ T , for all θ0 sufficiently large. The scalars a1 <strong>and</strong> a2<br />
are positive constants.<br />
This theorem demonstrates that the observer converges for any initial error. Nevertheless<br />
it is clearly not a persistent observer since after some time it is more or less equivalent to<br />
an <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong> because θ (t) is close to one. In order to make it persistent, the<br />
authors propose to use several such observers, each of them being initialized at different times<br />
35