Revisiting Suboptimal Search.
作者： Nathan R. Sturtevant , Wheeler Ruml , Jingwei Chen , William J. Doyle
DOI:
关键词:
摘要:
参考文章(6)
Peter Hart, Nils Nilsson, Bertram Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths IEEE Transactions on Systems Science and Cybernetics. ,vol. 4, pp. 100- 107 ,(1968) , 10.1109/TSSC.1968.300136
Alberto Martelli, On the complexity of admissible search algorithms Artificial Intelligence. ,vol. 8, pp. 1- 13 ,(1977) , 10.1016/0004-3702(77)90002-9
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
Ariel Felner, Roni Stern, Daniel Gilon, Dynamic Potential Search — A New Bounded Suboptimal Search annual symposium on combinatorial search. pp. 36- 44 ,(2016)
Doyle William, Ramsdell Jordan, Cserna Bence, Ruml Wheeler, AVOIDING DEAD ENDS IN REAL-TIME HEURISTIC SEARCH national conference on artificial intelligence. pp. 1306- 1313 ,(2018)
Jingwei Chen, Nathan R. Sturtevant, Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search. international joint conference on artificial intelligence. pp. 1220- 1226 ,(2019) , 10.24963/IJCAI.2019/170