A Survey of Path Planning Algorithms for Inspection Robots

Chuangren Wu

doi:10.62051/ijcsit.v6n3.03

Authors

Chuangren Wu

DOI:

https://doi.org/10.62051/ijcsit.v6n3.03

Keywords:

Path planning, Mobile robots, Photovoltaic inspection

Abstract

Against the backdrop of inspection robots being widely applied in complex dynamic scenarios such as industrial automation and intelligent services, this paper systematically reviews three mainstream path planning algorithms—traditional algorithms (A*, Dijkstra, and their improved variants), sampling-based algorithms (PRM, RRT*, and their variants), and intelligent optimization algorithms (genetic algorithm, particle swarm optimization, ant colony optimization, and their enhancements)—by synthesizing domestic and international research. It examines their core principles, advantages, limitations, and applicable scenarios, with a focus on cutting-edge trends such as algorithm integration, multi-sensor perception synergy, and multi-objective optimization. The review provides a clear framework for understanding algorithm applicability and selection across diverse scenarios, and aims to offer theoretical references for developing efficient, robust path planning technologies tailored to complex dynamic environments in future inspection robots.

Downloads

Download data is not yet available.

References

[1] Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, *4*(2), 100-107.

[2] Stentz, A. (1994). Optimal and efficient path planning for partially-known environments. Proceedings of IEEE International Conference on Robotics and Automation, 3310-3317.

[3] Tang, G., Tang, C., Claramunt, C., Hu, X., & Zhou, L. (2021). Geometric A-star algorithm: An improved A-star algorithm for AGV path planning in a port environment. IEEE Access, *9*, 59196-59210. https://doi.org/10.1109/ACCESS.2021.3070054

[4] Zheng, Yi.(2018). Fast trajectory planning algorithm for aircraft based on improved Dijkstra algorithm [Unpublished master's thesis].

[5] Kavraki, L. E., Svestka, P., Latombe, J. C., & Overmars, M. H. (1996). Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, *12*(4), 566-580. https://doi.org/10.1109/70.508439

[6] Liu, Yang. (2020). Research on path planning based on improved PRM algorithm [Technical report]. Chinese Academy of Sciences.

[7] Feng, Ao.(2021). Robot path planning based on improved PRM algorithm. Journal of Mechanical Engineering, *57*(5), 23-30.

[8] Karaman, S., & Frazzoli, E. (2011). Sampling-based algorithms for optimal motion planning. The International Journal of Robotics Research, *30*(7), 846–894. https://doi.org/10.1177/0278364911406761

[9] Luo, Jiyu. (2022). Mobile robot path planning based on improved RRT algorithm. Robotics and Autonomous Systems, *148*, 103966.

[10] Liu, ZhiHai. (2019). Research on mobile robot path planning based on improved genetic algorithm [Doctoral dissertation]. Harbin Institute of Technology.

[11] Xu Dong Chen. (2021). Research on path planning based on multi-strategy improved particle swarm optimization. IEEE Transactions on Intelligent Transportation Systems, *22*(8), 5123-5132.

[12] Xue, Xiang. (2020). Robot path planning based on improved ant colony optimization. Applied Soft Computing, *89*, 106074.

[13] He, Jia. (2021). Global path planning for unmanned surface vehicles based on greedy-ant colony algorithm. Ocean Engineering, *235*, 109348.

[14] Zhang, Danhong. (2022). Patrol path planning for unmanned surface vessels combining A and ant colony optimization. Control Engineering Practice, *118*, 104956.

[15] Lu, Hai Peng. (2023). Path planning research based on improved ant colony optimization. Expert Systems with Applications, *213*, 118887.