Abstract

One of the most important skills desired for a mobile robot is the ability to obtain its own location even in challenging environments. The information provided by the sensing system is used here to solve the global localization problem. In our previous work, we designed different algorithms founded on evolutionary strategies in order to solve the aforementioned task. The latest developments are presented in this paper. The engine of the localization module is a combination of the Markov chain Monte Carlo sampling technique and the Differential Evolution method, which results in a particle filter based on the minimization of a fitness function. The robot’s pose is estimated from a set of possible locations weighted by a cost value. The measurements of the perceptive sensors are used together with the predicted ones in a known map to define a cost function to optimize. Although most localization methods rely on quadratic fitness functions, the sensed information is processed asymmetrically in this filter. The Kullback-Leibler divergence is the basis of a cost function that makes it possible to deal with different types of occlusions. The algorithm performance has been checked in a real map. The results are excellent in environments with dynamic and unmodeled obstacles, a fact that causes occlusions in the sensing area.

Highlights

  • The sensing system of a mobile robot plays a fundamental role in almost all tasks that it can perform

  • Monte Carlo (MC) will be very efficient in re-localization, but it can be inefficient in global localization (GL), because a high number of particles is needed to make an adequate approximation of the density function

  • The sensor noise has been modeled as a Gaussian distribution over the laser distance where the standard deviation specifies the noise

Read more

Summary

Introduction

The sensing system of a mobile robot plays a fundamental role in almost all tasks that it can perform. Our recent work is focused on the development of a self-localization module for the experimental platform MANFRED-2 (http://roboticslab.uc3m.es/roboticslab/robot/manfred-2), fully developed by the Robotics Lab of the Carlos III University of Madrid This platform is equipped with a laser range finder that gives the robot information about the environment. The works of Metropolis [7] and Hastings [8] laid the foundation for a large class of sampling algorithms named Markov chain Monte Carlo (MCMC) [9] In this type of method, the target distribution is approximated by a set of samples that explore the state space following a Markov chain mechanism. A new version of the filter where the KL divergence-based cost function [5] is implemented together with the DE-MC GL algorithm [11] is presented.

Related Work
Kullback-Leibler Divergence
Kullback-Leibler Divergence between Two Scans
Sensor Probability Models
KL-Based Fitness Function
Markov Chain Monte Carlo and Differential Evolution
Monte Carlo Sampling
Markov Chain Monte Carlo-Metropolis-Hastings Method
Differential Evolution Algorithm for GL
KL-Based Differential Evolution Markov Chain GL Filter
Experimental Results
Global Localization
Global Localization and Pose Tracking
Uniform Noise
Unmodeled Obstacles
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call