The Reverse Monte Carlo localization algorithm

Global localization is a very fundamental and challenging problem in Robotic Soccer. Here, the main aim is to find the best method which is very robust and fast and requires less computational resources and memory compared to similar approaches and is precise enough for robot soccer games and technical challenges. In this work, the Reverse Monte Carlo localization (R-MCL) method is introduced. The algorithm is designed for fast, precise and robust global localization of autonomous robots in the robotic soccer domain, to overcome the uncertainties in the sensors, environment and the motion model. R-MCL is a hybrid method based on Markov localization (ML) and Monte Carlo localization (MCL), where the ML based module finds the region where the robot should be and the MCL based part predicts the geometrical location with high precision by selecting samples in this region. It is called Reverse since the MCL routine is applied in a reverse manner in this algorithm. In this work, this method is tested on a challenging data set that is used by many other researchers and compared in terms of error rate against different levels of noise, and sparsity. Additionally, the time required to recover from kidnapping and the processing time of the methods are tested and compared. According to the test results R-MCL is a considerable method against high sparsity and noise. It is preferable when its recovery from kidnapping and processing times are considered. It gives robust and fast but relatively coarse position estimations against imprecise and inadequate perceptions, and coarse action data, including regular misplacements, and false perceptions.

[1]  Sebastian Thrun,et al.  Probabilistic robotics , 2002, CACM.

[2]  Wolfram Burgard,et al.  Robust Monte Carlo localization for mobile robots , 2001, Artif. Intell..

[3]  Wolfram Burgard,et al.  Estimating the Absolute Position of a Mobile Robot Using Position Probability Grids , 1996, AAAI/IAAI, Vol. 2.

[4]  Wolfram Burgard,et al.  Probabilistic state estimation of dynamic objects with a moving mobile robot , 2001, Robotics Auton. Syst..

[5]  Hatice Kose-Bagci,et al.  Robots from Nowhere , 2004, RoboCup.

[6]  Dieter Fox,et al.  An experimental comparison of localization methods continued , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Çetin Meriçli,et al.  Practical Extensions to Vision-Based Monte Carlo Localization Methods for Robot Soccer Domain , 2005, RoboCup.

[8]  Dieter Fox,et al.  Adapting the Sample Size in Particle Filters Through KLD-Sampling , 2003, Int. J. Robotics Res..

[9]  Tucker R. Balch,et al.  Collaborative probabilistic constraint-based landmark localization , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[10]  Alessandro Saffiotti,et al.  Fuzzy landmark-based localization for a legged robot , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).

[11]  Manuela M. Veloso,et al.  Sensor resetting localization for poorly modelled mobile robots , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[12]  Patric Jensfelt,et al.  An experimental comparison of localisation methods, the MHL sessions , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[13]  Tucker R. Balch,et al.  Constraint-Based Landmark Localization , 2002, RoboCup.

[14]  Hatice Kose-Bagci,et al.  A Fuzzy Touch to R-MCL Localization Algorithm , 2005, RoboCup.

[15]  W. Burgard,et al.  Markov Localization for Mobile Robots in Dynamic Environments , 1999, J. Artif. Intell. Res..