交通科技与经济
交通科技與經濟
교통과기여경제
Technology & Economy in Areas of Communications
2009年
4期
110-112
,共3页
Diikstra搜索算法%A*算法%A*优先算法%A*双向分层启发式算法
Diikstra搜索算法%A*算法%A*優先算法%A*雙嚮分層啟髮式算法
Diikstra수색산법%A*산법%A*우선산법%A*쌍향분층계발식산법
Dij kstra algorithm%A * algorithm%A * algorithm priority%A * heuristic two-tiered
最短路径选择是智能交通系统的重要研究课题,它能够根据存储在电子地图中的道路网的拓扑关系,实时准确地规划出最短路径.目前的最短路径算法主要有4种,即Dikstra搜索算法、A*算法、A*优先算法、A*双向分层启发式算法,每一种算法都有不同的执行标准,例如有的算法考虑获取最短路径,但没有考虑算法运行时间;有的算法同时考虑在运行时间和获取最短路径这两个方面.详细分析这4种算法的路径算法,比较其优劣.
最短路徑選擇是智能交通繫統的重要研究課題,它能夠根據存儲在電子地圖中的道路網的拓撲關繫,實時準確地規劃齣最短路徑.目前的最短路徑算法主要有4種,即Dikstra搜索算法、A*算法、A*優先算法、A*雙嚮分層啟髮式算法,每一種算法都有不同的執行標準,例如有的算法攷慮穫取最短路徑,但沒有攷慮算法運行時間;有的算法同時攷慮在運行時間和穫取最短路徑這兩箇方麵.詳細分析這4種算法的路徑算法,比較其優劣.
최단로경선택시지능교통계통적중요연구과제,타능구근거존저재전자지도중적도로망적탁복관계,실시준학지규화출최단로경.목전적최단로경산법주요유4충,즉Dikstra수색산법、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 realtime 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 rum 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.
