Multi-objective path planning for multi-UAV connectivity and area coverage

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc Networks Pub Date : 2024-04-21 DOI:10.1016/j.adhoc.2024.103520
İslam Güven, Evşen Yanmaz
{"title":"Multi-objective path planning for multi-UAV connectivity and area coverage","authors":"İslam Güven,&nbsp;Evşen Yanmaz","doi":"10.1016/j.adhoc.2024.103520","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we assume that a team of drones equipped with sensing and networking capabilities explore an unknown area via onboard sensors for surveillance, monitoring, target search or data collection purposes and deliver the sensed data to a ground control station (GCS) over multi-hop links. We propose a multi-drone path planner that jointly optimizes area coverage time and connectivity among the drones. We propose a novel connectivity metric that includes not only percentage connectivity of the drones to GCS, but also the maximum duration of consecutive time that the drones are disconnected from the GCS. To solve this optimization formulation, we propose a multi-objective evolutionary algorithm with novel operations. We use our solver to test single, two and many objective path planning problems and compare our Pareto-optimal solutions to benchmark weighted-sum based solutions. We show that as opposed to the single solution that weighted-sum methods provide based on prior information from the user, the proposed evolutionary multi-objective optimizers can provide a diverse set of solutions that cover a range of mission time and connectivity performance illustrating the trade-off between these conflicting objectives. The end-user can then choose the best path solution based on the mission priorities during operation.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524001318","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we assume that a team of drones equipped with sensing and networking capabilities explore an unknown area via onboard sensors for surveillance, monitoring, target search or data collection purposes and deliver the sensed data to a ground control station (GCS) over multi-hop links. We propose a multi-drone path planner that jointly optimizes area coverage time and connectivity among the drones. We propose a novel connectivity metric that includes not only percentage connectivity of the drones to GCS, but also the maximum duration of consecutive time that the drones are disconnected from the GCS. To solve this optimization formulation, we propose a multi-objective evolutionary algorithm with novel operations. We use our solver to test single, two and many objective path planning problems and compare our Pareto-optimal solutions to benchmark weighted-sum based solutions. We show that as opposed to the single solution that weighted-sum methods provide based on prior information from the user, the proposed evolutionary multi-objective optimizers can provide a diverse set of solutions that cover a range of mission time and connectivity performance illustrating the trade-off between these conflicting objectives. The end-user can then choose the best path solution based on the mission priorities during operation.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多目标路径规划,实现多无人机连接和区域覆盖
在本文中,我们假设一队配备传感和网络功能的无人机通过机载传感器探索一个未知区域,以达到监视、监测、目标搜索或数据收集的目的,并通过多跳链路将传感数据传送到地面控制站(GCS)。我们提出了一种多无人机路径规划器,可共同优化区域覆盖时间和无人机之间的连通性。我们提出了一种新的连接性指标,其中不仅包括无人机与地面控制站的连接百分比,还包括无人机与地面控制站断开连接的最长连续时间。为了解决这一优化方案,我们提出了一种具有新颖操作的多目标进化算法。我们使用我们的求解器测试了单目标、双目标和多目标路径规划问题,并将我们的帕累托最优解与基于加权求和的基准解进行了比较。我们的研究表明,与加权求和方法根据用户的先验信息提供的单一解决方案不同,所提出的进化多目标优化器可以提供一系列不同的解决方案,这些解决方案涵盖了任务时间和连接性能的范围,说明了这些相互冲突的目标之间的权衡。然后,终端用户可以在运行过程中根据任务优先级选择最佳路径解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
期刊最新文献
TAVA: Traceable anonymity-self-controllable V2X Authentication over dynamic multiple charging-service providers RL-based mobile edge computing scheme for high reliability low latency services in UAV-aided IIoT networks Editorial Board PLLM-CS: Pre-trained Large Language Model (LLM) for cyber threat detection in satellite networks A two-context-aware approach for navigation: A case study for vehicular route recommendation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1