메뉴 건너뛰기




Volumn 9, Issue 10, 2013, Pages 925-948

Faster hyperpath generating algorithms for vehicle navigation

Author keywords

hyperpath generating algorithms; node directed search; optimistic node potentials; vehicle navigation

Indexed keywords

ACCELERATION TECHNIQUE; HYPERPATH; NODE POTENTIALS; NODE-DIRECTED SEARCH; REAL TRAFFIC; SHORTEST PATH PROBLEM; TRAFFIC NETWORKS; VEHICLE NAVIGATION;

EID: 84886403813     PISSN: 23249935     EISSN: 23249943     Source Type: Journal    
DOI: 10.1080/18128602.2012.719165     Document Type: Article
Times cited : (18)

References (26)
  • 1
    • 55049094635 scopus 로고    scopus 로고
    • Hyperstar: a multipath A-star algorithm for risk averse vehicle navigation
    • Bell, MGH, 2009. Hyperstar: a multipath A-star algorithm for risk averse vehicle navigation. Transportation Research Part B: Methodological, 43 (1), 97-107. doi: 10.1016/j.trb.2008.05.010
    • (2009) Transportation Research Part B: Methodological , vol.43 , Issue.1 , pp. 97-107
    • Bell, M.G.H.1
  • 2
    • 84859159548 scopus 로고    scopus 로고
    • Time-dependent Hyperstar algorithm for robust vehicle navigation
    • Bell, MG., et al., 2012. Time-dependent Hyperstar algorithm for robust vehicle navigation. Transportation Research Part A: Policy and Practice, 46, 790-800. doi: 10.1016/j.tra.2012.02.002
    • (2012) Transportation Research Part A: Policy and Practice , vol.46 , pp. 790-800
    • Bell, M.G.1
  • 3
    • 0003240326 scopus 로고    scopus 로고
    • Development of a route guidance generation system for real-time application
    • In: Papageorgiou M, Pouliezos A, editors Crete, Crete,: Greece, June 1997
    • Ben-Akiva, M., et al., 1997. Development of a route guidance generation system for real-time application. In PapageorgiouMPouliezosA (Ed.), The 8th IFAC symposium on transportation systems, Crete,: Greece.June 1997
    • (1997) The 8th IFAC symposium on transportation systems
    • Ben-Akiva, M.1
  • 4
    • 33847731195 scopus 로고    scopus 로고
    • Reliable pre-trip multipath planning and dynamic adaptation for a centralized road navigation system
    • Chen, YY, Bell, MGH, and Bogenberger, K, 2007. Reliable pre-trip multipath planning and dynamic adaptation for a centralized road navigation system. IEEE Transactions on Intelligent Transportation Systems, 8 (1), 14-20. doi: 10.1109/TITS.2006.889437
    • (2007) IEEE Transactions on Intelligent Transportation Systems , vol.8 , Issue.1 , pp. 14-20
    • Chen, Y.Y.1    Bell, M.G.H.2    Bogenberger, K.3
  • 6
    • 84886402617 scopus 로고    scopus 로고
    • Common bus lines and passenger assignment in congested transit networks
    • Cominetti, R, and Correa, J, 2001. Common bus lines and passenger assignment in congested transit networks. Transportation Science, 9, 115-121.
    • (2001) Transportation Science , vol.9 , pp. 115-121
    • Cominetti, R.1    Correa, J.2
  • 8
    • 0022094206 scopus 로고
    • Generalized best-first search strategies and the optimality of A*
    • Dechter, R, and Pearl, J, 1985. Generalized best-first search strategies and the optimality of A*. Journal of the ACM, 32 (3), 505-536. doi: 10.1145/3828.3830
    • (1985) Journal of the ACM , vol.32 , Issue.3 , pp. 505-536
    • Dechter, R.1    Pearl, J.2
  • 9
    • 0015078345 scopus 로고
    • A probabilistic multipath traffic assignment model which obviates path enumeration
    • Dial, RB, 1971. A probabilistic multipath traffic assignment model which obviates path enumeration. Transportation Research, 5, 83-111. doi: 10.1016/0041-1647(71)90012-8
    • (1971) Transportation Research , vol.5 , pp. 83-111
    • Dial, R.B.1
  • 10
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra, E, 1959. A note on two problems in connection with graphs. Numerical Mathematics, 1, 395-412. doi: 10.1007/BF01386390
    • (1959) Numerical Mathematics , vol.1 , pp. 395-412
    • Dijkstra, E.1
  • 11
    • 84886447050 scopus 로고    scopus 로고
    • Finding the k shortest paths. Technical Report CA92717
    • University of California, Irvine
    • Eppstein, D. 1998. Finding the k shortest paths. Technical Report CA92717, Department of Information and Computer Science, University of California, Irvine.
    • (1998) Department of Information and Computer Science
    • Eppstein, D.1
  • 12
    • 84876094786 scopus 로고    scopus 로고
    • Link-based route choice considering risk aversion, disappointment and regret
    • Washington, DC (Accepted for Transportation Research Record: Journal of Transportation Research Board)
    • Fonzone, A., et al., 2012. Link-based route choice considering risk aversion, disappointment and regret. Presented at the 91st TRB annual meeting. Washington, DC (Accepted for Transportation Research Record: Journal of Transportation Research Board).
    • (2012) Presented at the 91st TRB annual meeting
    • Fonzone, A.1
  • 17
    • 70349086470 scopus 로고    scopus 로고
    • Testing a reliable in-vehicle navigation algorithm in the field
    • Kaparias, I, and Bell, MGH, 2009. Testing a reliable in-vehicle navigation algorithm in the field. Intelligent Transport Systems, 3 (3), 314-324. doi: 10.1049/iet-its.2008.0075
    • (2009) Intelligent Transport Systems , vol.3 , Issue.3 , pp. 314-324
    • Kaparias, I.1    Bell, M.G.H.2
  • 18
    • 0042746453 scopus 로고
    • Discovering admissible heuristics by abstracting and optimizing: a transformational approach
    • Detroit
    • Mostow, J. and Prieditis, A.E. 1989. Discovering admissible heuristics by abstracting and optimizing: a transformational approach. In: Proceedings IJCAI-89, Detroit. 701-707.
    • (1989) Proceedings IJCAI-89 , pp. 701-707
    • Mostow, J.1    Prieditis, A.E.2
  • 19
    • 0024104706 scopus 로고
    • Equilibrium traffic assignment for large scale transit networks
    • Nguyen, S, and Pallottino, S, 1988. Equilibrium traffic assignment for large scale transit networks. European Journal of Operational Research, 37 (2), 176-186. doi: 10.1016/0377-2217(88)90327-X
    • (1988) European Journal of Operational Research , vol.37 , Issue.2 , pp. 176-186
    • Nguyen, S.1    Pallottino, S.2
  • 20
    • 76149134725 scopus 로고    scopus 로고
    • Boarding and alighting in frequency-based transit assignment
    • Nökel, K, and Wekeck, S, 2009. Boarding and alighting in frequency-based transit assignment. Transportation Research Record, 2111, 60-67. doi: 10.3141/2111-08
    • (2009) Transportation Research Record , vol.2111 , pp. 60-67
    • Nökel, K.1    Wekeck, S.2
  • 24
    • 0024650417 scopus 로고
    • Optimal strategies: A new assignment model for transit networks
    • Spiess, H, and Florian, M, 1989. Optimal strategies: A new assignment model for transit networks. Transportation Research Part B, 23 (2), 83-102. doi: 10.1016/0191-2615(89)90034-9
    • (1989) Transportation Research Part B , vol.23 , Issue.2 , pp. 83-102
    • Spiess, H.1    Florian, M.2
  • 25
    • 37149041227 scopus 로고    scopus 로고
    • Speed-up techniques for shortest path computations
    • Budapest, Budapest,: Springer
    • Wagner, D, and Willhalm, T, 2007. Speed-up techniques for shortest path computations. Lecture notes in computer science, (pp. 23-36). Budapest: Springer.4393
    • (2007) Lecture notes in computer science , vol.4393 , pp. 23-36
    • Wagner, D.1    Willhalm, T.2
  • 26
    • 69949166815 scopus 로고    scopus 로고
    • Automated route finding on digital terrains
    • 5-9, Akaroa, New Zealand
    • Wichmann, D.R. and Wuensche, B.C. 2004. Automated route finding on digital terrains. In: Proceedings of IVCNZ'04, 5-9, Akaroa, New Zealand.
    • (2004) Proceedings of IVCNZ '04
    • Wichmann, D.R.1    Wuensche, B.C.2


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