Research on Improvement and Optimization of A* Algorithm in Robot Path Planning

Abstract

With the development of science and technology, the research on robots has attracted more and more attention. In many cases, robots are used to perform some tasks instead of people. In the process of robot movement, path planning technology is the most important, and path planning algorithm is the core of path planning technology. A* algorithm is one of the commonly used algorithms in the field of path planning. This paper improves the traditional A* algorithm based on A* algorithm and combined with the actual requirements of this work. The penalty term of velocity change is added to the cost function of the traditional A* algorithm, and the pathfinding strategy of the algorithm is changed. The improved algorithm can be considered more comprehensively in path planning, so as to plan a path that takes the shortest time to execute a task.