An Adaptive UKF-Based  Particle Filter for Mobile Robot SLAM

The mobile robot Simultaneous Localization and Mapping (SLAM) in unknown environments has been considered to be an important and fundamental problem in the mobile robotics research domain. Nowadays most methods for SLAM are focused on probabilistic Bayesian estimation, this paper propose an Unscented Kalman Filter (UKF) Assistant-Proposal Distribution (UKF-APD) particle algorithm,compute the Euclidean distance of particle approximate distribution to the UKF-APD, and take it as an adaptive particle-resampling criterion, the proposed algorithm can avoid particles’ impoverishment and deviation to the real robot posterior distribution. Experimental results demonstrate the effectiveness of the proposed algorithm.

[1]  José A. Castellanos,et al.  Robocentric map joining: Improving the consistency of EKF-SLAM , 2007, Robotics Auton. Syst..

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

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

[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]  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.