A Dynamic Parameter Adaptive Path Planning Algorithm

Path planning in complex environments has always been a focus of research for scholars both domestically and internationally. This study addresses the challenge of path planning that combines obstacle avoidance and optimal path searching in scenarios lacking prior knowledge. The proposed approach introduces a parameter dynamic adaptation strategy for path planning. Experimental investigations are conducted using grid-based maps, and the results demonstrate that the method presented in this paper surpasses Q-learning and Sarsa algorithms in terms of comprehensive exploration, enhanced stability, and quicker convergence speed.