{"title":"增强无人机覆盖路径规划的强化学习集成进化算法","authors":"Seung Chan Choi , Yohan Lee , Sung Won Cho","doi":"10.1016/j.swevo.2025.102051","DOIUrl":null,"url":null,"abstract":"<div><div>The rapid development of unmanned aerial vehicle (UAV) technologies has led to their increased utilization across various industries. In search and rescue (SAR) missions, UAVs play a critical role in overcoming mobility constraints in search environments, particularly in time-sensitive situations such as maritime operations. To enhance the efficiency of search missions, this study addresses the Coverage Path Planning (CPP) problem for multiple UAVs in irregularly shaped search areas. We propose a novel CPP framework consisting of two main phases. In Phase 1, a reinforcement learning-integrated evolutionary algorithm is introduced for search area decomposition, aiming to minimize the area of the grid map exceeding the search area. Specifically, proximal policy optimization-based particle swarm optimization (PPO–PSO) is employed to effectively adapt to complex and irregular shapes. In Phase 2, a Mixed Integer Linear Programming (MILP) model is formulated to minimize mission completion time while ensuring collision avoidance and efficient task allocation for multiple UAVs. The proposed methodology was validated through 15 experimental scenarios, including real-world maritime environments, and demonstrated superior performance compared to existing methods in managing irregularly shaped search areas.</div></div>","PeriodicalId":48682,"journal":{"name":"Swarm and Evolutionary Computation","volume":"97 ","pages":"Article 102051"},"PeriodicalIF":8.2000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reinforcement learning-integrated evolutionary algorithm for enhanced unmanned aerial vehicle coverage path planning\",\"authors\":\"Seung Chan Choi , Yohan Lee , Sung Won Cho\",\"doi\":\"10.1016/j.swevo.2025.102051\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The rapid development of unmanned aerial vehicle (UAV) technologies has led to their increased utilization across various industries. In search and rescue (SAR) missions, UAVs play a critical role in overcoming mobility constraints in search environments, particularly in time-sensitive situations such as maritime operations. To enhance the efficiency of search missions, this study addresses the Coverage Path Planning (CPP) problem for multiple UAVs in irregularly shaped search areas. We propose a novel CPP framework consisting of two main phases. In Phase 1, a reinforcement learning-integrated evolutionary algorithm is introduced for search area decomposition, aiming to minimize the area of the grid map exceeding the search area. Specifically, proximal policy optimization-based particle swarm optimization (PPO–PSO) is employed to effectively adapt to complex and irregular shapes. In Phase 2, a Mixed Integer Linear Programming (MILP) model is formulated to minimize mission completion time while ensuring collision avoidance and efficient task allocation for multiple UAVs. The proposed methodology was validated through 15 experimental scenarios, including real-world maritime environments, and demonstrated superior performance compared to existing methods in managing irregularly shaped search areas.</div></div>\",\"PeriodicalId\":48682,\"journal\":{\"name\":\"Swarm and Evolutionary Computation\",\"volume\":\"97 \",\"pages\":\"Article 102051\"},\"PeriodicalIF\":8.2000,\"publicationDate\":\"2025-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Swarm and Evolutionary Computation\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210650225002093\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Swarm and Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210650225002093","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
The rapid development of unmanned aerial vehicle (UAV) technologies has led to their increased utilization across various industries. In search and rescue (SAR) missions, UAVs play a critical role in overcoming mobility constraints in search environments, particularly in time-sensitive situations such as maritime operations. To enhance the efficiency of search missions, this study addresses the Coverage Path Planning (CPP) problem for multiple UAVs in irregularly shaped search areas. We propose a novel CPP framework consisting of two main phases. In Phase 1, a reinforcement learning-integrated evolutionary algorithm is introduced for search area decomposition, aiming to minimize the area of the grid map exceeding the search area. Specifically, proximal policy optimization-based particle swarm optimization (PPO–PSO) is employed to effectively adapt to complex and irregular shapes. In Phase 2, a Mixed Integer Linear Programming (MILP) model is formulated to minimize mission completion time while ensuring collision avoidance and efficient task allocation for multiple UAVs. The proposed methodology was validated through 15 experimental scenarios, including real-world maritime environments, and demonstrated superior performance compared to existing methods in managing irregularly shaped search areas.
期刊介绍:
Swarm and Evolutionary Computation is a pioneering peer-reviewed journal focused on the latest research and advancements in nature-inspired intelligent computation using swarm and evolutionary algorithms. It covers theoretical, experimental, and practical aspects of these paradigms and their hybrids, promoting interdisciplinary research. The journal prioritizes the publication of high-quality, original articles that push the boundaries of evolutionary computation and swarm intelligence. Additionally, it welcomes survey papers on current topics and novel applications. Topics of interest include but are not limited to: Genetic Algorithms, and Genetic Programming, Evolution Strategies, and Evolutionary Programming, Differential Evolution, Artificial Immune Systems, Particle Swarms, Ant Colony, Bacterial Foraging, Artificial Bees, Fireflies Algorithm, Harmony Search, Artificial Life, Digital Organisms, Estimation of Distribution Algorithms, Stochastic Diffusion Search, Quantum Computing, Nano Computing, Membrane Computing, Human-centric Computing, Hybridization of Algorithms, Memetic Computing, Autonomic Computing, Self-organizing systems, Combinatorial, Discrete, Binary, Constrained, Multi-objective, Multi-modal, Dynamic, and Large-scale Optimization.