The Minimal Set of States that Must Be Expanded in a Front-to-End Bidirectional Search.
作者： Nathan R. Sturtevant , Ariel Felner , Jingwei Chen , Eshed Shaham
DOI:
关键词:
摘要:
参考文章(7)
Rina Dechter, Judea Pearl, Generalized best-first search strategies and the optimality of A* Journal of the ACM. ,vol. 32, pp. 505- 536 ,(1985) , 10.1145/3828.3830
A. Felner, R. E. Korf, S. Hanan, Additive pattern database heuristics Journal of Artificial Intelligence Research. ,vol. 22, pp. 279- 318 ,(2004) , 10.1613/JAIR.1480
John E. Hopcroft, Richard M. Karp, An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs SIAM Journal on Computing. ,vol. 2, pp. 225- 231 ,(1973) , 10.1137/0202019
Malte Helmert, Landmark Heuristics for the Pancake Problem annual symposium on combinatorial search. ,(2010)
Nathan R. Sturtevant, Ariel Felner, Robert C. Holte, Guni Sharon, Bidirectional search that is guaranteed to meet in the middle national conference on artificial intelligence. pp. 3411- 3417 ,(2016)
Nathan R. Sturtevant, Jingwei Chen, External memory bidirectional search international joint conference on artificial intelligence. pp. 676- 682 ,(2016)
Nathan R. Sturtevant, Robert C. Holte, Sandra Zilles, Jingwei Chen, Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions arXiv: Artificial Intelligence. ,(2017)