信息与计算科学-最短路径图形结构算法及应用.docxVIP

PAGE III 最短路径图形结构算法及应用 摘要 日常出行人们依靠地图和导航来查询路线，计算两地最短的距离，选择最适合的路径，这时最短路径算法的需求就体现了出来。 最短路径算法，比较经典是Dijkstra算法，采用广度搜索(BFS)的思想，深度优先搜索（DFS）仅考虑与目标点的剩余代价而导致往往搜索不到最短的路径。A*算法作为Dijkstra算法的扩展，因其高效性而被广泛应用于寻路及图的遍历，且结果往往是最优解。 本文中主要探讨A*算法的运作方式，使用java代码编写对应程序，对生活中实例进行演示操作，发现影响算法搜索的效率的主要原因是openlist节点的遍历次数和一共执行的搜索次数，遍历次数和搜索次数的增多均会导致搜索时间的增加 在对算法进行分析改进后，提出了增加转向时的权值从而减少转向、以低精度的栅格替代高精度的栅格、用节点网图替代栅格网图等算法改进方案。经过实验均可在部分情况下提升算法效率同时精度损失可以忽略不计。 关键词 路径规划 最短路径 A*算法 运行效率 Algorithm and application of shortest path graph structure Abstract Daily travelers rely on maps and navigation to query routes, calculate the shortest distance between the two places, and choose the most suitable path. At this time, the demand of the shortest path algorithm is reflected. Dijkstra algorithm is the classic shortest path algorithm. It adopts the idea of breadth search (BFS), and depth first search (DFS) only considers the residual cost with the target point, so it often fails to find the shortest path. As an extension of Dijkstra algorithm, A * algorithm is widely used in path finding and graph traversal due to its high efficiency, and the final path is often the optimal solution. This paper mainly discusses the operation mode of A * algorithm, uses Java code to write corresponding programs, and demonstrates the operation of real life examples. It is found that the main reasons that affect the efficiency of algorithm search are the number of traversal of openlist node and the total number of searches executed. The increase of traversal times and search times will lead to the increase of search time After analyzing and improving the algorithm, the paper puts forward some improved schemes, such as increasing the weight g of turning to reduce turning, replacing high precision grid with low precision grid, replacing grid with node grid. In some cases, the efficiency of the algorithm can be improved and the accuracy loss can be ignored. Key words path planning shortest path A* algorithm operation efficiency 目 录 TOC