Academic Journal of Engineering and Technology Science, 2026, 9(2); doi: 10.25236/AJETS.2026.090213.
Shihan Fang
University of Shanghai for Science and Technology, Shanghai, 200093, China
Path planning for substation inspection robots faces significant challenges in environments characterized by densely distributed equipment and narrow passages, which severely degrade the sampling efficiency and convergence speed of conventional algorithms. To address these limitations, this paper proposes an enhanced Rapidly-exploring Random Tree* (RRT*) framework that explicitly exploits the structured spatial layout of substations. Specifically, the proposed approach overcomes existing bottlenecks by introducing a Dynamic Constrained Sampling Space (DCSS) model to restrict exploration within task-relevant regions and minimize invalid samples; implementing a spatial adaptive adjustment strategy to dynamically guide tree expansion around large-scale equipment and prevent local stagnation; and integrating a multi-level dynamic rewiring mechanism to eliminate redundant intermediate nodes and enhance path structural continuity. Comprehensive simulations conducted in representative layout scenarios demonstrate the superiority of the proposed framework. The results indicate that this method provides a highly efficient and reliable navigation solution for intelligent substation inspection.
Navigation, Mobile robot motion-planning, Substations, Algorithms
Shihan Fang. Layout-Aware Path Planning for Substation Inspection Robots Using Enhanced RRT*. Academic Journal of Engineering and Technology Science (2026), Vol. 9, Issue 2: 95-102. https://doi.org/10.25236/AJETS.2026.090213.
[1] T. Zhang, and J. Dai, "Electric power intelligent inspection robot: a review." J. Phys.: Conf. Ser., 2021, Art. no. 012023.
[2] S. Lu, Y. Zhang, and J. Su, “Mobile robot for power substation inspection: A survey,” IEEE/CAA Journal of Automatica Sinica, vol. 4, no. 4, pp. 830-847, Oct. 2017.
[3] H. Ye, H. Tian, Q. Wu, Y. Xue, J. Xiao, G. Liu, and Y. Xiong, “Synergistic Hierarchical AI Framework for USV Navigation: Closing the Loop Between Swin-Transformer Perception, T-ASTAR Planning, and Energy-Aware TD3 Control,” Sensors, vol. 25, no. 15, pp. 4699, Aug. 2025.
[4] Z. Liu, A. Pan, A. Jiang, W. Li, J. Zhang, and C. Bai, "Research on Decoupling Motion Path Planning of Two Manipulators of Live Working Robot Based on Hybrid RRT Algorithm." in Proc. 4th World Conf. Mech. Eng. Intell. Manuf. (WCMEIM), 2021, pp. 278–282.
[5] P. E. Hart, N. J. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,” IEEE Trans. Syst. Sci. Cybern., vol. 4, no. 2, pp. 100-107, July 1968.
[6] M. Dorigo, V. Maniezzo, and A. Colorni, “Ant system: optimization by a colony of cooperating agents,” IEEE Trans. Syst., Man, Cybern. B, vol. 26, no. 1, pp. 29-41, Feb. 1996.
[7] J. Kennedy, and R. Eberhart, “Particle swarm optimization,” in Proc. IEEE Int. Conf. Neural Netw., Perth, WA, Australia, 1995, pp. 1942-1948.
[8] S. Karaman and E. Frazzoli, “Sampling-based algorithms for optimal motion planning,” Int. J. Robot. Res., vol. 30, no. 7, pp. 846–894, June 2011.
[9] P. Luo, B. Li, X. Xue, and Z. Liu, “Research on path planning of substation inspection robot based on improved A* algorithm,” in Proc. China Autom. Congr. (CAC), Xiamen, China, 2022, pp. 1119–1124.
[10] C. Mao, J. Ma, P. Qi, and D. Wang, “Novel path planning algorithm for the mobile robot in power transformer substation,” Int. Trans. Electr. Energy Syst., vol. 2025, no. 1, 2025.
[11] J. Huang, C. Chen, J. Shen, G. Liu, et al., “A self-adaptive neighborhood search A-star algorithm for mobile robots global path planning,” Comput. Electr. Eng., vol. 123, 2025.
[12] G. Li, C. Liu, L. Wu, and W. Xiao, “A mixing algorithm of ACO and ABC for solving path planning of mobile robot,” Appl. Soft Comput., vol. 148, Art. no. 110868, Dec. 2023.
[13] Y. Xu, Q. Jin, and Y. Zhang, “A path planning method for mobile robots incorporating artificial potential field method and ant colony algorithm,” in Proc. Int. Conf. Autom. Control, Algorithm, Intell. Bionics (ACAIB), 2023, pp. 346–353.
[14] W. Wang, X. Yin, S. Wang, J. Wang, et al., “Robot path planning method combining enhanced APF and improved ACO algorithm for power emergency maintenance,” Int. J. Inf. Technol. Syst. Approach, vol. 16, no. 3, 2023.
[15] Q. Su and Y. Cai, “Path planning for power inspection robot based on improved PSO algorithm and dynamic window approach,” in Proc. 5th Int. Conf. Inf. Sci., Parallel Distrib. Syst. (ISPDS), Guangzhou, China, 2024, pp. 498–502.
[16] Q. Li, J. Wang, H. Li, B. Wang, and C. Feng, “Fast-RRT*: An improved motion planner for mobile robot in two-dimensional space,” IEEJ Trans. Electr. Electron. Eng., vol. 16, no. 10, pp. 1451–1460, Oct. 2021.
[17] X. Cui et al., “More quickly-RRT*: Improved quick rapidly-exploring random tree star algorithm,” Eng. Appl. Artif. Intell., vol. 133, Art. no. 108246, July 2024.
[18] J. J. Kuffner and S. M. LaValle, “RRT-connect: An efficient approach to single-query path planning,” in Proc. IEEE Int. Conf. Robot. Autom. (ICRA), San Francisco, CA, USA, vol. 2, Apr. 2000, pp. 995–1001.