Efficient and Resilient Multi-Robot Exploration in Complex and Unknown Indoor Environments

Multi-robot exploration in complex indoor spaces presents numerous challenges, including high-density layouts, varied environmental conditions, and the need for efficient coordination among agents. This work assesses the performance of twelve exploration strategies, considering factors like initial robot distribution, environmental segmentation, and robot failure conditions. While frontier-based strategies like classic Frontier Closest have demonstrated acceptable performance in many areas, they suffer from limitations, notably oscillatory behaviors and leader-follower conditions specifically in high-density structures. This is the result of its nature, which picks frontiers greedily. To address the issue, another goal selection strategy Unknown Closest is provided. This not only prevents the problem of leader-follower conditions but also minimizes the potential for oscillation. While it is known that frontier-based approaches are not well suited to dense environments, we evaluated the performance of each exploration strategy when they are specifically supported with a task allocation strategy. Distributing robots initially in the environment is also investigated to understand the performance effects of each tested distribution technique. To evaluate the strategies' robustness factor, destructive mine conditions are simulated and they are randomly placed in the different complexity of building floor plans.

Authors

Institutions

Publication Details

Published
2024-12-11
DOI
https://doi.org/10.1109/irc63610.2024.00045
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient and Resilient Multi-Robot Exploration in Complex and Unknown Indoor Environments

Christopher Allred, Huzeyfe Kocabas, Mario Harper
Robotic Path Planning Algorithms
article

Efficient and Resilient Multi-Robot Exploration in Complex and Unknown Indoor Environments

Christopher Allred, Huzeyfe Kocabas, Mario Harper
article en

Abstract

Multi-robot exploration in complex indoor spaces presents numerous challenges, including high-density layouts, varied environmental conditions, and the need for efficient coordination among agents. This work assesses the performance of twelve exploration strategies, considering factors like initial robot distribution, environmental segmentation, and robot failure conditions. While frontier-based strategies like classic Frontier Closest have demonstrated acceptable performance in many areas, they suffer from limitations, notably oscillatory behaviors and leader-follower conditions specifically in high-density structures. This is the result of its nature, which picks frontiers greedily. To address the issue, another goal selection strategy Unknown Closest is provided. This not only prevents the problem of leader-follower conditions but also minimizes the potential for oscillation. While it is known that frontier-based approaches are not well suited to dense environments, we evaluated the performance of each exploration strategy when they are specifically supported with a task allocation strategy. Distributing robots initially in the environment is also investigated to understand the performance effects of each tested distribution technique. To evaluate the strategies' robustness factor, destructive mine conditions are simulated and they are randomly placed in the different complexity of building floor plans.

Utah State University (US)
Openalex Percentile: Top 75%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.