Dynamic maps in monte carlo localization

  • Authors:
  • Adam Milstein

  • Affiliations:
  • School of Computer Science, University of Waterloo, Waterloo, ON

  • Venue:
  • AI'05 Proceedings of the 18th Canadian Society conference on Advances in Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Mobile robot localization is the problem of tracking a moving robot through an environment given inaccurate sensor data and knowledge of the robot's motion Monte Carlo Localization (MCL) is a popular probabilistic method of solving the localization problem By using a Bayesian formulation of the problem, the robot's belief is represented by a set of weighted samples and updated according to motion and sensor information One problem with MCL is that it requires a static map of the environment While it is robust to errors in the map, they necessarily make the results less accurate This article presents a method for updating the map dynamically during the process of localization, without requiring a severe increase in running time Ordinarily, if the environment changes, the map must be recreated with user input With the approach described here, it is possible for the robot to dynamically update the map without requiring user intervention or a significant amount of processing.