Multi-Robot Rendezvous in Unknown Environment With Limited Communication

Rendezvous aims at gathering all robots at a specific location, which is an important collaborative behavior for multi-robot systems. However, in an unknown environment, it is challenging to achieve rendezvous. Previous researches mainly focus on special scenarios where communication is not allowed and each robot executes a random searching strategy, which is highly time-consuming, especially in large-scale environments. In this letter, we focus on rendezvous in unknown environments where communication is available. We divide this task into two steps: rendezvous based environment exploration with relative pose (RP) estimation and rendezvous point selection. A new strategy called partitioned and incomplete exploration for rendezvous (PIER) is proposed to efficiently explore the unknown environment, where lightweight topological maps are constructed and shared among robots for RP estimation with very few communications. Then, a rendezvous point selection algorithm based on the merged topological map is proposed for efficient rendezvous for multi-robot systems. The effectiveness of the proposed methods is validated in both simulations and real-world experiments.

Authors

Institutions

Publication Details

Journal
IEEE Robotics and Automation Letters
Published
2024-09-13
DOI
https://doi.org/10.1109/lra.2024.3460420
Citations
1
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

Multi-Robot Rendezvous in Unknown Environment With Limited Communication

Zhenhua Xiong, Gaoming Chen, Wenhang Liu, Kun Song
1 citations
IEEE Robotics and Automation Letters
Optimization and Search Problems
0.35
article

Multi-Robot Rendezvous in Unknown Environment With Limited Communication

Zhenhua Xiong, Gaoming Chen, Wenhang Liu, Kun Song
article en
1 citations

Abstract

Rendezvous aims at gathering all robots at a specific location, which is an important collaborative behavior for multi-robot systems. However, in an unknown environment, it is challenging to achieve rendezvous. Previous researches mainly focus on special scenarios where communication is not allowed and each robot executes a random searching strategy, which is highly time-consuming, especially in large-scale environments. In this letter, we focus on rendezvous in unknown environments where communication is available. We divide this task into two steps: rendezvous based environment exploration with relative pose (RP) estimation and rendezvous point selection. A new strategy called partitioned and incomplete exploration for rendezvous (PIER) is proposed to efficiently explore the unknown environment, where lightweight topological maps are constructed and shared among robots for RP estimation with very few communications. Then, a rendezvous point selection algorithm based on the merged topological map is proposed for efficient rendezvous for multi-robot systems. The effectiveness of the proposed methods is validated in both simulations and real-world experiments.

IEEE Robotics and Automation LettersVol. 9(11)
Shanghai Jiao Tong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 39%
Optimization and Search Problems
0.35
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.

Multi-Robot Rendezvous in Unknown Environment With Limited Communication — Zhenhua Xiong, Gaoming Chen, et al. · IEEE Robotics and Automation Letters (2024) | TGRS Research Map | TGRS