Research indexConference paper
Inspection Robot Path Planning Optimization Algorithm
Lu, Liu
28 Nov 2025
NobleIDark:/48914/w1/20261105/979FE700DOI10.1109/spic68204.2025.11470926
Inspection Robot Path Planning Optimization Algorithm
Lu, Liu · 2025 · Subscription
NobleIDark:/48914/w1/20261105/979FE700DOI10.1109/spic68204.2025.11470926
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
A robot path planning method that integrates improved D* and the Time Elastic Band (TEB) algorithms is proposed to address the issues of low safety in obstacle avoidance and path planning tasks for inspection robots in complex environments, a large number of redundant path data points, and insufficiently smooth planned paths. Firstly, in the simulation environment, the traditional A * algorithm was compared with the D * algorithm, and it was found that the cost value of the D * algorithm was lower. Therefore, the D * algorithm was chosen as the basic optimization algorithm; Secondly, by incorporating the Douglas Puck algorithm, the generation of redundant nodes in the path is further reduced; Using B-spline curves again on the generated path increased its smoothness and optimized the path quality; Finally, the improved global D * algorithm was combined with the local TEB algorithm for fusion experiments. Experimental results in Robot Operating System (ROS) simulation and physical environments confirm significant reductions compared to both baseline and literature algorithms: maximum curvature decreased by 80% and 67.3%, average curvature by 64.1% and 52%, maximum turning angle by 69.2% and 35.1%, and average turning angle by 37.5% and 16.7% respectively, improving the safety and path smoothness of the inspection robot and reducing data points.