메뉴 건너뛰기




Volumn , Issue , 2008, Pages 671-674

An advanced algorithm for finding shortest path in car navigation system

Author keywords

Car navigation system; Geometrical figures; Shortest path

Indexed keywords

AUTOMOBILE DRIVERS; COMPUTER NETWORKS; CONFORMAL MAPPING; INTELLIGENT CONTROL; INTELLIGENT NETWORKS; INTELLIGENT SYSTEMS; NAVIGATION; NAVIGATION SYSTEMS;

EID: 58049152437     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICINIS.2008.147     Document Type: Conference Paper
Times cited : (16)

References (8)
  • 2
    • 58049161266 scopus 로고    scopus 로고
    • Aartsen-prof.dr. J. van Leeuwen Copromotor, dr. J.H. Verriet, Route planning Algorithm for Car navigation, I.C.M 2004.
    • Aartsen-prof.dr. J. van Leeuwen Copromotor, dr. J.H. Verriet," Route planning Algorithm for Car navigation", I.C.M 2004.
  • 3
    • 58049148626 scopus 로고    scopus 로고
    • Fast Shortest Path Algorithm for Road Network and Implementation
    • Liang Dai,"Fast Shortest Path Algorithm for Road Network and Implementation",Carleton Honours PROJECT, 2005.
    • (2005) Carleton Honours PROJECT
    • Dai, L.1
  • 5
    • 58049180394 scopus 로고    scopus 로고
    • a.shad, Evaluation of route finding method in Gis Application ,Map Asia 2003.
    • a.shad, "Evaluation of route finding method in Gis Application ",Map Asia 2003.
  • 6
    • 58049166128 scopus 로고    scopus 로고
    • F.Benjamin Zhan, three fastest shortest path algorithms on real road networks: data structure and produres,2002.
    • F.Benjamin Zhan, " three fastest shortest path algorithms on real road networks: data structure and produres",2002.
  • 7
    • 58049181586 scopus 로고    scopus 로고
    • A Method for the shortest path by Extended Dijkstra
    • M.Noto, H.sato ," A Method for the shortest path by Extended Dijkstra", IEEE, 0-L7803-6583-6/00,2000.
    • (2000) IEEE, 0-L7803-6583-6/00
    • Noto, M.1    sato, H.2
  • 8
    • 58049166396 scopus 로고    scopus 로고
    • Andrew V. Goldberg1 Haim Kaplan2 Renato F. Werneck3, Reach for A*:Efficient Point-to-Point Shortest Path Algorithms,2004.
    • Andrew V. Goldberg1 Haim Kaplan2 Renato F. Werneck3", Reach for A*:Efficient Point-to-Point Shortest Path Algorithms",2004.


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