Abstract: In order to overcome the shortcoming of route plan algorithms' inefficiency caused by an oversized road network, a new route plan algorithm, hierarchy A* algorithm, was proposed. The hierarchy A* algorithm is characterized by the multi-level road network decomposition pre-processing, the goal-directed strategy, the bidirectional strategy and the improved data structure strategy. The experimental result shows that compared with the A* algorithm and the highway hierarchical algorithm, the proposed algorithm increases the computational efficiency by averages of 11.7 and 2.4 times respectively, reduces the search space by averages of 5.7 and 2.8 times， respectively, and has a stable search space and computational efficiency.