Advantages and disadvantages of various robot algorithms and their comparison
DOI:
https://doi.org/10.54097/kj1whc43Keywords:
Algorithms, Path planning, Obstacle avoidance.Abstract
In recent years, robotics technology has developed rapidly around the world and has been widely used in many fields, greatly promoting the automation and intelligence of related industries. In this context, robotic algorithms have played a key role in path planning, industrial production of robotic arms, and warehouse management. This study systematically reviews the five key indicators of various robotic algorithms (such as Dijkstra algorithm, A* algorithm, RRT algorithm, etc.) from the time dimension - environmental adaptability, learning efficiency, safety, real-time and robustness, and focuses on analysing the performance of these algorithms in path planning applications in complex obstacle environments. By combining and analysing relevant domestic and foreign literature, the basic principles and performance indicators of various robotic algorithms are systematically summarized, and the advantages and limitations of each algorithm are deeply discussed in combination with actual application scenarios. Finally, the future research directions and development trends of these algorithms are expected to provide a useful reference for related research.
Downloads
References
[1] Mehlhorn, Kurt; Sanders, Peter. Algorithms and Data Structures: The Basic Toolbox. Springer. 2008.
[2] Deng Y, Chen Y, Zhang Y, et al. Fuzzy Dijkstra algorithm for the shortest path problem under an uncertain environment[J]. Applied Soft Computing, 2012, 12 (3): 1231-1237.
[3] Patel, Amit. Heuristics. Amit’s Thoughts on Pathfinding, 1997–2025. Web. 16 Apr. 2025.
[4] Dechter R, Pearl J. Generalized best-first search strategies and the optimality of A[J]. Journal of the ACM (JACM), 1985, 32(3): 505-536.
[5] Khanmirza E, Haghbeigi M, Nazarahari M, et al. A comparative study of deterministic and probabilistic mobile robot path planning algorithms. 2017 5th RSI international conference on robotics and mechatronics (ICRoM). IEEE, 2017: 534-539.
[6] Gang L, Wang J. PRM path planning optimization algorithm research. Wseas Transactions on Systems and Control, 2016, 11(81-86): 7.
[7] Karaman S, Frazzoli E. Sampling-based algorithms for optimal motion planning. The International Journal of Robotics Research. 2011;30(7):846-894.
[8] B. Paden, M. Čáp, S. Z. Yong, D. Yershov and E. Frazzoli. A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles. IEEE Transactions on Intelligent Vehicles, 2016, vol. 1, no. 1, pp. 33-55.
[9] Dolgov D, Thrun S, Montemerlo M, et al. Practical search techniques in path planning for autonomous driving. Ann Arbor, 2008, 1001(48105): 18-80.
[10] Zucker M, Ratliff N, Dragan AD, et al. CHOMP: Covariant Hamiltonian optimization for motion planning. The International Journal of Robotics Research. 2013;32(9-10):1164-1193.
[11] N. Ratliff, M. Zucker, J. A. Bagnell and S. Srinivasa. CHOMP: Gradient optimization techniques for efficient motion planning. 2009 IEEE International Conference on Robotics and Automation, Kobe, Japan, 2009, pp. 489-494.
[12] M. Kalakrishnan, S. Chitta, E. Theodorou, P. Pastor and S. Schaal. STOMP: Stochastic trajectory optimization for motion planning. 2011 IEEE International Conference on Robotics and Automation, Shanghai, China, 2011, pp. 4569-4574.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Highlights in Science, Engineering and Technology
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
