Comparison of EKF and PEKF in a SLAM context - Université Clermont Auvergne Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Comparison of EKF and PEKF in a SLAM context

Résumé

This paper introduces an implementation of the Polynomial Extended Kalman Filter (PEKF) to solve the Simultaneous Localization and Map building (SLAM) problem. The proposed solution is a filtering algorithm which is a polynomial transformation of state evolution and measurement equations. The performances of the algorithm have been evaluated through two simulation runs. The first ones underline consistency improvement in comparison with the standard Extended Kalman Filter. The other simulation results show the PEKF efficiency when the values of measurement noises are high. At the end, experiments with Victoria Park data are presented too.
Fichier non déposé

Dates et versions

hal-00343543 , version 1 (01-12-2008)

Identifiants

  • HAL Id : hal-00343543 , version 1

Citer

François Chanier, Paul Checchin, Christophe Blanc, Laurent Trassoudaine. Comparison of EKF and PEKF in a SLAM context. 11th IEEE International Conference on Intelligent Transportation Systems, Oct 2008, Beijing, China. pp.203. ⟨hal-00343543⟩
67 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More