This paper presents a speed up algorithm for real-time path planning based on massive trajectory data mining, which comprises three stages: preparatory work, preprocessing stage and the online fastest path query. At the preparatory stage, this algorithm constructs multi-level landmarks and divides the original road network into multiple levels accordingly. At the preprocessing stage, this algorithm first estimates the travel time of all road segments according to the real-time traffic information, then compares all taxi trajectories to extract the experiential fastest paths, and finally makes use of the multi-level landmarks to obtain the rough fastest paths for all landmark pairs. At the online fastest path query stage, the server side first responds by returning a rough fastest path based on the preprocessing result, and then refines it by iteratively introducing the experiential fastest paths. A series of experiments are made to compare the proposed algorithm with the other three algorithms. Experiments indicate that the proposed algorithm has the ability to find more time-saving paths in response to client requests. More importantly, because this algorithm is capable of ensuring the fast completion of pre-computation on the server side, it has an evident advantage in the time cost of the online fastest path query compared with the other three algorithms, which is particularly suitable for the online optimal path query from a larger number of end users.
Read full abstract