{"title":"A Hybrid Discrete Grey Wolf Optimizer with Local Search for Multi-UAV Patrolling","authors":"Ebtesam Aloboud , Heba Kurdi","doi":"10.1016/j.procs.2024.08.031","DOIUrl":null,"url":null,"abstract":"<div><p>This paper addresses the multi- UAV patrolling problem, a NP-hard optimization problem that is focused on minimizing idleness, which is defined as the time between consecutive visits to specific locations. We propose the Discrete Grey Wolf Optimizer (D-GWO), which is specifically developed to handle the discrete aspects of UAV patrolling routes. This new algorithm is enhanced with a 2-opt local search strategy, which integrates the global search capabilities of D-GWO with the precision of local optimization to effectively refine solutions. Comparative experimental results show that our algorithm outperforms established methods such as ant colony optimization and simulated annealing in terms of reducing global worst idleness and overall exploration time. Our findings suggest that the D-GWO algorithm is particularly effective for complex multi-UAV patrolling tasks, significantly enhancing efficiency in security and disaster response missions.</p></div>","PeriodicalId":20465,"journal":{"name":"Procedia Computer Science","volume":"241 ","pages":"Pages 228-233"},"PeriodicalIF":0.0000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877050924017423/pdf?md5=f67cf7e48ebe4d0f6e97fbf7bdab3ced&pid=1-s2.0-S1877050924017423-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Procedia Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1877050924017423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper addresses the multi- UAV patrolling problem, a NP-hard optimization problem that is focused on minimizing idleness, which is defined as the time between consecutive visits to specific locations. We propose the Discrete Grey Wolf Optimizer (D-GWO), which is specifically developed to handle the discrete aspects of UAV patrolling routes. This new algorithm is enhanced with a 2-opt local search strategy, which integrates the global search capabilities of D-GWO with the precision of local optimization to effectively refine solutions. Comparative experimental results show that our algorithm outperforms established methods such as ant colony optimization and simulated annealing in terms of reducing global worst idleness and overall exploration time. Our findings suggest that the D-GWO algorithm is particularly effective for complex multi-UAV patrolling tasks, significantly enhancing efficiency in security and disaster response missions.