A Novel Approach to Efficient Monte-Carlo Localization in RoboCup

  • Authors:
  • Patrick Heinemann;Jürgen Haase;Andreas Zell

  • Affiliations:
  • Wilhelm-Schickard-Institute, Department of Computer Architecture, University of Tübingen, Sand 1, 72076 Tübingen, Germany;Wilhelm-Schickard-Institute, Department of Computer Architecture, University of Tübingen, Sand 1, 72076 Tübingen, Germany;Wilhelm-Schickard-Institute, Department of Computer Architecture, University of Tübingen, Sand 1, 72076 Tübingen, Germany

  • Venue:
  • RoboCup 2006: Robot Soccer World Cup X
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.