A~*寻路算法的并行化设计及改进

Parallel Design and Improvement of A~* Path Finding Algorithm

A*算法是一种在求解最短路径时最常用也是最有效的直接搜索方法,也是在图论、人工智能、智能控制等领域最常用的启发式搜索算法。路径问题在日常工作、生活中是一个非常常见的问题,对搜索算法进行优化是解决路径问题的非常重要的一步。在简单介绍Dijkstra算法和传统的A*算法并使用Python编程实现的基础上,针对常规A*算法时间性能较差的问题,利用Python编程实现双向A*寻路算法,针对A*算法的改进进行探讨。

The A＊ algorithm is the most commonly used and most effective direct search method when solving the shortest path, and it is also the most commonly used heuristic search algorithm in the fields of graph theory, artificial intelligence, and intelligent control. The path problem is a very common problem in daily work and life. Optimizing the search algorithm is a very important step to solve the path problem. Based on the brief introduction of Dijkstra＇s algorithm and traditional A＊ algorithm and using Python programming, based on the problem of poor time performance of conventional A＊ algorithm, realizes a two-way A＊ path finding algorithm by using Python programming, and finally for A＊ algorithm, explores the improvements.