Title :
Q value-based dynamic programming using division concept for road networks
Author :
Wen, Feng ; Mabu, Shingo ; Mainali, Manoj Kanta ; Hirasawa, Kotaro
Author_Institution :
Grad. Sch. of Inf., Waseda Univ., Kitakyushu, Japan
Abstract :
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.
Keywords :
dynamic programming; navigation; network theory (graphs); path planning; road vehicles; roads; Q value; division concept; dynamic programming; large-scale road networks; route planning; shortest path problem; vehicle navigation systems; Algorithm design and analysis; Dynamic programming; Handheld computers; Heuristic algorithms; Navigation; Roads; Shortest path problem; Dynamic programming; Q value; Shortest path;
Conference_Titel :
SICE Annual Conference (SICE), 2011 Proceedings of
Conference_Location :
Tokyo
Print_ISBN :
978-1-4577-0714-8
