Moreover, integrating the fact of Shenzhen, this article introduces a route planning ameliorate Dijkstra algorithm interlards radix heaps, heuristic searching and hierarchical searching. Thus this is a valuable reference to planning technology application research. 结合深圳的实际情况,给出引入了基数堆、启发式搜索和分级搜索后的路径规划改进Dijkstra算法,提供一个具有很高参考价值的规划技术应用研究。