Share Email Print

Proceedings Paper

Designing a dynamic path guidance system based on electronic maps by using Q-learning
Author(s): Liang Zou; Jianmin Xu; Lingxiang Zhu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Shortest path problem from one origin node to one destination node in non-FIFO (First In First Out) dynamic networks is an unsolved hard problem in dynamic path guidance system. A new approach based on Q-learning is adopted to solve the problem based on electronic maps in this paper. The approach uses geographical information on electronic maps to define Q-learning's value function. Q-learning algorithm's strategy train learning method and training process on path searching are presented. Finally based on Guangzhou City's electronic map, we randomly generate a dynamic network containing 20000 nodes, 40000 links and 144 time intervals, which do not satisfy FIFO to test the approach proposed in this paper. The approach is implemented with this dynamic network and its computational performance is analyzed experimentally. The experimental results prove the effectiveness of the approach.

Paper Details

Date Published: 4 January 2006
PDF: 5 pages
Proc. SPIE 5985, International Conference on Space Information Technology, 59855A (4 January 2006); doi: 10.1117/12.658569
Show Author Affiliations
Liang Zou, South China Univ. of Technology (China)
Jianmin Xu, South China Univ. of Technology (China)
Lingxiang Zhu, South China Agricultural Univ. (China)

Published in SPIE Proceedings Vol. 5985:
International Conference on Space Information Technology
Cheng Wang; Shan Zhong; Xiulin Hu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?