Optimal Time-Efficient UAV Area Coverage Path Planning Based on Raster Map

Shiqi Zheng, Xinde Li, Lianli Zhu
{"title":"Optimal Time-Efficient UAV Area Coverage Path Planning Based on Raster Map","authors":"Shiqi Zheng, Xinde Li, Lianli Zhu","doi":"10.1109/ICARM58088.2023.10218945","DOIUrl":null,"url":null,"abstract":"In the original area coverage path planning algorithm, the generated paths are often slow and inefficient due to the diversity of task areas. In this paper, we propose an optimal time-efficient unmanned aerial vehicles (UAV) area coverage method based on raster maps, which enables it to perform better in practical application scenarios. Our work improves the original approach by replacing the previous angle-cost optimization strategy with optimal timing, and also conducts practical testing and modeling of UAVs, and finally experimental tests show that our approach is more time-efficient. On top of this, we also propose two pruning strategies, the first one is to discard those paths that are already far beyond the value during the calculation by continuously updating the minimum path consumption time, and the second one is to avoid erroneous path calculation by finding unreachable uncovered free grids in time during the calculation through the dead zone marker matrix. This paper also optimizes the path cost calculation to prevent the need to recalculate the previous path cost for each cost calculation. The above measures result in a reduction of the algorithm time computation by about 48.88%.","PeriodicalId":220013,"journal":{"name":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 International Conference on Advanced Robotics and Mechatronics (ICARM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARM58088.2023.10218945","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the original area coverage path planning algorithm, the generated paths are often slow and inefficient due to the diversity of task areas. In this paper, we propose an optimal time-efficient unmanned aerial vehicles (UAV) area coverage method based on raster maps, which enables it to perform better in practical application scenarios. Our work improves the original approach by replacing the previous angle-cost optimization strategy with optimal timing, and also conducts practical testing and modeling of UAVs, and finally experimental tests show that our approach is more time-efficient. On top of this, we also propose two pruning strategies, the first one is to discard those paths that are already far beyond the value during the calculation by continuously updating the minimum path consumption time, and the second one is to avoid erroneous path calculation by finding unreachable uncovered free grids in time during the calculation through the dead zone marker matrix. This paper also optimizes the path cost calculation to prevent the need to recalculate the previous path cost for each cost calculation. The above measures result in a reduction of the algorithm time computation by about 48.88%.
基于栅格图的最优时效无人机区域覆盖路径规划
在原有的区域覆盖路径规划算法中,由于任务区域的多样性,生成的路径往往速度慢,效率低。本文提出了一种基于栅格地图的最优时效无人机区域覆盖方法,使其在实际应用场景中表现更好。我们的工作改进了原来的方法,用最优定时取代了原来的角度成本优化策略,并对无人机进行了实际的测试和建模,最后实验测试表明我们的方法更具时间效率。在此基础上,我们还提出了两种修剪策略,第一种策略是通过不断更新最小路径消耗时间,丢弃计算过程中已经远远超出值的路径;第二种策略是通过死区标记矩阵,在计算过程中及时发现不可达的未覆盖自由网格,避免路径计算错误。本文还对路径成本计算进行了优化,避免了每次成本计算都需要重新计算之前的路径成本。上述措施使算法计算时间减少了约48.88%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信