Deploying While Exploring: A Greedy-based Communication Beacons Deployment in Multi-Vehicle Exploration

In multi-vehicle collaborative exploration of unknown environments, it is still a great challenge to maintain the communication between multiple vehicles. In this paper, we present a greedy-based communication beacon deployment method to address this challenge. The proposed method involves each vehicle performing LiDAR-inertial odometry, hierarchical grid-based exploration, and greedy-based beacon deployment. Each time a vehicle reaching the communication boundary, beacon candidate positions are selected. A candidate location that can cover the most uncommunicated area is selected as beacon placement points. Through simulation experiments, the effectiveness of the proposed method is demonstrated, showing that it can dynamically deploy beacons to maintain communication within the explored area while minimizing the number of beacons used.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1109/icairc64177.2024.10899957
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Deploying While Exploring: A Greedy-based Communication Beacons Deployment in Multi-Vehicle Exploration

Rui Huang, Chaoyang Jiang, Yifei Jia, Zhe Jin et al.
Energy Efficient Wireless Sensor Networks
article

Deploying While Exploring: A Greedy-based Communication Beacons Deployment in Multi-Vehicle Exploration

Rui Huang, Chaoyang Jiang, Yifei Jia, Zhe Jin, Chengyang Zhang
article en

Abstract

In multi-vehicle collaborative exploration of unknown environments, it is still a great challenge to maintain the communication between multiple vehicles. In this paper, we present a greedy-based communication beacon deployment method to address this challenge. The proposed method involves each vehicle performing LiDAR-inertial odometry, hierarchical grid-based exploration, and greedy-based beacon deployment. Each time a vehicle reaching the communication boundary, beacon candidate positions are selected. A candidate location that can cover the most uncommunicated area is selected as beacon placement points. Through simulation experiments, the effectiveness of the proposed method is demonstrated, showing that it can dynamically deploy beacons to maintain communication within the explored area while minimizing the number of beacons used.

Beijing Institute of Technology (CN), Beijing Academy of Artificial Intelligence (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 67%
Energy Efficient Wireless Sensor Networks
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.