Energy-Efficient Multi-UAV Multi-Region Coverage Path Planning Approach

IF 2.9 4区 综合性期刊 Q1 Multidisciplinary
Gamil Ahmed, Tarek Sheltami, Ashraf Mahmoud
{"title":"Energy-Efficient Multi-UAV Multi-Region Coverage Path Planning Approach","authors":"Gamil Ahmed, Tarek Sheltami, Ashraf Mahmoud","doi":"10.1007/s13369-024-09295-w","DOIUrl":null,"url":null,"abstract":"<p>Due to the high deployment flexibility and strong maneuverability, unmanned aerial vehicles (UAVs) have gained a significant attention in civilian and military applications. One of the main essential aspects of UAV is coverage path planning (CPP), which autonomously obtains sufficient paths to cover the entire region of interest (RoI). Several advantages have been offered by UAVs’ CPP such as cost and time efficiency, reduced human intervention, resource optimization, data collection, scalability, and adaptability. However, the flight time of UAVs is constrained by battery capacity, necessitating energy-efficient solutions to prolong flight duration. This paper introduces a novel approach for energy-efficient multi-UAV multi-region CPP to generate appropriate paths that cover multiple disjoint regions, aiming to minimize overall energy consumption. First, we employ a back-and-forth strategy to generate intra-region path patterns with minimum turns and propose a smoothing turns approach (STA) based on Bezier curves to effectively reduce an energy consumption due to taking turns. Then, the inter-region path planning is formulated as a multi-constraint optimization problem and solved utilizing the CPLEX solver for small-scale problems and heuristic approaches for large-scale ones. A region allocation approach is proposed to assign RoIs to appropriate UAVs. Simulations are conducted to evaluate the performance of the proposed approach in terms of energy consumption. Comparative results against EECPPA and Nearest Neighbor (NN) approaches demonstrate advantages in energy consumption reduction. Besides, heuristic methods yield superior solutions for large-scale problems within shorter execution times compared to the CPLEX solver. These comparisons highlight the superiority of the proposed approach over existing methods in generating higher-quality solutions.</p>","PeriodicalId":8109,"journal":{"name":"Arabian Journal for Science and Engineering","volume":"28 1","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2024-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Arabian Journal for Science and Engineering","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1007/s13369-024-09295-w","RegionNum":4,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Multidisciplinary","Score":null,"Total":0}
引用次数: 0

Abstract

Due to the high deployment flexibility and strong maneuverability, unmanned aerial vehicles (UAVs) have gained a significant attention in civilian and military applications. One of the main essential aspects of UAV is coverage path planning (CPP), which autonomously obtains sufficient paths to cover the entire region of interest (RoI). Several advantages have been offered by UAVs’ CPP such as cost and time efficiency, reduced human intervention, resource optimization, data collection, scalability, and adaptability. However, the flight time of UAVs is constrained by battery capacity, necessitating energy-efficient solutions to prolong flight duration. This paper introduces a novel approach for energy-efficient multi-UAV multi-region CPP to generate appropriate paths that cover multiple disjoint regions, aiming to minimize overall energy consumption. First, we employ a back-and-forth strategy to generate intra-region path patterns with minimum turns and propose a smoothing turns approach (STA) based on Bezier curves to effectively reduce an energy consumption due to taking turns. Then, the inter-region path planning is formulated as a multi-constraint optimization problem and solved utilizing the CPLEX solver for small-scale problems and heuristic approaches for large-scale ones. A region allocation approach is proposed to assign RoIs to appropriate UAVs. Simulations are conducted to evaluate the performance of the proposed approach in terms of energy consumption. Comparative results against EECPPA and Nearest Neighbor (NN) approaches demonstrate advantages in energy consumption reduction. Besides, heuristic methods yield superior solutions for large-scale problems within shorter execution times compared to the CPLEX solver. These comparisons highlight the superiority of the proposed approach over existing methods in generating higher-quality solutions.

Abstract Image

高能效多无人机多区域覆盖路径规划方法
由于部署灵活、机动性强,无人驾驶飞行器(UAV)在民用和军事领域的应用备受关注。覆盖路径规划(CPP)是无人飞行器的主要基本要素之一,它能自主获取足够的路径以覆盖整个感兴趣区域(RoI)。无人机的覆盖路径规划具有成本和时间效率高、减少人工干预、资源优化、数据收集、可扩展性和适应性强等优点。然而,无人机的飞行时间受到电池容量的限制,因此需要采用节能解决方案来延长飞行时间。本文介绍了一种新颖的高能效多无人机多区域 CPP 方法,可生成覆盖多个不相连区域的适当路径,从而最大限度地降低总体能耗。首先,我们采用往返策略生成具有最小转弯的区域内路径模式,并提出了一种基于贝塞尔曲线的平滑转弯方法(STA),以有效减少转弯造成的能耗。然后,将区域间路径规划表述为多约束优化问题,并利用 CPLEX 求解器解决小规模问题,利用启发式方法解决大规模问题。提出了一种区域分配方法,将 RoIs 分配给适当的无人机。通过仿真评估了所提方法在能耗方面的性能。与 EECPPA 和近邻(NN)方法的比较结果表明,该方法在降低能耗方面具有优势。此外,与 CPLEX 求解器相比,启发式方法能在更短的执行时间内为大型问题提供更优的解决方案。这些比较凸显了所提出的方法在生成更高质量解决方案方面优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Arabian Journal for Science and Engineering
Arabian Journal for Science and Engineering 综合性期刊-综合性期刊
CiteScore
5.20
自引率
3.40%
发文量
0
审稿时长
4.3 months
期刊介绍: King Fahd University of Petroleum & Minerals (KFUPM) partnered with Springer to publish the Arabian Journal for Science and Engineering (AJSE). AJSE, which has been published by KFUPM since 1975, is a recognized national, regional and international journal that provides a great opportunity for the dissemination of research advances from the Kingdom of Saudi Arabia, MENA and the world.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信