메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2773-2778

A fast path planning algorithm for route guidance system

Author keywords

Dijkstra algorithm; path planning; Route guidance system (RGS); shortest path problem (SPP); urban road network (URN)

Indexed keywords

DIJKSTRA ALGORITHMS; DYNAMIC TRAFFIC; FAST PATH; FAST PATH ALGORITHMS; ORIGIN AND DESTINATIONS; PATH PLANNING PROBLEMS; ROAD NETWORK; ROAD RESOURCES; ROUTE GUIDANCE SYSTEMS; SHORTEST PATH; SHORTEST PATH PROBLEM; URBAN ROAD NETWORKS;

EID: 83755188206     PISSN: 1062922X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSMC.2011.6084092     Document Type: Conference Paper
Times cited : (15)

References (7)
  • 2
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connection with Graphs
    • Edsger Wybe Dijkstra, A Note on Two Problems in Connection with Graphs. journal of Numerical Mathematics. vol. 1, pp. 269-271. (1959)
    • (1959) Journal of Numerical Mathematics , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 85000327782 scopus 로고    scopus 로고
    • Dijkstra algorithm on-line: An empirical case study from public railroad transport
    • New York, NY, USA
    • Schulz, Frank and Wagner, Dorothea and Weihe, Karsten, Dijkstra algorithm on-line: an empirical case study from public railroad transport. J. Exp. Algorithmics. Vol. 5, pp. 12. New York, NY, USA (2000)
    • (2000) J. Exp. Algorithmics , vol.5 , pp. 12
    • Schulz, F.1    Wagner, D.2    Weihe, K.3


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