Robot Path Planning Algorithm Based on A~＊ in Unknown Environment
Yueshan Xiong · Computer Engineering and Science · 2012
This paper presents a new robot path planning algorithm based on the basic A*.Adopting the TWICE-PATH-PLANNING strategy,the robot can re-plan its path effectively when falling across an unknown obstacle in the given environment;adopting the CHILD-NODE-GENERATION strategy based on priority value,the path planner can better deal with the width information of the robot.The new algorithm is proposed based on the above two strategies.In the end,the experimental results show the validity and reliability of the algorithm in both MobileSim simulator and Pioneer P3DX real-world robot.This new algorithm extends the original application regions,improves the intelligence of the robot,and enhances the real-time path planning ability of the robot.