SUMMARY OF RESEARCH ON PATH PLANNING BASED ON A* ALGORITHM

D. Ran, J. Ma, F. Peng, H. Li
{"title":"SUMMARY OF RESEARCH ON PATH PLANNING BASED ON A* ALGORITHM","authors":"D. Ran, J. Ma, F. Peng, H. Li","doi":"10.1049/icp.2021.1291","DOIUrl":null,"url":null,"abstract":"The A* (A-Star) algorithm is a direct search method for solving the shortest path in a static road network. Because of its robust search ability and guaranteed path optimality, it has been used in many fields such as unmanned driving, medical drug delivery, post-disaster rescue, and mining detection. This paper introduces the principle of A* algorithm, analyzes its influencing factors, and then summarizes the improvement methods and research status of A* algorithm from heuristic function, search strategy, environmental modelling and other aspects, finally looks forward to the challenges faced by the algorithm in practical applications and the future development direction.","PeriodicalId":337028,"journal":{"name":"The 8th International Symposium on Test Automation & Instrumentation (ISTAI 2020)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 8th International Symposium on Test Automation & Instrumentation (ISTAI 2020)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/icp.2021.1291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The A* (A-Star) algorithm is a direct search method for solving the shortest path in a static road network. Because of its robust search ability and guaranteed path optimality, it has been used in many fields such as unmanned driving, medical drug delivery, post-disaster rescue, and mining detection. This paper introduces the principle of A* algorithm, analyzes its influencing factors, and then summarizes the improvement methods and research status of A* algorithm from heuristic function, search strategy, environmental modelling and other aspects, finally looks forward to the challenges faced by the algorithm in practical applications and the future development direction.
基于a *算法的路径规划研究综述
A* (A- star)算法是求解静态路网中最短路径的一种直接搜索方法。由于其强大的搜索能力和路径最优性的保证,在无人驾驶、医疗药物递送、灾后救援、矿山探测等领域得到了广泛的应用。本文介绍了A*算法的原理,分析了其影响因素,然后从启发式函数、搜索策略、环境建模等方面总结了A*算法的改进方法和研究现状,最后展望了该算法在实际应用中面临的挑战和未来的发展方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信