DCP: Distributed Collaborative Planner for Multi-robot Autonomous Exploration in Large-scale Unknown Environments

Exploring large-scale unknown environments with a multi-robot system is a challenging task. Existing methods of collaborative exploration mostly rely on centralized systems. This paper proposes a distributed collaborative planner for multi-robot autonomous exploration. We formulate the collaborative exploration as a min-max optimization problem. The planner aims to decrease the total exploration distance by minimizing the maximum distance of all robots, and to reduce the variance among all the distances to further decrease the overall exploration time. Simulation experiments in different environments and with various numbers of robots demonstrate that the proposed method not only ensures the exploration completeness but also enhances the exploration efficiency.

Authors

Institutions

Publication Details

Published
2025-05-23
DOI
https://doi.org/10.1109/icaisisas64483.2025.11051641
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DCP: Distributed Collaborative Planner for Multi-robot Autonomous Exploration in Large-scale Unknown Environments

Meiqin Liu, Chul-Ho Hong, Ping Wei
Robotic Path Planning Algorithms
article

DCP: Distributed Collaborative Planner for Multi-robot Autonomous Exploration in Large-scale Unknown Environments

Meiqin Liu, Chul-Ho Hong, Ping Wei
article en

Abstract

Exploring large-scale unknown environments with a multi-robot system is a challenging task. Existing methods of collaborative exploration mostly rely on centralized systems. This paper proposes a distributed collaborative planner for multi-robot autonomous exploration. We formulate the collaborative exploration as a min-max optimization problem. The planner aims to decrease the total exploration distance by minimizing the maximum distance of all robots, and to reduce the variance among all the distances to further decrease the overall exploration time. Simulation experiments in different environments and with various numbers of robots demonstrate that the proposed method not only ensures the exploration completeness but also enhances the exploration efficiency.

Xi'an Jiaotong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 86%
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.