Multiple fixed-wing UAVs collaborative coverage 3D path planning method for complex areas

被引:1
作者
Wang, Mengyang [1 ]
Zhang, Dong [1 ]
Li, Chaoyue [1 ]
Zhang, Zhaohua [1 ]
机构
[1] Northwestern Polytech Univ, Sch Astronaut, Xian 710072, Peoples R China
来源
DEFENCE TECHNOLOGY | 2025年 / 47卷
基金
中国国家自然科学基金;
关键词
Multi-fixed-wing UAVs (multi-UAV); Minimum time cooperative coverage; Dynamic complete coverage path planning; (DCCPP); Dubins curves; Improved dynamic programming algorithm; (IDP); RESOLUTION; SEARCH; MODEL;
D O I
10.1016/j.dt.2025.01.008
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Complex multi-area collaborative coverage path planning in dynamic environments poses a significant challenge for multi-fixed-wing UAVs (multi-UAV). This study establishes a comprehensive framework that incorporates UAV capabilities, terrain, complex areas, and mission dynamics. A novel dynamic collaborative path planning algorithm is introduced, designed to ensure complete coverage of designated areas. This algorithm meticulously optimizes the operation, entry, and transition paths for each UAV, while also establishing evaluation metrics to refine coverage sequences for each area. Additionally, a three-dimensional path is computed utilizing an altitude descent method, effectively integrating twodimensional coverage paths with altitude constraints. The efficacy of the proposed approach is validated through digital simulations and mixed-reality semi-physical experiments across a variety of dynamic scenarios, including both single-area and multi-area coverage by multi-UAV. Results show that the coverage paths generated by this method significantly reduce both computation time and path length, providing a reliable solution for dynamic multi-UAV mission planning in semi-physical environments. (c) 2025 China Ordnance Society. Publishing services by Elsevier B.V. on behalf of KeAi Communications Co. Ltd. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/ licenses/by-nc-nd/4.0/).
引用
收藏
页码:197 / 215
页数:19
相关论文
共 49 条
[1]   LSAR: Multi-UAV Collaboration for Search and Rescue Missions [J].
Alotaibi, Ebtehal Turki ;
Alqefari, Shahad Saleh ;
Koubaa, Anis .
IEEE ACCESS, 2019, 7 :55817-55832
[2]   Three-Dimensional Curvature-Constrained Trajectory Planning Based on In-Flight Waypoints [J].
Babaei, A. R. ;
Mortazavi, M. .
JOURNAL OF AIRCRAFT, 2010, 47 (04) :1391-1398
[3]  
Bahnemann R., 2021, Field and Service Robotics, P277
[4]   Dynamic programming approaches for the traveling salesman problem with drone [J].
Bouman, Paul ;
Agatz, Niels ;
Schmidt, Marie .
NETWORKS, 2018, 72 (04) :528-542
[5]   Survey on Coverage Path Planning with Unmanned Aerial Vehicles [J].
Cabreira, Taua M. ;
Brisolara, Lisane B. ;
Paulo R., Ferreira Jr. .
DRONES, 2019, 3 (01) :1-38
[6]   Concentrated Coverage Path Planning Algorithm of UAV Formation tor Aerial Photography [J].
Cao, Yi ;
Cheng, Xianghong ;
Mu, Jinzhen .
IEEE SENSORS JOURNAL, 2022, 22 (11) :11098-11111
[7]  
Chavez K, 2023, Arms Control Today, V53, P6
[8]  
[陈海 Chen Hai], 2016, [航空学报, Acta Aeronautica et Astronautica Sinica], V37, P928
[9]   Coverage path planning for multiple unmanned aerial vehicles in maritime search and rescue operations [J].
Cho, Sung Won ;
Park, Hyun Ji ;
Lee, Hanseob ;
Shim, David Hyunchul ;
Kim, Sun-Young .
COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 161
[10]   Optimal Polygon Decomposition for UAV Survey Coverage Path Planning in Wind [J].
Coombes, Matthew ;
Fletcher, Tom ;
Chen, Wen-Hua ;
Liu, Cunjia .
SENSORS, 2018, 18 (07)