Gaussian Kernel Posterior Elimination for Fast Look-Ahead Rao-Blackwellised Particle Filtering for SLAM

Article Preview

Abstract:

In this paper, we explore a method for posterior elimination for fast computation of the look-ahead Rao-Blackwellised Particle Filtering (Fast la-RBPF) algorithm for the simultaneous localization and mapping (SLAM) problem in the probabilistic robotics framework. In the case when a lot of SLAM states need to be estimated, large posterior states associated with the correct state may be outnumbered by multiple non-zero smaller posteriors. We show that by masking the low posterior weight states with a Gaussian kernel prior to weight selection the accuracy of the la-RBPF SLAM algorithm can be improved. Simulation results reveal that integrated with the proposed method the fast la-RBPF SLAM performance is enhanced over both the existing RBPF SLAM and the unmodified la-RBPF SLAM algorithms.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

555-558

Citation:

Online since:

August 2015

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] N. De Freitas, R. Dearden, F. Hutter, R. Morales-menéndez, J. Mutch, and D. Poole, Diagnosis by a waiter and a mars explorer, in: Proceeding of the IEEE, special, vol. 92, no. 3, 2004, 445—468.

DOI: 10.1109/jproc.2003.823157

Google Scholar

[2] S. Gao and R. Lotun, FastSLAM with Look-ahead RBPF, in: Tech. Rep., University of British Columbia, (2004).

Google Scholar

[3] P. Yuvapoositanon, Fast computation of look-ahead rao-blackwellised particle filter in SLAM, in: Proceedings of the International Electrical Engineering Congress, Pattaya, Chonburi, Thailand, (2014).

DOI: 10.1109/ieecon.2014.6925957

Google Scholar