On Exact Kalman Filtering of Polynomial Systems

Abstract : A closed-form state estimator for some polynomial nonlinear systems is derived in this paper. Exploiting full Taylor series expansion we first give exact matrix expressions to compute mean and covariance of any random variable distribution that has been transformed through a polynomial function. An original discrete-time Kalman filtering implementation relying on this exact polynomial transformation is proposed. The important problem of chaotic synchronization of Chebyshev maps is then considered to illustrate the significance of these results. Mean Square Error (MSE) between synchronized signals and consistency criteria are chosen as performance measures under various signal-tonoise ratios (SNR). Comparisons to the popular Extended Kalman Filter (EKF) and to the recent Unscented Kalman Filter (UKF) are also conducted to show the pertinence of our filtering formulation.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00170280
Contributor : Stéphane Azou <>
Submitted on : Friday, September 7, 2007 - 10:09:31 AM
Last modification on : Thursday, December 19, 2019 - 1:26:20 AM

Identifiers

Citation

Mihai Bogdan Luca, Stéphane Azou, Gilles Burel, Alexandru Serbanescu. On Exact Kalman Filtering of Polynomial Systems. IEEE Transactions on Circuits and Systems - Part I, 2006, 53 (6), pp.1929-1340. ⟨10.1109/TCSI.2006.870899⟩. ⟨hal-00170280⟩

Share

Metrics

Record views

388