Path Planning of Mobile Robot Based on Improved A* Algorithm

摘要

Path planning technology is the core part of the independent navigation of mobile robots. The problem of unscrupulous road planning and many turning point nodes need to be resolved. In response to the problem of traditional A* algorithm expansion nodes, long search time, and excessive path bending, an improvement A* algorithm that uses an inspiration function optimization and cubic Bezier curve optimization. Based on the ROS open-source system, the Gazebo physical simulation environment is built, and the practical Gmapping builds a grid map. The improved algorithm before and after the improvement is used as a global path planner plugin and applied to ROS for simulation experiments. The simulation results show that in the same simulation experimental environment, the length of the improved A* algorithm path is reduced by 17.161%, and the number of redundant turning nodes is reduced by 71.429%; More reasonable, further meet the constraints of mobile robots.