Fast frontier detection for robot exploration

Matan Keidar, Eran Sadeh-Or, Gal A. Kaminka

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

Frontier-based exploration is the most common approach to exploration, a fundamental problem in robotics. In frontier-based exploration, robots explore by repeatedly computing (and moving towards) frontiers, the segments which separate the known regions from those unknown. However, most frontier detection algorithms process the entire map data. This can be a time consuming process which slows down the exploration. In this paper, we present two novel frontier detection algorithms: WFD, a graph search based algorithm and FFD, which is based on processing only the new laser readings data. In contrast to state-of-the-art methods, both algorithms do not process the entire map data. We implemented both algorithms and showed that both are faster than a state-of-the-art frontier detector implementation (by several orders of magnitude).

Original languageEnglish
Title of host publicationAdvanced Agent Technology - AAMAS 2011 Workshops, AMPLE, AOSE, ARMS, DOCM3AS, ITMAS, Revised Selected Papers
Pages281-294
Number of pages14
DOIs
StatePublished - 2012
EventInternational Conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2011 - Taipei, Taiwan, Province of China
Duration: 2 May 20116 May 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7068 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2011
Country/TerritoryTaiwan, Province of China
CityTaipei
Period2/05/116/05/11

Bibliographical note

Place of conference:Taiwan

Fingerprint

Dive into the research topics of 'Fast frontier detection for robot exploration'. Together they form a unique fingerprint.

Cite this