TY - CONF
T1 - Spiralling Human-Inspired Exploration Algorithm with Doorway Detection.
AU - Schmidt, Rasmus Borrisholt
AU - Sørensen, Andreas Sebastian
AU - Beregaard, Thor
AU - Albano, Michele
N1 - DBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.
PY - 2025
Y1 - 2025
N2 - Exploration of unknown environments is an important task for autonomous robot swarm systems. The faster they can fully explore an area, the faster a coordinated plan can be made, or points of interest found, to support further tasks. Previous algorithms have often focused either on frontier based, or nature-inspired heuristics. We present a human-inspired exploration algorithm, Minotaur, that enables simple and efficient exploration of buildings. We studied how Minotaur and a state-of-the-art algorithm, namely The Next Frontier (TNF), perform. Minotaur follows walls to discover doorways, after which it coordinates with robots in the same room to extend the exploration to rooms accessible through the discovered doorways. Most algorithms assume either perfect communication, or line-of-sight (LOS) communication, which hinders the realism of the simulation results. We then modified an existing simulator to take into account realistic communication technologies that have limited penetration of materials through walls. Comparative experiments between Minotaur, TNF, and a simple greedy algorithm show the superiority of Minotaur when multiple robots are exploring buildings-like maps. However, when considering cave-like maps, Minotaur appears to have bad performance, but the greedy algorithm outperforms TNF, particularly when the algorithms are limited in their communication capabilities.
AB - Exploration of unknown environments is an important task for autonomous robot swarm systems. The faster they can fully explore an area, the faster a coordinated plan can be made, or points of interest found, to support further tasks. Previous algorithms have often focused either on frontier based, or nature-inspired heuristics. We present a human-inspired exploration algorithm, Minotaur, that enables simple and efficient exploration of buildings. We studied how Minotaur and a state-of-the-art algorithm, namely The Next Frontier (TNF), perform. Minotaur follows walls to discover doorways, after which it coordinates with robots in the same room to extend the exploration to rooms accessible through the discovered doorways. Most algorithms assume either perfect communication, or line-of-sight (LOS) communication, which hinders the realism of the simulation results. We then modified an existing simulator to take into account realistic communication technologies that have limited penetration of materials through walls. Comparative experiments between Minotaur, TNF, and a simple greedy algorithm show the superiority of Minotaur when multiple robots are exploring buildings-like maps. However, when considering cave-like maps, Minotaur appears to have bad performance, but the greedy algorithm outperforms TNF, particularly when the algorithms are limited in their communication capabilities.
KW - Minotaur
KW - Online Exploration
KW - Signal Degradation
KW - TNF
U2 - 10.5220/0013237700003890
DO - 10.5220/0013237700003890
M3 - Paper without publisher/journal
SP - 112
EP - 122
ER -