28.01.2013 Views

Adaptative high-gain extended Kalman filter and applications

Adaptative high-gain extended Kalman filter and applications

Adaptative high-gain extended Kalman filter and applications

SHOW MORE
SHOW LESS

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 On Adaptive High-<strong>gain</strong> Observers<br />

disturbances [18]. This section deals with the observer described in [31], <strong>and</strong> in particular<br />

with the adaptive scheme proposed in [30]. The analysis they propose is set in the discrete<br />

time setting.<br />

First of all, note that the approach we described in the first part of this Chapter, <strong>and</strong><br />

the approach followed in the articles cited above are different, in the sense that the systems<br />

considered are not expected to display the same observability property. Indeed in the present<br />

case, the authors only need the system to be N-locally uniformly observable <strong>and</strong> do not<br />

perform any change of variables. This implies that the class of nonlinear systems for which<br />

the observer is proven to converge is bigger than the one considered in the present work (see<br />

the numerical examples displayed in [30], for example). This observer can be used for systems<br />

that cannot be put into a canonical observability form. The drawback to this approach then,<br />

is that the observer converges locally <strong>and</strong> asymptotically (i.e. the state error is not upper<br />

bounded by an exponential term).<br />

Definition 26<br />

1. We consider a discrete, nonlinear, system as in Definition 25 where xk ∈ R n , uk ∈ R nu<br />

<strong>and</strong> yk ∈ R ny . The maps f <strong>and</strong> h are assumed to be continuously differentiable with<br />

respect to the variable x.<br />

2. The observer is defined as:<br />

�<br />

zk+1/k = f(zk,uk)<br />

Pk+1/k = FkPkF ′<br />

k + Qk<br />

where<br />

<strong>and</strong><br />

�<br />

z k+1/k+1 = z k+1/k − Kk+1(h(z k+1/k) − yk+1)<br />

P k+1/k+1 = (In − Kk+1Hk+1)P k+1/k<br />

Kk+1 = P k+1/kH ′<br />

k+1 (Hk+1P k+1/kH ′<br />

k+1 + Rk+1) −1 ,<br />

∂f(x, uk)<br />

Fk = |x=zk<br />

∂x<br />

,<br />

∂h(x, uk)<br />

Hk = |x=z . k+1/k ∂x<br />

(2.18)<br />

This definition is that of a discrete <strong>extended</strong> <strong>Kalman</strong> <strong>filter</strong>. It is completed by a set of<br />

assumptions that appear in the statement of the convergence theorem. Since the <strong>extended</strong><br />

<strong>Kalman</strong> <strong>filter</strong> is known to converge when the estimated state is very close to the real state,<br />

the following theorem increases the size of this region.<br />

Theorem 27 ([30])<br />

We assume that:<br />

1. the system defined in equation (2.17) is N-locally uniformly rank observable, that is to<br />

33

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!