Efficient multi-hypotheses unscented kalman filtering for robust localization

21Citations
Citations of this article
29Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes an approach to Gaussian mixture filtering which combines the accuracy of the Kalman filter and the robustness of particle filters without sacrificing computational efficiency. Critical approximations of common Gaussian mixture algorithms are analyzed and similarities are pointed out to particle filtering with an extremely low number of particles. Known techniques from both fields are applied in a new combination resulting in a multi-hypotheses Kalman filter which is superior to common Kalman filters in its ability of fast relocalization in kidnapped robot scenarios and its representation of multi-modal belief distributions, and which outperforms particle filters in localization accuracy and computational efficiency. © 2012 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Jochmann, G., Kerner, S., Tasse, S., & Urbann, O. (2012). Efficient multi-hypotheses unscented kalman filtering for robust localization. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7416 LNCS, 222–233. https://doi.org/10.1007/978-3-642-32060-6_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free