基于A*算法的最短路径寻优数学方法研究

The Shortest Path Optimization Method Based on the A* Algorithm Research

近年来,作为人工智能领域一个分支的最短路径探索仍值得做更进一步的讨论和研究,最短路径问题是给定的网络图中寻找出一条从起始点到目标点之间的最短路径。在最短路径的算法之中,各个算法也都具有各自的优点和适用性。针对Dijkstra算法、蚁群算法、A*算法的特点,经过分析与研究得出,A*算法在最短路径寻优方面比其它路径寻优效率更高,对A*算法的程序实现,为人工智能领域以及机器人路径应用方面提供了重要的实际应用参考价值。

In recent years, as a branch of artificial intelligence shortest path exploration is worth to do further discussion and research, the shortest path problem is given in the network diagram to find out a from the shortest path between the starting point to the target point. Each algorithm in the shortest path algorithm, also have their respective advantages and applicability. According to Dijkstra algorithm, ant colony algorithm, the characteristics of the A*algorithm, after analysis and study of A*algorithm in the aspect of the shortest path optimization is higher than other path optimization efficiency, implementation, the procedures of the A*algorithm in artificial intelligence field and robot path application provides an important reference value in practical application.