Abstract-In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A simple approach to this problem would be to recompute the best path for all queries on arrival of every delay update. However, such a naive approach scales poorly when there are many users who have requested routes in the system. Instead, we propose two new classes of approximate techniques -K-paths and proximity measures to substantially speed up processing of the set of designated routes specified by continuous route planning queries in the face of incoming traffic delay updates. Our techniques work through a combination of precomputation of likely good paths and by avoiding complete recalculations on every delay update, instead only sending the user new routes when delays change significantly. Based on an experimental evaluation with 7,000 drives from real taxi cabs, we found that the routes delivered by our techniques are within 5% of the best shortest path and have run times an order of magnitude or less compared to a naive approach.
The work in REF proposes two new classes of approximation techniques that use precomputation and avoidance of complete recalculations on every update to speed up the processing of continuous route planning queries.
A continuous query system for dynamic route planning
2011 IEEE 27th International Conference on Data Engineering
2011 IEEE 27th International Conference on Data Engineering
Computer Science