关键词: 路径规划, 最短路径算法, 道路网络分层, Dijkstra算法, A*算法

Abstract: Intelligent transportation route guidance system can greatly improve the efficiency and experience of travel. Classic A* algorithm to focus only on the search precision while ignoring the search efficiency, this paper introduces a improved high-level A* algorithm based on Hierarchy of the urban road network, evaluation function with different weightings for different nodes in the road network, meanwhile it sets an upper and lower limiting threshold value of the weight to balance the efficiency and accuracy of search. The experiments show that this shortest path is though not the shortest conventional length but the real travel time optimal.