一种改进的A*路径规划算法研究及其Qt实现

An Improved A* Path Planning Algorithm and Its Qt Implementation

摘要: 路径规划算法是人工智能技术中的关键技术之一，常用的A*算法可以在大多数情况下以较快的速度生成路径，但考虑到不同工作环境中最优路径与运行效率不可兼得，为提高现有A*算法的使用灵活度，本文提出了一种加权A*算法，改进了算法的运行时间和搜索准确度。改进后的算法在Qt5.12.9和UOS操作系统环境下进行了实现和测试，结果表明求出最短路径的概率为100%，平均运行时间与传统A*算法相比缩短了12.3%。与标准的A*相关算法相比，提出的改进算法能够缩短规划时间，缩小算法搜索空间，提高算法在路径规划问题中的适用性，提高了不同环境路径生成的效率和平滑性，为运行载体在复杂背景下的精确控制提供了新思路。

Abstract: Path planning algorithm is one of the key technologies in artificial intelligence technology, common A* algorithm can generate road route quickly under most circumstances. Given that it can not achieve the best road route and working efficiency in different working environments at the same time, this paper proposes a weighted A* algorithm, which shortens the running time and enhances search accuracy of the algorithm. The improved algorithm is implemented and tested under Qt5. 12.9 and UOS environment, the results show that the probability of finding the shortest path is 100%, and the average running time is shortened by 12.3%. Compared with the standard A* algorithm, the weighted A* algorithm can shorten the planning time, reduce the search space of the algorithm, and improve the applicability of the algorithm in path planning problems. It improves the efficiency and smoothness of path generation in different environments, and provides a new idea for the precise control of operating vehicles in complex backgrounds.