Typical Method Combination of Global Path Planning Technology Based on SLAM Technology
DOI:
https://doi.org/10.62051/68cdnf60Keywords:
Global path planning; Reinforcement learning; Deep learning; Adaptability.Abstract
As automation and intelligent technologies progress rapidly, robotics has seen broad adoption in multiple sectors such as autonomous transportation, UAV operations, home automation, and industrial manufacturing. In order to achieve autonomous navigation of robots in unknown, dynamic, and complex environments, global path planning technology has become a key research direction. This article explores the typical methods and optimization research of global path planning based on SLAM (Simultaneous Localization and Mapping) technology. A detailed analysis was conducted on the advantages, disadvantages, and applicable scenarios of A* algorithm, RRT algorithm, ant colony algorithm, and Dijkstra algorithm, and the challenges and limitations of these algorithms in practical applications were pointed out. In addition, by combining reinforcement learning and deep learning techniques, the article further explores the potential technical challenges faced by current path planning technologies, and proposes the development direction of future path planning technologies, including the intelligence, adaptability, and robustness improvement of algorithms in complex environments.
Downloads
References
[1] E.S. Ali, Machine learning technologies for secure vehicular communication in internet of vehicles: Recent advances and applications, Secur. Commun. Netw. 2021 (3) (2021) 1-23.
[2] F. Zhang, K. Zhu, MG-SLAM: RGB-D SLAM based on semantic segmentation for dynamic environment in the Internet of Vehicles, Computers, Materials and Continua 82 (2) (2025) 2353-2372.
[3] C. Warren, "Global path planning using artificial potential fields," in 1989 IEEE International Conference on Robotics and Automation, Scottsdale, AZ, 1989, pp. 316,317,318,319,320,321, doi: 10.1109/ROBOT.1989.100007.
[4] T. Bräunl. Embedded Robotics: Mobile Robot Design and Applications with Embedded Systems, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 2006.
[5] D. Nemec, M. Gregor, E. Bubeníková, M. Hruboš, R. Pirnik. Improving the Hybrid A* method for a non-holonomic wheeled robot. Int. J. Adv. Robot. Syst. 2019, 16, 1729881419826857.
[6] D. Zhang, C. Chen and G. Zhang, AGV Path Planning Based on Improved A-star Algorithm, 2024 IEEE 7th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC), Chongqing, China, 2024, pp. 1590-1595, doi: 10.1109/IAEAC59436.2024.10503919.
[7] L. Liu, X. Wang, X. Yang, H. Liu, J. Li, P. Wang, Path planning techniques for mobile robots: Review and prospect, Expert Systems with Applications 227 (2023) 120254.
[8] (IJACSA) International Journal of Advanced Computer Science and Applications, Vol. 7, No. 11, 2016 97 | P a g e www.ijacsa.thesai.org
[9] M. Psotka, F. Duchoň, M. Roman, T. Michal, & D. Michal. Global Path Planning Method Based on a Modification of the Wavefront Algorithm for Ground Mobile Robots. Robotics, 12(1), 25 (2023).
[10] P. Li, T. Huang, W. Wang and W. Feng, Research on the advantages of legs and tracks collaborative path planning based on improved A* and obstacle avoidance, 2024 7th International Conference on Computer Information Science and Application Technology (CISAT), Hangzhou, China, 2024, pp. 791-795, doi: 10.1109/CISAT62382.2024.10695240.
[11] J. J. Kuffner and S. M. LaValle, RRT-connect: An efficient approach to single-query path planning, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065), San Francisco, CA, USA, 2000, pp. 995-1001 vol.2, doi: 10.1109/ROBOT.2000.844730.
[12] B. C. Mohan, & R. Baskaran. A survey: Ant Colony Optimization based recent research and implementation on several engineering domain. Expert Systems with Applications, 39(4), 4618-4627. (2012). https://doi.org/10.1016/j.eswa.2011.09.076
Downloads
Published
Conference Proceedings Volume
Section
License
Copyright (c) 2025 Transactions on Computer Science and Intelligent Systems Research

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.







