基于无人机协同的侦察任务公平能量轨迹规划

Zhenjie Qin, Aijing Li, Chao Dong, Haipeng Dai, Ai Xu
{"title":"基于无人机协同的侦察任务公平能量轨迹规划","authors":"Zhenjie Qin, Aijing Li, Chao Dong, Haipeng Dai, Ai Xu","doi":"10.1109/WCSP.2018.8555684","DOIUrl":null,"url":null,"abstract":"Due to availability of off-the-shelf devices and low cost, unmanned aerial vehicles (UAVs) are widely used in reconnaissance missions. In this paper, we study the fair-energy trajectory plan of multi-UAV in reconnaissance scenario with motion, hovering and communication energy consumption in consideration. Most of current works only consider the motion energy, however, the hovering and communication energy can not be ignored. We model the fair-energy problem as the minmax tour cover problem, and verify that the problem is strongly NP-hard. We propose a heuristic algorithm which includes tour calculation and tour splitting. The effectiveness of the proposed algorithm is verified by extensive numerical results, showing that the maximum energy consumption is reduced by 27% at most compared with other algorithms.","PeriodicalId":423073,"journal":{"name":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Fair-Energy Trajectory Plan for Reconnaissance Mission Based on UAVs Cooperation\",\"authors\":\"Zhenjie Qin, Aijing Li, Chao Dong, Haipeng Dai, Ai Xu\",\"doi\":\"10.1109/WCSP.2018.8555684\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Due to availability of off-the-shelf devices and low cost, unmanned aerial vehicles (UAVs) are widely used in reconnaissance missions. In this paper, we study the fair-energy trajectory plan of multi-UAV in reconnaissance scenario with motion, hovering and communication energy consumption in consideration. Most of current works only consider the motion energy, however, the hovering and communication energy can not be ignored. We model the fair-energy problem as the minmax tour cover problem, and verify that the problem is strongly NP-hard. We propose a heuristic algorithm which includes tour calculation and tour splitting. The effectiveness of the proposed algorithm is verified by extensive numerical results, showing that the maximum energy consumption is reduced by 27% at most compared with other algorithms.\",\"PeriodicalId\":423073,\"journal\":{\"name\":\"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"32 4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2018.8555684\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 10th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2018.8555684","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

由于具有现成设备的可用性和低成本,无人机在侦察任务中得到了广泛的应用。本文研究了多无人机在侦察场景下兼顾运动、悬停和通信能耗的公平能量轨迹规划问题。目前的工作大多只考虑运动能量,而悬停能量和通信能量也不容忽视。我们将公平能量问题建模为最小最大旅行覆盖问题,并验证了该问题是强np困难的。提出了一种启发式算法,该算法包括行程计算和行程分割。大量的数值结果验证了该算法的有效性,与其他算法相比,最大能耗最多降低27%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fair-Energy Trajectory Plan for Reconnaissance Mission Based on UAVs Cooperation
Due to availability of off-the-shelf devices and low cost, unmanned aerial vehicles (UAVs) are widely used in reconnaissance missions. In this paper, we study the fair-energy trajectory plan of multi-UAV in reconnaissance scenario with motion, hovering and communication energy consumption in consideration. Most of current works only consider the motion energy, however, the hovering and communication energy can not be ignored. We model the fair-energy problem as the minmax tour cover problem, and verify that the problem is strongly NP-hard. We propose a heuristic algorithm which includes tour calculation and tour splitting. The effectiveness of the proposed algorithm is verified by extensive numerical results, showing that the maximum energy consumption is reduced by 27% at most compared with other algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信