An Improved Rao-Blackwellized Particle Filter for SLAM

Simultaneous localization and map building (SLAM) is one of the fundamental problems in robot navigation, and FastSLAM algorithms based on Rao-Blackwellized particle filters (RBPF) have become popular tools to solve the SLAM problems. For solving the potential limitations, which are the derivation of the Jacobian matrices, and particles impoverishment in SLAM algorithms, this paper proposes an improved algorithm based on unscented Kalman filter (UKF) for landmark feature estimate and particles resampling strategy to overcome the above- mentioned drawbacks. Experimental results demonstrate the effectiveness of the proposed algorithm.

[1]  Wan Kyun Chung,et al.  Unscented FastSLAM: A Robust Algorithm for the Simultaneous Localization and Mapping Problem , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[2]  Eduardo Mario Nebot,et al.  Consistency of the EKF-SLAM Algorithm , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[3]  Matthew R. Walter,et al.  Sparse extended information filters: insights into sparsification , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[4]  Wolfram Burgard,et al.  Improving Grid-based SLAM with Rao-Blackwellized Particle Filters by Adaptive Proposals and Selective Resampling , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[5]  Wolfram Burgard,et al.  An efficient fastSLAM algorithm for generating maps of large-scale cyclic environments from raw laser range measurements , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[6]  Sebastian Thrun,et al.  FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.

[7]  Kevin P. Murphy,et al.  Bayesian Map Learning in Dynamic Environments , 1999, NIPS.