Multi-UAV adaptive cooperative coverage search method based on area dynamic sensing

Abstract Traditional manual search for large-scale unknown areas is inefficient and hazardous, making multi-UAV (unmanned aerial vehicle) collaborative search a growing trend. However, existing methods still have shortcomings in complex environments or during sudden failures. This paper proposes a multi-UAV adaptive cooperative coverage search method based on area dynamic sensing. First, the search problem is modelled as an optimization problem, and a sensing set segmentation method is introduced along with performance metrics. Secondly, perception partitioning is used to avoid redundant detection, and dynamic path guidance technology drives the UAV swarm toward unexplored areas. Finally, an auction allocation task strategy is employed to plan optimal paths for each UAV in real-time, and collision avoidance algorithms are improved to enhance safety. Experiments demonstrate that this method excels in coverage rate, interference resistance, and environmental adaptability.

Authors

Institutions

Publication Details

Journal
Journal of Computational Design and Engineering
Published
2025-03-13
DOI
https://doi.org/10.1093/jcde/qwaf031
Citations
4
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
5.10
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-UAV adaptive cooperative coverage search method based on area dynamic sensing

Yinglin Zhu, Junhua Cao, Yintao Wang, Qi Sun et al.
4 citations
Journal of Computational Design and Engineering
Robotic Path Planning Algorithms
5.10
article

Multi-UAV adaptive cooperative coverage search method based on area dynamic sensing

Yinglin Zhu, Junhua Cao, Yintao Wang, Qi Sun, Ke Li
article en
4 citations

Abstract

Abstract Traditional manual search for large-scale unknown areas is inefficient and hazardous, making multi-UAV (unmanned aerial vehicle) collaborative search a growing trend. However, existing methods still have shortcomings in complex environments or during sudden failures. This paper proposes a multi-UAV adaptive cooperative coverage search method based on area dynamic sensing. First, the search problem is modelled as an optimization problem, and a sensing set segmentation method is introduced along with performance metrics. Secondly, perception partitioning is used to avoid redundant detection, and dynamic path guidance technology drives the UAV swarm toward unexplored areas. Finally, an auction allocation task strategy is employed to plan optimal paths for each UAV in real-time, and collision avoidance algorithms are improved to enhance safety. Experiments demonstrate that this method excels in coverage rate, interference resistance, and environmental adaptability.

Journal of Computational Design and EngineeringVol. 12(4)
Xidian University (CN), Northwestern Polytechnical University (CN), Shantou University (CN)
Openalex Percentile: Top 5%
Robotic Path Planning Algorithms
5.10
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-UAV adaptive cooperative coverage search method based on area dynamic sensing — Yinglin Zhu, Junhua Cao, et al. · Journal of Computational Design and Engineering (2025) | TGRS Research Map | TGRS