GenPath -一种飞行器多轮路径规划的遗传算法

N. Bartolini, Andrea Coletta, G. Maselli, Mauro Piva, Domenicomichele Silvestri
{"title":"GenPath -一种飞行器多轮路径规划的遗传算法","authors":"N. Bartolini, Andrea Coletta, G. Maselli, Mauro Piva, Domenicomichele Silvestri","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484505","DOIUrl":null,"url":null,"abstract":"The past few years have witnessed unprecedented proliferation of Unmanned Aerial Vehicles (UAVs).They are employed in a growing number of scenarios, from parcel delivery to search and rescue operations, requiring coordinated missions of a fleet of drones. Recently, there has been growing interest in optimized techniques to assign tasks and related trajectories to drones. While these techniques promise high coverage of inspected area, their applicability in real scenarios is precluded by unconsidered constraints. Among these, the limited amount of power of UAVs, and the consequent need of performing multiple trips to provide complete monitoring coverage, with battery replacement/charging and data offloading in between.To address this problem we develop Gen-Path, a genetic algorithm for efficient scheduling of multi-round UAV missions, under several objective functions.By means of simulations we show that Gen-Path fits various scenarios, improving existing solutions in terms of covered points, and energetic cost.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"GenPath - A Genetic Multi-Round Path Planning Algorithm for Aerial Vehicles\",\"authors\":\"N. Bartolini, Andrea Coletta, G. Maselli, Mauro Piva, Domenicomichele Silvestri\",\"doi\":\"10.1109/INFOCOMWKSHPS51825.2021.9484505\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The past few years have witnessed unprecedented proliferation of Unmanned Aerial Vehicles (UAVs).They are employed in a growing number of scenarios, from parcel delivery to search and rescue operations, requiring coordinated missions of a fleet of drones. Recently, there has been growing interest in optimized techniques to assign tasks and related trajectories to drones. While these techniques promise high coverage of inspected area, their applicability in real scenarios is precluded by unconsidered constraints. Among these, the limited amount of power of UAVs, and the consequent need of performing multiple trips to provide complete monitoring coverage, with battery replacement/charging and data offloading in between.To address this problem we develop Gen-Path, a genetic algorithm for efficient scheduling of multi-round UAV missions, under several objective functions.By means of simulations we show that Gen-Path fits various scenarios, improving existing solutions in terms of covered points, and energetic cost.\",\"PeriodicalId\":109588,\"journal\":{\"name\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484505\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484505","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在过去的几年里,无人驾驶飞行器(uav)得到了前所未有的普及。它们被用于越来越多的场景,从包裹递送到搜索和救援行动,需要无人机舰队的协调任务。最近,人们对为无人机分配任务和相关轨迹的优化技术越来越感兴趣。虽然这些技术承诺对被检查区域的高覆盖率,但它们在实际场景中的适用性受到未考虑的限制。其中,无人机的功率有限,因此需要执行多次行程以提供完整的监控覆盖,其间需要更换电池/充电和数据卸载。为了解决这一问题,我们开发了一种基于多个目标函数的多轮无人机任务高效调度的遗传算法Gen-Path。通过模拟,我们证明了Gen-Path适合各种场景,在覆盖点和能量成本方面改进了现有的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
GenPath - A Genetic Multi-Round Path Planning Algorithm for Aerial Vehicles
The past few years have witnessed unprecedented proliferation of Unmanned Aerial Vehicles (UAVs).They are employed in a growing number of scenarios, from parcel delivery to search and rescue operations, requiring coordinated missions of a fleet of drones. Recently, there has been growing interest in optimized techniques to assign tasks and related trajectories to drones. While these techniques promise high coverage of inspected area, their applicability in real scenarios is precluded by unconsidered constraints. Among these, the limited amount of power of UAVs, and the consequent need of performing multiple trips to provide complete monitoring coverage, with battery replacement/charging and data offloading in between.To address this problem we develop Gen-Path, a genetic algorithm for efficient scheduling of multi-round UAV missions, under several objective functions.By means of simulations we show that Gen-Path fits various scenarios, improving existing solutions in terms of covered points, and energetic cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信