改进A*算法的机器人全局最优路径规划

针对传统A^*算法规划的路径存在很多冗余点和拐点的问题，提出了一种基于A^*算法改进的高效路径规划算法。首先，改进评价函数的具体计算方式，减小算法搜索每个区间的计算量，从而降低寻路时间，并改变生成路径；其次，在改进评价函数具体计算方式的基础上，改进评价函数的权重比例，减少生成路径中的冗余点和拐点；最后，改进路径生成策略，删除生成路径中的无用点，从而提高路径的平滑性；此外，考虑到机器人的实际宽度，改进后算法引入障碍物扩展策略保证规划路径的可行性。将改进A^*算法与三种算法进行仿真对比，实验结果表明，改进后的A^*算法规划的路径更加合理，寻路时间更短，平滑性更高。

Global optimal path planning for robots with improved A* algorithm

There are many redundant points and inflection points in the path planned by the traditional A^* algorithm. Therefore, an efficient path planning algorithm based on A^* algorithm was proposed. Firstly, the specific calculation method of the evaluation function was improved to reduce the calculation amount of the algorithm searching each interval, thereby reducing the path finding time and changing the generation path. Secondly, on the basis of improving the specific calculation method of the evaluation function, the weight ratio of the evaluation function was improved, and the redundant points and inflection points in the generation path were reduced. Finally, the path generation strategy was improved to delete the useless points in the generation path, improving the smoothness of the path. In addition, considering the actual width of the robot, the improved algorithm introduced an obstacle expansion strategy to ensure the feasibility of the planned path. The comparison of the improved A^* algorithm with three algorithms shows that the path of the improved A^* algorithm is more reasonable, the path finding time is shorter, and the smoothness is higher.