Energy-Efficient Drone Coverage Path Planning using Genetic Algorithm

Rutuja Shivgan, Z. Dong
{"title":"Energy-Efficient Drone Coverage Path Planning using Genetic Algorithm","authors":"Rutuja Shivgan, Z. Dong","doi":"10.1109/HPSR48589.2020.9098989","DOIUrl":null,"url":null,"abstract":"Unmanned Aerial Vehicles (UAVs) have been increasingly used in environmental sensing and surveying applications. Coverage path planning to survey an area while following a set of waypoints is required to complete a task. Due to the battery capacity, the UAV flight time is often limited. In this paper, we formulate the UAV path planning problem as a traveling salesman problem in order to optimize UAV energy. We propose a genetic algorithm to solve the optimization problem i.e. to minimize the energy consumption for the UAV to complete a task. We also consider reducing the number of turns to allow the UAV to optimize the flight path and to minimize its energy consumption. We compare the energy consumption of the proposed genetic algorithm to the greedy algorithm with different number of waypoints. Results show that our proposed algorithm consumes 2–5 times less energy than that of the greedy algorithm by reducing the number of turns while covering all the waypoints.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR48589.2020.9098989","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

Abstract

Unmanned Aerial Vehicles (UAVs) have been increasingly used in environmental sensing and surveying applications. Coverage path planning to survey an area while following a set of waypoints is required to complete a task. Due to the battery capacity, the UAV flight time is often limited. In this paper, we formulate the UAV path planning problem as a traveling salesman problem in order to optimize UAV energy. We propose a genetic algorithm to solve the optimization problem i.e. to minimize the energy consumption for the UAV to complete a task. We also consider reducing the number of turns to allow the UAV to optimize the flight path and to minimize its energy consumption. We compare the energy consumption of the proposed genetic algorithm to the greedy algorithm with different number of waypoints. Results show that our proposed algorithm consumes 2–5 times less energy than that of the greedy algorithm by reducing the number of turns while covering all the waypoints.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于遗传算法的节能无人机覆盖路径规划
无人驾驶飞行器(uav)在环境传感和测量领域的应用越来越广泛。要完成一项任务,就必须规划覆盖路径,在遵循一组路点的同时对一个区域进行调查。由于电池容量的限制,无人机的飞行时间往往受到限制。为了优化无人机的能量,本文将无人机的路径规划问题表述为一个旅行商问题。我们提出了一种遗传算法来解决优化问题,即最小化无人机完成任务的能量消耗。我们还考虑减少转弯次数,使无人机能够优化飞行路径并使其能量消耗最小化。比较了不同路径点个数下遗传算法与贪心算法的能量消耗。结果表明,该算法在覆盖所有路径点的同时减少了转弯次数,比贪婪算法节省了2-5倍的能量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of Large-Scale Correlated Failures on Multilevel Virtualized Networks HPSR 2020 Table of Contents SERENADE: A Parallel Iterative Algorithm for Crossbar Scheduling in Input-Queued Switches Qualitative Communication Via Network Coding and New IP : Invited Paper i-CEON: Information-centric Elastic Optical Transport Network for Efficient Content Delivery
×
引用
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