Comparing Vision-Based Monte-Carlo Localization Methods

The task of localization is a recurrent subject in the domain of autonomous robotics. Even though it is a common subject, the differences among domains causes the need of different algorithms to solve the localization problem. This paper proposes a implementation of the Monte-Carlo Localization algo...

Full description

Saved in:
Bibliographic Details
Published in2018 Latin American Robotic Symposium, 2018 Brazilian Symposium on Robotics (SBR) and 2018 Workshop on Robotics in Education (WRE) pp. 437 - 442
Main Authors Almeida, Aislan C., Neto, Sylvio R.J., Bianchi, Reinaldo A.C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2018
Subjects
Autonomous Robot
Clustering algorithms
Dispersion
Humanoid
Legged locomotion
Localization
Monte Carlo Localization
Monte Carlo methods
Position Tracking
Prediction algorithms
RoboCup
Robot Localization
Robot sensing systems
Soccer
Vision based
Online AccessGet full text
DOI10.1109/LARS/SBR/WRE.2018.00084

Cover

More Information
Summary:The task of localization is a recurrent subject in the domain of autonomous robotics. Even though it is a common subject, the differences among domains causes the need of different algorithms to solve the localization problem. This paper proposes a implementation of the Monte-Carlo Localization algorithm in order to solve the localization problem for the domain of the RoboCup Humanoid Soccer KidSize. It implements methods to change the quantity of particles in function of their dispersion, to solve the robot kidnapping problem by scattering the particles and to predict the observation that leads to improvement of the confidence in the position of the robot. The experiments show that the proposed methods improved the localization process in comparison with traditional methods regarding the execution time of the algorithm and the quality of the estimated position.
DOI:10.1109/LARS/SBR/WRE.2018.00084