基于可搜索24邻域的A*算法路径规划

针对A^*算法在移动机器人路径规划时求解得到的路径长度不是最优并且转折点较多的问题,提出了可搜索24邻域的A^*算法路径规划.该方法在传统A^*算法的基础上进一步改进其启发搜索策略,将传统A^*算法的可搜索邻域个数从离散的8个扩展到24个,进而增加更多的搜索方向.结果表明,改进的A^*算法实现了路径长度更短的目的,同时降低了转折点数,且移动机器人的运行路径也更加平滑.本文方法具有较强的实际意义和应用背景,通过实际运行过程验证了其设计方法具有一定的有效性.

Path planning for A* algorithm based on searching 24 neighborhoods

In order to solve the problem that the path length is not the best and the turning point is many when the traditional A^* algorithm is used in the path planning of mobile robot, a path planning for A^* algorithm based on searching 24 neighborhoods was proposed. The heuristic search strategy was further improved on the basis of the traditional A^* algorithm, the number of searching neighborhood in the traditional A^* algorithm was extended from 8 discrete points to 24 points, and then more searching directions could be increased. The results show that the improved A^* algorithm can realize the purpose of shorter path length, and can reduce the number of turning points simultaneously. The operating path of mobile robot also becomes smoother. The proposed method has stronger practical significance and application background, and the effectiveness of the design method is verified through the actually operating process.