Monte-Carlo localization uses particle filtering to estimate the position of the robot. The method is known to suffer from the loss of potential positions when there is ambiguity present in the environment. Since many indoor environments are highly symmetric, this problem of premature convergence is problematic for indoor robot navigation. It is, however, rarely studied in particle filters. We introduce a number of so-called niching methods used in genetic algorithms, and implement them on a particle filter for Monte-Carlo localization. The experiments show a significant improvement in the diversity maintaining performance of the particle filter. ; NOTICE: this is the author’s version of a work that was accepted for publication in Robotics and Autonomous Systems. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Robotics and Autonomous System, VOL 57, ISSUE 11, 17 July 2009. DOI:10.1016/j.robot.2009.07.003QC 20111108
Tackling the Premature Convergence Problem in Monte-Carlo Localization
2009-01-01
Scopus 2-s2.0-70350055066
Article (Journal)
Electronic Resource
English
DDC: | 629 |
Dynamic Maps in Monte Carlo Localization
British Library Conference Proceedings | 2005
|Bootstrapping Procedure to Determine Convergence in Monte Carlo Simulations
Transportation Research Record | 2011
|Robust Monte-Carlo Localization Using Adaptive Likelihood Models
Springer Verlag | 2006
|Bootstrapping Procedure to Determine Convergence in Monte Carlo Simulations
Online Contents | 2011
|Localization of Indoor Mobile Robot Using Monte Carlo Localization Algorithm (MCL)
BASE | 2016
|