Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles

IF 3.3 3区 计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS Computing Pub Date : 2024-07-01 DOI:10.1007/s00607-024-01309-7
Selcuk Aslan
{"title":"Back-and-Forth (BaF): a new greedy algorithm for geometric path planning of unmanned aerial vehicles","authors":"Selcuk Aslan","doi":"10.1007/s00607-024-01309-7","DOIUrl":null,"url":null,"abstract":"<p>The autonomous task success of an unmanned aerial vehiclel (UAV) or its military specialization called the unmanned combat aerial vehicle (UCAV) has a direct relationship with the planned path. However, planning a path for a UAV or UCAV system requires solving a challenging problem optimally by considering the different objectives about the enemy threats protecting the battlefield, fuel consumption or battery usage and kinematic constraints on the turning maneuvers. Because of the increasing demands to the UAV systems and game-changing roles played by them, developing new and versatile path planning algorithms become more critical and urgent. In this study, a greedy algorithm named as the Back-and-Forth (BaF) was designed and introduced for solving the path planning problem. The BaF algorithm gets its name from the main strategy where a heuristic approach is responsible to generate two predecessor paths, one of which is calculated from the start point to the target point, while the other is calculated in the reverse direction, and combines the generated paths for utilizing their advantageous line segments when obtaining more safe, short and maneuverable path candidates. The performance of the BaF was investigated over three battlefield scenarios and twelve test cases belonging to them. Moreover, the BaF was integrated into the workflow of a well-known meta-heuristic, artificial bee colony (ABC) algorithm, and detailed experiments were also carried out for evaluating the possible contribution of the BaF on the path planning capabilities of another technique. The results of the experiments showed that the BaF algorithm is able to plan at least promising or generally better paths with the exact consistency than other tested meta-heuristic techniques and runs nine or more times faster as validated through the comparison between the BaF and ABC algorithms. The results of the experiments further proved that the integration of the BaF boosts the performance of the ABC and helps it to outperform all of fifteen competitors for nine of twelve test cases.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"80 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01309-7","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

The autonomous task success of an unmanned aerial vehiclel (UAV) or its military specialization called the unmanned combat aerial vehicle (UCAV) has a direct relationship with the planned path. However, planning a path for a UAV or UCAV system requires solving a challenging problem optimally by considering the different objectives about the enemy threats protecting the battlefield, fuel consumption or battery usage and kinematic constraints on the turning maneuvers. Because of the increasing demands to the UAV systems and game-changing roles played by them, developing new and versatile path planning algorithms become more critical and urgent. In this study, a greedy algorithm named as the Back-and-Forth (BaF) was designed and introduced for solving the path planning problem. The BaF algorithm gets its name from the main strategy where a heuristic approach is responsible to generate two predecessor paths, one of which is calculated from the start point to the target point, while the other is calculated in the reverse direction, and combines the generated paths for utilizing their advantageous line segments when obtaining more safe, short and maneuverable path candidates. The performance of the BaF was investigated over three battlefield scenarios and twelve test cases belonging to them. Moreover, the BaF was integrated into the workflow of a well-known meta-heuristic, artificial bee colony (ABC) algorithm, and detailed experiments were also carried out for evaluating the possible contribution of the BaF on the path planning capabilities of another technique. The results of the experiments showed that the BaF algorithm is able to plan at least promising or generally better paths with the exact consistency than other tested meta-heuristic techniques and runs nine or more times faster as validated through the comparison between the BaF and ABC algorithms. The results of the experiments further proved that the integration of the BaF boosts the performance of the ABC and helps it to outperform all of fifteen competitors for nine of twelve test cases.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
往返算法(BaF):一种用于无人飞行器几何路径规划的新贪婪算法
无人驾驶飞行器(UAV)或其军事专业飞行器--无人战斗飞行器(UCAV)的自主任务成功与否与规划的路径有直接关系。然而,无人飞行器或无人战斗飞行器系统的路径规划需要考虑保护战场的敌方威胁、燃料消耗或电池使用以及转弯动作的运动学约束等不同目标,从而优化解决一个具有挑战性的问题。由于对无人机系统的要求越来越高,无人机系统的作用也在不断改变,因此开发新的多功能路径规划算法变得更加重要和紧迫。本研究设计并引入了一种名为 "来回"(BaF)的贪婪算法来解决路径规划问题。BaF 算法的名称来源于其主要策略,即采用启发式方法生成两条前置路径,其中一条是从起点到目标点的计算路径,另一条是反方向的计算路径,并将生成的路径进行组合,以利用其有利线段获得更安全、更短、更机动的候选路径。在三个战场场景和 12 个测试案例中对 BaF 的性能进行了研究。此外,还将 BaF 集成到了一种著名的元启发式算法--人工蜂群(ABC)算法的工作流程中,并进行了详细的实验,以评估 BaF 对另一种技术的路径规划能力可能做出的贡献。实验结果表明,与其他测试过的元启发式技术相比,BaF 算法至少能规划出有希望的路径,甚至一般情况下能规划出更好的路径,而且与其他元启发式技术相比,BaF 算法的运行速度要快 9 倍或更多,这一点通过 BaF 算法和 ABC 算法之间的比较得到了验证。实验结果进一步证明,BaF 的集成提高了 ABC 的性能,并帮助其在 12 个测试案例中的 9 个案例中超越了所有 15 个竞争对手。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computing
Computing 工程技术-计算机:理论方法
CiteScore
8.20
自引率
2.70%
发文量
107
审稿时长
3 months
期刊介绍: Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.
期刊最新文献
Mapping and just-in-time traffic congestion mitigation for emergency vehicles in smart cities Fog intelligence for energy efficient management in smart street lamps Contextual authentication of users and devices using machine learning Multi-objective service composition optimization problem in IoT for agriculture 4.0 Robust evaluation of GPU compute instances for HPC and AI in the cloud: a TOPSIS approach with sensitivity, bootstrapping, and non-parametric analysis
×
引用
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