
Review on common algorithms in path panning and improvements
- 1 Department of Physics and Astronomy, University College London, Gower Street, London, England, WC1E 6BT
* Author to whom correspondence should be addressed.
Abstract
Based on the cooperation of artificial intelligence (AI) and unmanned driving technology, finding the best path from the starting node to the target node in the shortest time is a research hotspot. The required path planning algorithms can therefore be classified according to their different approaches to solving the problem. This paper focuses on Dijkstra’s algorithm, A* algorithm, Ant colony optimization, and genetic algorithm. It also discusses the present problems of these algorithms and some improvements made by researchers focusing on automated guided vehicle path planning.
Keywords
AVG, Path planning, A* algorithm, Ant colony optimisation, Genetic algorithm.
[1]. Liang B., Yang XM., (2020). Study on a Path Planning Method Based on the Improved Dijkstra Algorithm, Informatization Research, 46(2), pp. 13-16, http://www.cqvip.com/qk/91231a/202002/7102460649.html.
[2]. Liang B., Yang XM., (2020). Study on a Path Planning Method Based on the Improved Dijkstra Algorithm, Informatization Research, 46(2), pp. 13-16, http://www.cqvip.com/qk/91231a/202002/7102460649.html.
[3]. Zhang JG, Zhang F., Chen LG, Jiang Q, Zhu W. (2022). Path planning of automatic guided vehicle based on improved A* algorithm, Foreign Electronic Measurement Technology, 41(1),pp.123-128,https://ie.cnki.net/kmobile/Journal/detail/XSDN_XNYJ/GWCL202201021.
[4]. Qi XX., Huang JJ., Cao JA., (2020). Path planning for unmanned vehicle based on improved A* algorithm, Journal of Computer Applications, 40(7), pp. 2021-2027, http://www.joca.cn/CN/10.11772/j.issn.1001-9081.2019112016.
[5]. Chen TF., Deng ZL., Zhang ZH., (2021). Path Planning of Mobile Robot Based on Improved A* algorithm, China Satellite Navigation Conference. Jiangxi, Nanchang, China, 21 May, https://cpfd.cnki.com.cn/Article/CPFDTOTAL-WXDH202105009004.htm .
[6]. Jiang M., Wang F., Ge Y., Sun LL., (2019). Research on path planning of mobile robot based on improved ant colony algorithm. Chinese Journal of Scientific Instrument, 40(2), pp. 113-121, https://www.cnki.com.cn/Article/CJFDTotal-YQXB201902013.htm.
[7]. Sun B., Jiang P., Zhou GR., Lu YT., (2019). Application of Improved Genetic Algorithm in Path Planning of Mobile Robots. Computer Engineering and Applications, 55(17), pp. 162-168, https://www.cnki.com.cn/Article/CJFDTOTAL-JSGG201917026.htm.
[8]. Wang H., Zhao XJ., Yuan Xiujiu. (2022). Robot Path Planning Based on Improved Adaptive Genetic Algorithm. Electronics Optics & Control, 29(5), pp. 72-76, https://www.cnki.com.cn/Article/CJFDTOTAL-DGKQ202205014.htm.
[9]. Li Y., Yuan HY., Yu JQ., Zhang GW., Liu KP., (2019). A literature review of the Application of Genetic Algorithms in Optimization application. Shandong Industrial Technology, 12, pp. 242-243, http://www.cqvip.com/qk/70459x/201912/83687174504849574950504949.html.
[10]. Liang XH., Mu YH., Wu BH., Jiang Y., (2020). Summary of Path Planning Algorithms.Value Engineering, 3, pp. 295-299, http://www.cnki.com.cn/Article/CJFDTotal-JZGC202003117.htm.
Cite this article
Li,X. (2023). Review on common algorithms in path panning and improvements. Applied and Computational Engineering,6,6-10.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 3rd International Conference on Signal Processing and Machine Learning
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).