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 />
B.1 Bounds on the Riccati Equation<br />
observation matrix is fixed (i.e. not u-dependent), the derivative of such a m matrix is<br />
bounded.<br />
If we want to consider C matrices defined with a function α1 as in the continuous case,<br />
the derivative of this function must have a bounded time derivative. The consequence is that<br />
bang-bang like control inputs become inadmissible.<br />
We now have gathered all the elements necessary to prove the second half of this subsection’s<br />
result.<br />
Lemma 95<br />
Consider equation (B.1) <strong>and</strong> the assumptions of Lemma 77. Let T∗ > 0 be fixed. There<br />
exist α2 > 0 <strong>and</strong> µ>0 such that for all subdivision {τi}i∈N with τi − τi−1 β |Q|:<br />
S1(+) = e−λτ1φu(τ1, 0)S0φ ′<br />
� u(τ1, 0)<br />
τ1<br />
+λ e −λ(τ1−v)<br />
φu(τ1,v)<br />
In the same manner we obtain at time τ2:<br />
τ1<br />
0<br />
S2(+) = e−λ(τ2−τ1) φu(τ2, τ1)S1(+)φ ′<br />
� u(τ2, τ1)<br />
τ2<br />
+λ e −λ(τ2−v)<br />
�<br />
φu(τ2,v) S(v) − S(v)QS(v)<br />
λ<br />
�<br />
S(v) − S(v)QS(v)<br />
�<br />
φ<br />
λ<br />
′<br />
u(τ1,v)dv + C ′<br />
R −1 Cτ1.<br />
�<br />
φ ′<br />
u(τ2,v)dv + C ′<br />
R −1 C(τ2 − τ1).<br />
A few computations (see Appendix A.1 for the resolvent’s properties) lead to:<br />
S2(+) = e−λτ2φu(τ2, 0)S0φ ′<br />
� u(τ2, 0)<br />
τ2<br />
+λ e<br />
0<br />
−λ(τ2−v)<br />
�<br />
φu(τ2,v) S(v) − S(v)QS(v)<br />
�<br />
φ<br />
λ<br />
′<br />
u(τ2,v)dv<br />
+e−λ(τ2−τ1) φu(τ2, τ1)C ′<br />
R−1C(τ2 − τ1).<br />
R −1 Cφ ′<br />
u(τ2, τ1)τ1 + C ′<br />
4 The matrix inequality we want to achieve implies, in particular, the invertibility of the matrices Sk(+),<br />
k ∈ N. It implies the invertibility of the sum that appears in (B.13). This matrix cannot be inverted if there<br />
are less than n summation terms.<br />
As is explained at the end of the proof, the result is achieved provided that the step size of the subdivision<br />
used in the summation is small enough. Since we have the freedom to make µ as small as we want, the<br />
summation above mentioned can be performed with sufficiently many points whatever the value of T ∗ . It<br />
makes the requirement T∗ ≥ nµ redundant.<br />
Recall now that µ represents the maximum sampling that allows us to use the observer. Lemma 89 provides<br />
us with a first value for µ, <strong>and</strong> it is pretty much system dependent. By removing the assumption, we probably<br />
have to shorten µ for the sake of mathematical elegance only.<br />
We think that the proof is better that way.<br />
148