Dynamic Path Planning Algorithm Based on Time-Dependent Road Network

In order to solve the shortest path planning problem in the time-dependent road network, we proposed a landmark-oriented heuristic algorithm based on the dynamic shortest tree (DALT). Experimental results show that the DALT algorithm in dynamic scenarios, not only to ensure the robustness and accuracy of the query, but also get better query time. In addition, by comparison with the classical static shortest path algorithm, the DALT algorithm in the preprocessing time and query efficiency achieved better performance.