Efficient Single Frontier Bidirectional Search.
作者： Ariel Felner , Marco Lippi , Marco Ernandes
DOI:
关键词:
摘要: … eSBS and IDA* which potentially uses only the square root of … 1It was labeled by the authors as SFBDS but to improve the … This can be obtained by providing each state with a variable, …
参考文章(7)
Nathan R. Sturtevant, Ariel Felner, Neil Burch, Jonathan Schaeffer, Max Barrer, Memory-based heuristics for explicit state spaces international joint conference on artificial intelligence. pp. 609- 614 ,(2009)
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)
Uzi Zahavi, Ariel Felner, Robert C. Holte, Jonathan Schaeffer, Duality in permutation state spaces and the dual search algorithm Artificial Intelligence. ,vol. 172, pp. 514- 540 ,(2008) , 10.1016/J.ARTINT.2007.10.019
Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant, Zhifu Zhang, Inconsistent heuristics in theory and practice Artificial Intelligence. ,vol. 175, pp. 1570- 1603 ,(2011) , 10.1016/J.ARTINT.2011.02.001
Richard E. Korf, Depth-first iterative-deepening: an optimal admissible tree search Artificial Intelligence. ,vol. 27, pp. 97- 109 ,(1985) , 10.1016/0004-3702(85)90084-0
Malte Helmert, Landmark Heuristics for the Pancake Problem annual symposium on combinatorial search. ,(2010)