关键词: 路径规划, 避障控制, A*算法, 移动机器人

Abstract:

The traditional A* algorithm is only applicable to the global static environment. When solving path planning problems, it has the disadvantages of low search efficiency and uneven path. In response to these problems, the following improvements have been made：Optimizing the global path nodes and introducing the deleting redundant points criterion and the new node criterion, which can make the global path smoother and more in line with robot kinematics; Combined with the idea of the rolling window method, local path planning is performed in each rolling window. The local sub-target area is determined by the node information of the previous step, and then obstacle avoidance control strategies are introduced in the local sub-target area to implement real-time obstacle avoidance. Finally, a variety of grid map simulations are established on the Matlab, where the improved algorithm is compared with the original algorithm in terms of path smoothness, search efficiency and local planning ability, and the simulation analysis is performed in a dynamic environment. The simulation results show that the improved algorithm has good local planning capabilities, at the same time the path trajectory is smoother and the search efficiency is higher in complex environments.

Key words: path planning, obstacle avoidance control, A* algorithm, moving robot