{"title":"Dynamic coverage path planning method for UAV formations in multi-region aerial tasks","authors":"Quancheng Pu , Lu Yang, Tieshan Li","doi":"10.1016/j.ast.2025.110683","DOIUrl":null,"url":null,"abstract":"<div><div>Planning coverage paths for multiple discrete regions is a prerequisite for Unmanned Aerial Vehicle (UAV) formations to perform continuous coverage tasks. However, precisely solving for the globally optimal path is computationally challenging, and maintaining formation shape under the interference of static and dynamic obstacles is difficult. Traditional path planning methods often perform poorly in large-scale, multi-region coverage tasks due to getting trapped in local optima or low computational efficiency, making it challenging to maintain formation shape while achieving swarm obstacle avoidance. This study proposes a novel dynamic multi-region coverage path planning method to enhance the task efficiency and safety of UAV formations in complex environments. First, a heuristic optimization algorithm, PGS2, was developed, incorporating three optimized mechanisms to significantly enhance global search capabilities. In nine scenarios with varying numbers of access points and discrete regions, PGS2 reduced average path costs by 56.7% and 1.35% compared to six baseline algorithms, demonstrating superior optimization performance and stability. Second, the Orthogonal Artificial Potential Field (Orthogonal APF) path planning algorithm and a gradient-mapping-based swarm self-avoidance method were proposed, achieving dynamic path planning while maintaining formation shape through virtual target point design. Orthogonal APF achieved a 100% target arrival rate in nine multi-obstacle scenarios, with path deviation reduced by an average of 31.93% compared to four other algorithms, validating its effectiveness and unique path recovery capability. In a simulation environment with three regions and multiple obstacles, the UAV formation could avoid static obstacles in approximately 5 seconds and dynamic obstacles in about 2 seconds, while the virtual target point mechanism ensured formation recovery within approximately 3 seconds post-avoidance and supported formation reconfiguration for varying UAV counts. This study provides an innovative path planning method for efficient and safe UAV formation operations in multi-region, complex environments, with comparisons to traditional methods demonstrating its significant advantages in path optimization, obstacle avoidance, and task continuity.</div></div>","PeriodicalId":50955,"journal":{"name":"Aerospace Science and Technology","volume":"167 ","pages":"Article 110683"},"PeriodicalIF":5.8000,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Aerospace Science and Technology","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1270963825007540","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, AEROSPACE","Score":null,"Total":0}
引用次数: 0
Abstract
Planning coverage paths for multiple discrete regions is a prerequisite for Unmanned Aerial Vehicle (UAV) formations to perform continuous coverage tasks. However, precisely solving for the globally optimal path is computationally challenging, and maintaining formation shape under the interference of static and dynamic obstacles is difficult. Traditional path planning methods often perform poorly in large-scale, multi-region coverage tasks due to getting trapped in local optima or low computational efficiency, making it challenging to maintain formation shape while achieving swarm obstacle avoidance. This study proposes a novel dynamic multi-region coverage path planning method to enhance the task efficiency and safety of UAV formations in complex environments. First, a heuristic optimization algorithm, PGS2, was developed, incorporating three optimized mechanisms to significantly enhance global search capabilities. In nine scenarios with varying numbers of access points and discrete regions, PGS2 reduced average path costs by 56.7% and 1.35% compared to six baseline algorithms, demonstrating superior optimization performance and stability. Second, the Orthogonal Artificial Potential Field (Orthogonal APF) path planning algorithm and a gradient-mapping-based swarm self-avoidance method were proposed, achieving dynamic path planning while maintaining formation shape through virtual target point design. Orthogonal APF achieved a 100% target arrival rate in nine multi-obstacle scenarios, with path deviation reduced by an average of 31.93% compared to four other algorithms, validating its effectiveness and unique path recovery capability. In a simulation environment with three regions and multiple obstacles, the UAV formation could avoid static obstacles in approximately 5 seconds and dynamic obstacles in about 2 seconds, while the virtual target point mechanism ensured formation recovery within approximately 3 seconds post-avoidance and supported formation reconfiguration for varying UAV counts. This study provides an innovative path planning method for efficient and safe UAV formation operations in multi-region, complex environments, with comparisons to traditional methods demonstrating its significant advantages in path optimization, obstacle avoidance, and task continuity.
期刊介绍:
Aerospace Science and Technology publishes articles of outstanding scientific quality. Each article is reviewed by two referees. The journal welcomes papers from a wide range of countries. This journal publishes original papers, review articles and short communications related to all fields of aerospace research, fundamental and applied, potential applications of which are clearly related to:
• The design and the manufacture of aircraft, helicopters, missiles, launchers and satellites
• The control of their environment
• The study of various systems they are involved in, as supports or as targets.
Authors are invited to submit papers on new advances in the following topics to aerospace applications:
• Fluid dynamics
• Energetics and propulsion
• Materials and structures
• Flight mechanics
• Navigation, guidance and control
• Acoustics
• Optics
• Electromagnetism and radar
• Signal and image processing
• Information processing
• Data fusion
• Decision aid
• Human behaviour
• Robotics and intelligent systems
• Complex system engineering.
Etc.