In mobile navigation positions, on-road path planning is an essential dimension that finds a sequence between a source area and the destination point. While on streets, the away organizing question might be scattered because of portion considers different circumstances, for the case, a sudden change in driving path, startling activity conditions, or loss of GPS signals. In these situations, path planning needs to be directed promptly. The requirement of timeliness is even more confusing when a vast number of path planning queries acquiesces to the server, e.g., during peak hours. As the response time is unjustified to user approval with personal navigation services, it is a mandate for the server to handle the massive workload of path planning requests efficiently. To handle issues with the presented system, we recommend a scheme, namely, Path Planning by Caching (PPC), that objectives to response a different path planning query efficiently by caching and reprocessing queried paths (queried-paths in short). Distinct conventional cache-based path planning systems where a cached query degenerates just once it matches entirely with an original query, PPC leverages partially matched queried-paths in the cache to response part(s) of the different query. As a consequence, the server only needs to figure the unmatched path segments, thus significantly reducing the overall system workload.
Article Details
Unique Paper ID: 146619
Publication Volume & Issue: Volume 5, Issue 1
Page(s): 454 - 460
Article Preview & Download
Share This Article
Join our RMS
Conference Alert
NCSEM 2024
National Conference on Sustainable Engineering and Management - 2024