Fast computation of Q‐value‐based dynamic programming on road networks

TLDR: A Q‐value‐based dynamic programming using the division concept for solving both single and multiple shortest path problems on road networks, which can greatly save the computational time without any preprocessing on the road networks.

Abstract: One of the essential components of vehicle navigation systems is route planning. The single shortest path problem and multiple shortest path problem have been widely studied for route planning. This paper introduces a Q-value-based dynamic programming using the division concept for solving both single and multiple shortest path problems on road networks. The proposed algorithm divides the whole network into different divisions, and the updating of Q values in each division is one stage for searching the optimal routes on road networks. The proposed algorithm can greatly save the computational time without any preprocessing on the road networks. The proposed algorithm is also systematically studied in various sizes of road networks. The simulation results show the efficiency and effectiveness of the proposed algorithm on large-scale road networks. © 2012 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.