A New Approach for Path Planning On Roads with Efficient Cache-Support

Abstract

In this paper, propose a system. Namely, Path coming up with by Caching, to answer a brand new path coming up with a question with a speedy response by expeditiously caching and reusing the historical queried-paths. Not like the traditional cache-based path coming up with systems, wherever a queried path within the cache is employed only it matches utterly with the new question, PPC leverages the part matched cached queries to answer part(s) of a brand new question. The efficiency of this path planning function is critical for mobile users on roads due to various dynamic scenarios, such as a sudden change in driving direction, unexpected traffic conditions, lost or unstable GPS signals, and so on. In these scenarios, the path planning service needs to be delivered in a timely fashion. In this paper, we propose a system, namely, Path Planning by Caching (PPC), to answer a new path planning query in real time by efficiently caching and reusing historical queried-paths. Unlike the conventional cache-based path planning systems, where a queried-path in cache is used only when it matches perfectly with the new query, PPC leverages the partially matched queries to answer part(s) of the new query. As a result, the server only needs to compute the unmatched path segments, thus significantly reducing the overall system workload. Comprehensive experimentation on a real road network database shows that our system outperforms the state-of-the-art path planning techniques by reducing 32 percent of the computation latency on average.