Work

Path Planning of Underground Robots via Improved A* and Dynamic Window Approach

Year: 2025
Type: article
Abstract: This paper addresses the limitations of the A* algorithm in underground roadway path planning, such as proximity to roadway boundaries, intersection with obstacle corners, trajectory smoothness, and timely obstacle avoidance (e.g., fallen rocks, miners, and moving equipment). To overcome these challenges, we propose an improved path planning algorithm integrating an enhanced A* method with an improved Dynamic Window Approach (DWA). First, a diagonal collision detection mechanism is implemented within the A* algorithm to effectively avoid crossing obstacle corners, thus enhancing path safety. Secondly, roadway width is incorporated into the heuristic function to guide paths toward the roadway center, improving stability and feasibility. Subsequently, based on multiple global path characteristics—including path length, average curvature, fluctuation degree, and direction change rate—an adaptive B-spline curve smoothing method generates smoother paths tailored to the robot’s kinematic requirements. Furthermore, the global path is segmented into local reference points for DWA, ensuring seamless integration of global and local path planning. To prevent local optimization traps during obstacle avoidance, a distance-based cost function is introduced into DWA’s evaluation criteria, maintaining alignment with the global path. Experimental results demonstrate that the proposed method significantly reduces node expansions by 43.79%, computation time by 16.28%, and path inflection points by 80.70%. The resultant path is smoother, centered within roadways, and capable of effectively avoiding dynamic and static obstacles, thereby ensuring the safety and efficiency of underground robotic transport operations.
Authors: Jianlong Dai, Yinghao Chai, Peiyin Xiong
Language: English
Open Access status: gold
Estimated APC paid: $2,896
OpenAlex ID: W4411499276
FWCI: 0.749
Cites: 10
Cited by: 2
Related to: 10