共 10 条
[1]
Correction to a formal basis for the heuristic determination of minimum cost paths. Hart,P.E.,Nilsson,N.J.,Raphael,B. SIGART Newsletter . 1972
[2]
A path algorithm based on dynamic networks and restricted searching area. Fu Meng-yin,Xue Bin. Proceeeding of the IEEE Interna-tional Conference on Automation and Logistics . 2007
[3]
A procedure for quantitatively site layout alter-natives. Li Z,Anson M,Li G. Constra Manage Econ . 2001
[4]
Adaptations of theA*Algorithmfor the Computation of Fastest Paths in Deterministic Dis-crete-Time Dynamic Networks. Ismail Chabini,Shan Lan. IEEE Transactionson Intelligent Transportation Systems . 2004
[5]
EfficientModified BidirectionalA*Algorithm for Optimal Route-Finding. Taeg-Keun Whangbo. IEA/AIE2007 . 2007
[6]
Schedule-de-pendent evolution of site layout planning. Elbeltagi E,Hegazy T,Hosny AD,et al. Constr Man-age Econ . 2003
[7]
A Multiple-PlatformDecentralized Route Finding System. Hans W.Guesgen,Debasis Mitra. IEA/AIE99 . 2001
[8]
A New Shortest Path AlgorithmBased on Heuristic Strategy. Chen Xi,Fei Qi,Li Wei. Proceedings of the 6thWord Congress on Intelligence Control and Automation . 2006
[9]
LaVatle Planning Algorithms. Steven M. . 2006
[10]
Introduction to Algorithms. T. H. Cormen,C. E. Leiserson,R. L. Rivest,and C. Stein. McGraw Hill s Washington Report on Medicine Health . 2001