Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
FastSLAM: a factored solution to the simultaneous localization and mapping problem
Eighteenth national conference on Artificial intelligence
DP-SLAM: fast, robust simultaneous localization and mapping without predetermined landmarks
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Improved Techniques for Grid Mapping With Rao-Blackwellized Particle Filters
IEEE Transactions on Robotics
Hi-index | 0.00 |
Simultaneous Localization and Mapping (SLAM) is one of the classical problems in mobile robotics. The task is to build a map of the environment using on-board sensors while at the same time localizing the robot relative to this map. Rao-Blackwellized particle filters have emerged as a powerful technique for solving the SLAM problem in a wide variety of environments. It is a well-known fact for sampling-based approaches that the choice of the proposal distribution greatly influences robustness and efficiency achievable by the algorithm. In this paper, we present an improved proposal distribution for grid-based SLAM with Rao-Blackwellized particle filters, which utilizes whole sequences of sensor measurements rather than only the most recent one. We have implemented our system on a real robot and evaluated its performance on standard datasets as well as in hard outdoor settings with few and ambiguous features. Our approach improves the localization accuracy and the map quality, substantially reducing the risk of mapping failures.