Monte Carlo localization: efficient position estimation for mobile robots
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Two-Tiered Approach to Self-Localization
RoboCup 2001: Robot Soccer World Cup V
Self-Localization in the RoboCup Environment
RoboCup-99: Robot Soccer World Cup III
A Localization Method for a Soccer Robot Using a Vision-Based Omni-Directional Sensor
RoboCup 2000: Robot Soccer World Cup IV
Vision-Based Localization in RoboCup Environments
RoboCup 2000: Robot Soccer World Cup IV
Towards a Calibration-Free Robot: The ACT Algorithm for Automatic Online Color Training
RoboCup 2006: Robot Soccer World Cup X
Robot orientation with histograms on MSL
Robot Soccer World Cup XV
Hi-index | 0.00 |
Recently, efficient self-localization methods have been developed, among which probabilistic Monte-Carlo localization (MCL) is one of the most popular. However, standard MCL algorithms need at least 100 samples to compute an acceptable position estimation. This paper presents a novel approach to MCL that uses an adaptive number of samples that drops down to a single sample if the pose estimation is sufficiently accurate. Experiments show that the method remains in this efficient single sample tracking modefor more than 90% of the cycles.