메뉴 건너뛰기




Volumn , Issue , 2012, Pages

Q value-based Dynamic Programming with SARSA Learning for real time route guidance in large scale road networks

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION TIME; CONVENTIONAL METHODS; DISTRIBUTED DYNAMICS; DYNAMIC ROUTES; REAL TIME; REAL WORLD ROAD NETWORKS; REAL-TIME TRAFFIC INFORMATION; ROAD NETWORK; ROUTE GUIDANCE; SARSA LEARNING; TRAFFIC MANAGEMENT; TRAFFIC SYSTEMS; TRAVELING TIME; VALUE-BASED;

EID: 84865138132     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2012.6252507     Document Type: Conference Paper
Times cited : (12)

References (21)
  • 1
    • 0033800239 scopus 로고    scopus 로고
    • Integration of the global positioning system and geographical information systems for traffic congestion studies
    • M. A. P. Taylor, J. E. Woolley and R. Zito, "Integration of the global positioning system and geographical information systems for traffic congestion studies" Transportation Research Part C: Emerging Technologies, vol.8, pp.257 - 285, 2000.
    • (2000) Transportation Research Part C: Emerging Technologies , vol.8 , pp. 257-285
    • Taylor, M.A.P.1    Woolley, J.E.2    Zito, R.3
  • 2
    • 0029748773 scopus 로고    scopus 로고
    • Intelligent transportation systems : An economic and environmental policy assessment
    • B. J. Kanninen, "Intelligent transportation systems : an economic and environmental policy assessment", Transportation Reseach, Vol. 30A (I), pp. 1-10, 1996.
    • (1996) Transportation Reseach , vol.30 A , Issue.1 , pp. 1-10
    • Kanninen, B.J.1
  • 5
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. Dijkstra: A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, pp. 269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 7
    • 84899829959 scopus 로고
    • A formal basis for the heuristic determination of minimum cost paths
    • Jul.
    • E. P. Hart, N. J. Nilsson and B. Raphael: A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Syst. Sci. Cybern.,Vol. SSC-4, No. 2, pp. 100-107, Jul. 1968.
    • (1968) IEEE Trans. Syst. Sci. Cybern. , vol.SSC-4 , Issue.2 , pp. 100-107
    • Hart, E.P.1    Nilsson, N.J.2    Raphael, B.3
  • 10
    • 85156221438 scopus 로고    scopus 로고
    • Generalization in reinforcement learning: Succssful examples using sparse coarse coding
    • MIT Press
    • Sutton, R.S, " Generalization in Reinforcement Learning: Succssful Examples Using Sparse Coarse Coding", Advances in Neural Information Processing Systems 8, pp. 1038-1044, MIT Press, 1996.
    • (1996) Advances in Neural Information Processing Systems , vol.8 , pp. 1038-1044
    • Sutton, R.S.1
  • 11
  • 12
    • 84865142564 scopus 로고    scopus 로고
    • I-Transport Lab. CO.Ltd.
    • I-Transport Lab. CO.,Ltd. Available: http://www.i-transportlab .jp/products/sound/
  • 13
    • 0032108018 scopus 로고    scopus 로고
    • Finding the K shortest paths
    • D. Eppstein: Finding the K shortest paths, SIAM J. Comput., Vol. 28, No. 2, pp. 652-673, 1998.
    • (1998) SIAM J. Comput. , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 15
    • 36049033090 scopus 로고
    • Algorithms for finding an optimal set of short disjoint paths in a communication network
    • Nov.
    • D. Torrieri: Algorithms for finding an optimal set of short disjoint paths in a communication network, IEEE Trans. Commun., Vol. 40, No. 1 1, pp. 1698-1702, Nov. 1992.
    • (1992) IEEE Trans. Commun. , vol.40 , Issue.11 , pp. 1698-1702
    • Torrieri, D.1
  • 16
    • 33847731195 scopus 로고    scopus 로고
    • Reliable pretrip multipath planning and dynamic adaptation for a centralized road navigation system
    • Y. Chen, M. G. H. Bell and K. Bogenberger: Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation System, IEEE Trans. ITS, Vol. 8, No. 1, pp. 14-20, 2007.
    • (2007) IEEE Trans. ITS , vol.8 , Issue.1 , pp. 14-20
    • Chen, Y.1    Bell, M.G.H.2    Bogenberger, K.3
  • 18
    • 0032071072 scopus 로고    scopus 로고
    • Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation
    • N. Jing, Y. Huang and E. Rundensteiner: Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation, IEEE Trans. on Knowledge and Data Engineering, Vol. 10, No. 3, pp. 409-432, 1998.
    • (1998) IEEE Trans. on Knowledge and Data Engineering , vol.10 , Issue.3 , pp. 409-432
    • Jing, N.1    Huang, Y.2    Rundensteiner, E.3
  • 19
    • 0036709198 scopus 로고    scopus 로고
    • An efficient path computation model for hierarchically structured topographical road maps
    • S. lung and S. Pramanik: An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps", IEEE Trans. on Knowledge and Data Engineering, Vol. 14, No. 5, pp. 1029-1046, 2002.
    • (2002) IEEE Trans. on Knowledge and Data Engineering , vol.14 , Issue.5 , pp. 1029-1046
    • Jung, S.1    Pramanik, S.2
  • 20
    • 77953511417 scopus 로고    scopus 로고
    • Multilayer traffic network optimized by multiobjective genetic clustering algorithm
    • F. Wen, M. Gen and X. Yu: Multilayer Traffic Network Optimized by Multiobjective Genetic Clustering Algorithm, IEICE Trans. F undamentals, Vol. E92-A, No. 8, pp. 2107-2115, 2009
    • (2009) IEICE Trans. Fundamentals , vol.E92-A , Issue.8 , pp. 2107-2115
    • Wen, F.1    Gen, M.2    Yu, X.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.