On Exact Kalman Filtering of Polynomial Systems - Archive ouverte HAL
Article Dans Une Revue IEEE Transactions on Circuits and Systems I: Regular Papers Année : 2006

On Exact Kalman Filtering of Polynomial Systems

Résumé

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-to-noise 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.
Fichier principal
Vignette du fichier
2006_06_tcas_ExactKalmanFiltering.pdf (206.19 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Copyright (Tous droits réservés)

Dates et versions

hal-00170280 , version 1 (10-05-2023)

Licence

Copyright (Tous droits réservés)

Identifiants

Citer

Mihai Bogdan Luca, Stéphane Azou, Gilles Burel, Alexandru Serbanescu. On Exact Kalman Filtering of Polynomial Systems. IEEE Transactions on Circuits and Systems I: Regular Papers, 2006, 53 (6), pp.1329-1340. ⟨10.1109/TCSI.2006.870899⟩. ⟨hal-00170280⟩
358 Consultations
109 Téléchargements

Altmetric

Partager

More