Beyond frontier exploration

Open Access
Authors
  • A. Visser ORCID logo
  • X. Ji
  • M. van Ittersum
  • L.A. González Jaime
  • L.A. Stancu
Publication date 2008
Host editors
  • U. Visser
  • F. Ribeiro
  • T. Ohashi
  • F. Dellaert
Book title RoboCup 2007: Robot Soccer World Cup XI
ISBN
  • 9783540688464
ISBN (electronic)
  • 9783540688471
Series Lecture Notes in Computer Science
Event 11th RoboCup International Symposium (RoboCup 2007), Atlanta, GA
Pages (from-to) 113-123
Publisher Berlin: Springer
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
This article investigates the prerequisites for a global exploration strategy in an unknown environment on a virtual disaster site. Assume that a robot equipped with a laser range scanner can build a detailed map of a previous unknown environment. The remaining question is how to use this information on this map for further exploration.
On a map several interesting locations can be present where the exploration can be continued, referred as exploration frontiers. Typically, a greedy algorithm is used for the decision which frontier to explore next. Such a greedy algorithm only considers interesting locations locally, focused to reduce the movement costs. More sophisticated algorithms also take into account the information that can be gained along each frontier. This shifts the problem to estimate the amount of unexplored area behind the frontiers on the global map. Our algorithm exploits the long range of current laser scanners. Typically, during the previous exploration a small number of laser rays already passed the frontier, but this number is too low to have major impact on the generated map. Yet, the few rays through a frontier can be used to estimate the potential information gain from unexplored area beyond the frontier.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-540-68847-1_10
Downloads
BeyondFrontiers.pdf (Accepted author manuscript)
Permalink to this page
Back