Path Planning of Mobile Robot Based on A* Algorithm

摘要

Path planning for mobile robots has always been A hot topic. A-star algorithm and its extensibility algorithm have been widely used to solve the optimal path of mobile robots. In this paper, in the study of robot path planning algorithm, detailed elaborated the basic principle of traditional A * algorithm, and through the grid method to partition the robot path planning area, using the MATLAB simulation platform to generate two-dimensional path the robot simulation map simulation experiment, and analyze the results and research, provide experience for the further research in the future.