Q value-based dynamic programming using division concept for road networks

Route planning is one of the essential functions of vehicle navigation systems. The shortest path problem has been widely studied for route planning. In this paper, a Q value-based Dynamic Programming using Division Concept is proposed for solving shortest path problem. The proposed algorithm can sa...

Full description

Saved in:
Bibliographic Details
Main Authors: Feng Wen, Shingo Mabu, Mainali, Manoj Kanta, Hirasawa, Kotaro
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Dynamic programming
Handheld computers
Heuristic algorithms
Navigation
Q value
Roads
Shortest path
Shortest path problem
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Route planning is one of the essential functions of vehicle navigation systems. The shortest path problem has been widely studied for route planning. In this paper, a Q value-based Dynamic Programming using Division Concept is proposed for solving shortest path problem. The proposed algorithm can save the route computational time without any preprocessing and precomputing. The simulation results shows the efficiency and effectiveness of the proposed algorithm on large-scale road networks.