1 |
M. G. H. Bell, "Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigation", Transportation Research Part B 43, pp.97-107, 2009.
DOI
ScienceOn
|
2 |
E. W. DIJKSTRA, "A Note on Two Problems in Connexion with Graphs", Numerische Mathematik1, pp.269-271, 1959.
DOI
ScienceOn
|
3 |
L. Fu and D. Sun and L. R. Rilett, "Heuristic shortest path algorithms for transportation application: State of the art", Computers & Research Volume 33, pp.3324-3343, 2006.
DOI
ScienceOn
|
4 |
W. Thoma, and P. Weil, "Speed-Up Techniques for Shortest-Path Computations", STACS 2007, LNCS 4393, pp.22-36, 2007.
|
5 |
Y. G. Ryu, "Development of shortest path searching network reduction algorithm", The journal of The Korea Institute of Intelligent Transport Systems, vol. 12, no. 2, pp.12-21, 2013.
과학기술학회마을
DOI
ScienceOn
|
6 |
E. S. Dreyfus, "An appraisal of some dhortest path algorithms.", Operations Research, vol. 17, pp.395-412, 1969.
DOI
ScienceOn
|
7 |
I. Pohl., "Bi-directional search.", Machine Intelligence, vol. 6, pp.127-140, 1971.
|
8 |
P. E. Hart and N. J. Nilsson and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths", Transactions on Systems Science and Cybernetics SSC4 (2), pp.100-107, 1968.
DOI
ScienceOn
|
9 |
L. Fu, "Real-time vehicle routing and scheduling in dynamic and stochastic traffic networks." Ph.D. Dissertation, University of Albera, Edmonton, Alberta, 1996.
|
10 |
E. D. Sacerdoti, "Planning in a hierarchy of abstraction spaces", Artificial Intelligence, vol. 5, pp.115-135, 1974.
DOI
ScienceOn
|
11 |
R. E. Korf, "Planning as search: a quantitative approach", Artificial Intelligence, vol. 33(1), pp.65-68, 1987.
DOI
ScienceOn
|