Art

J-GLOBAL ID：201102233398115680   Reference number：11A0404166

Dynamic Optimal Route Search Algorithm for Car Navigation Systems with Preferences by Dynamic Programming

動的計画法による優先権付きカーナビゲーションシステムの動的最適経路探索アルゴリズム

Author (5)： MAINALI Manoj Kanta (Waseda Univ., Fukuoka, JPN) ,  MABU Shingo (Waseda Univ., Fukuoka, JPN) ,  YU Shanqing (Waseda Univ., Fukuoka, JPN) ,  ETO Shinji (Waseda Univ., Fukuoka, JPN) ,  HIRASAWA Kotaro (Waseda Univ., Fukuoka, JPN)
Material： IEEJ Transactions on Electrical and Electronic Engineering  (IEEJ Trans Electr Electron Eng)
Volume： 6  Issue： 1  Page： 14-22  Publication year： Jan. 2011 
JST Material Number： W1854A  ISSN： 1931-4973  Document type： Article
Article type： 原著論文  Country of issue： United States (USA)  Language： ENGLISH (EN)

Thesaurus term： dynamic programming ,  *guide system ,  path search ,  search problem ,  *road network ,  road traffic ,  search algorithm
Semi thesaurus term： *car navigation system

JST classification (2)： Road engineering in general  (RC08010M) ,  Running gears  (QG03040V)

Reference (20)：

• DIJKSTRA, E. A note on two problems in connection with graphs. Numerische Mathematik. 1959, 1, 269-271
• HART, P. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics. 1968, SSC-4, 2, 100-107
• GOLDEN, B. Shortest-path algorithms : a comparison. Operations Research. 1976, 24, 6, 1164-1168
• JAGADEESH, GR. Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems. 2002, 3, 4, 301-309
• LIU, B. Using knowledge about the road network for route finding. Proceedings of the 11th Conference on Artificial Intelligence for Applications, 1995. 1995, 306-312

Terms in the title (5)： 動的計画法 ,  優先権 ,  カーナビゲーションシステム ,  経路探索 ,  アルゴリズム