A Lévy-Inspired Kinodynamic A* Algorithm for Quadrotor Fast Path Searching

Lin Zhao, Xinghui Zhang, Weiyan Ren
{"title":"A Lévy-Inspired Kinodynamic A* Algorithm for Quadrotor Fast Path Searching","authors":"Lin Zhao, Xinghui Zhang, Weiyan Ren","doi":"10.1109/CCIS53392.2021.9754685","DOIUrl":null,"url":null,"abstract":"The advance in research on path searching has enabled quadrotor to navigate autonomously in unknown environments. However, high-speed path searching still remains a significant challenge. Given very limited time, existing path searching methods has no strong guarantee on the feasibility of the solution. This paper proposed a Lévy-inspired kinodynamic A*(LIK-A*) algorithm for quadrotor path searching application. Search strategy with Lévy random walk is introduced in the kinodynamic A* update formula, which helps to increase the perturbation and the diversity of candidate path solution. The search step length is dynamically adjusted during the searching process, making the trajectory to achieve reasonable time allocation and be away from obstacles. To demonstrate the effectiveness of the proposed algorithm, this paper executes simulated flight test. The experiment results show that, comparing to the kinodynamic A* algorithm, the proposed LIK-A* algorithm has better convergence accuracy, stability, and stronger path searching capability, using significantly less memory and time.","PeriodicalId":191226,"journal":{"name":"2021 IEEE 7th International Conference on Cloud Computing and Intelligent Systems (CCIS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 7th International Conference on Cloud Computing and Intelligent Systems (CCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCIS53392.2021.9754685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The advance in research on path searching has enabled quadrotor to navigate autonomously in unknown environments. However, high-speed path searching still remains a significant challenge. Given very limited time, existing path searching methods has no strong guarantee on the feasibility of the solution. This paper proposed a Lévy-inspired kinodynamic A*(LIK-A*) algorithm for quadrotor path searching application. Search strategy with Lévy random walk is introduced in the kinodynamic A* update formula, which helps to increase the perturbation and the diversity of candidate path solution. The search step length is dynamically adjusted during the searching process, making the trajectory to achieve reasonable time allocation and be away from obstacles. To demonstrate the effectiveness of the proposed algorithm, this paper executes simulated flight test. The experiment results show that, comparing to the kinodynamic A* algorithm, the proposed LIK-A* algorithm has better convergence accuracy, stability, and stronger path searching capability, using significantly less memory and time.
四旋翼飞行器快速路径搜索的一种lsamv - inspired运动学A*算法
路径搜索的研究进展使四旋翼飞行器能够在未知环境中自主导航。然而,高速路径搜索仍然是一个重大挑战。由于时间非常有限,现有的路径搜索方法对解的可行性没有强有力的保证。提出了一种基于lcv启发的四旋翼路径搜索算法(lika *)。在动力学A*更新公式中引入了lsamvy随机游动搜索策略,增加了候选路径解的摄动性和多样性。在搜索过程中动态调整搜索步长,使轨迹实现合理的时间分配,远离障碍物。为了验证所提算法的有效性,本文进行了模拟飞行试验。实验结果表明,与动力学A*算法相比,本文提出的lika *算法具有更好的收敛精度、稳定性和更强的路径搜索能力,占用的内存和时间显著减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信