A Brief History and Recent Achievements in Bidirectional Search.
作者： Nathan R. Sturtevant , Ariel Felner
DOI:
关键词:
摘要:
参考文章(37)
Th. Mohr, C. Pasche, A parallel shortest path algorithm Computing. ,vol. 40, pp. 281- 292 ,(1988) , 10.1007/BF02276912
Patrick A. V. Hall, Branch-and-bound and beyond international joint conference on artificial intelligence. pp. 641- 650 ,(1971)
Thomas Ottmann, Jürgen Eckerle, An efficient data structure for bidirectional heuristic search european conference on artificial intelligence. pp. 600- 604 ,(1994)
A. Kazi, Shamsul Arefin, B. Aloke, Kumar Saha, A New Approach of Iterative Deepening Bi- Directional Heuristic Front-to-Front Algorithm (IDBHFFA) ,(2010)
H. Kaindl, G. Kainz, Bidirectional heuristic search reconsidered Journal of Artificial Intelligence Research. ,vol. 7, pp. 283- 317 ,(1997) , 10.1613/JAIR.460
Nathan Sturtevant, Ariel Felner, Carsten Moldenhauer, Jonathan Schaeffer, Single-frontier bidirectional search national conference on artificial intelligence. pp. 59- 64 ,(2010)
Carlos Linares López, Andreas Junghanns, Perimeter Search Performance annual conference on computers. pp. 345- 359 ,(2002) , 10.1007/978-3-540-40031-8_23
Ira Sheldon Pohl, Bi-directional and heuristic search in path problems Stanford University. ,(1969)
Richard E Korf, Joseph K Barker, Limitations of front-to-end bidirectional heuristic search national conference on artificial intelligence. pp. 1086- 1092 ,(2015)
T. A. J. Nicholson, Finding the Shortest Route between Two Points in a Network The Computer Journal. ,vol. 9, pp. 275- 280 ,(1966) , 10.1093/COMJNL/9.3.275