智能交通系统中几种最短路径算法分析

Analysis of the Shortest Path Algorithm in ITS

最短路径选择是智能交通系统的重要研究课题,它能够根据存储在电子地图中的道路网的拓扑关系,实时准确地规划出最短路径。目前的最短路径算法主要有4种,即Dijkstra搜索算法、A*算法、A*优先算法、A*双向分层启发式算法,每一种算法都有不同的执行标准,例如有的算法考虑获取最短路径,但没有考虑算法运行时间;有的算法同时考虑在运行时间和获取最短路径这两个方面。详细分析这4种算法的路径算法,比较其优劣。

The shortest path to the Intelligent Transportation System is to choose an important research topic, it can be stored in the electronic map of the road network topology relationship between the real-time and accurate planning of the shortest path. At present, the shortest path algorithm, there are four kinds, as： Dijkstra algorithm, A＊ algorithm, A＊ algorithm priority, A＊ heuristic two-tiered; each has a different method of implementation of the standards, such as access to some algorithm to consider the shortest path, but the algorithm does not take the time to run; some algorithms running at the same time to consider the time and access to the shortest path to these two areas. This article detailed analysis of the four algorithms.