Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search.
作者： Jingwei Chen , Nathan R. Sturtevant
关键词: Topology 、 Node (networking) 、 Computer science 、 Bounded function
摘要:
ijcai.org
sci-hub.st 参考文章(10)
Wheeler Ruml, Jordan T. Thayer, Bounded suboptimal search: a direct approach using inadmissible estimates international joint conference on artificial intelligence. pp. 674- 679 ,(2011) , 10.5591/978-1-57735-516-8/IJCAI11-119
Ira Pohl, The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem solving international joint conference on artificial intelligence. pp. 12- 17 ,(1973)
Nathan R. Sturtevant, Shahab Jabbari Arfaee, Richard Valenzano, Jordan Thayer, Roni Stern, Using alternative suboptimality bounds in Heuristic Search international conference on automated planning and scheduling. pp. 233- 241 ,(2013)
Ira Pohl, Heuristic search viewed as path finding in a graph Artificial Intelligence. ,vol. 1, pp. 193- 204 ,(1970) , 10.1016/0004-3702(70)90007-X
Judea Pearl, Jin H. Kim, Studies in Semi-Admissible Heuristics IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-4, pp. 392- 399 ,(1982) , 10.1109/TPAMI.1982.4767270
Wheeler Ruml, Jordan T. Thayer, Faster than weighted A*: an optimistic approach to bounded suboptimal search international conference on automated planning and scheduling. pp. 355- 362 ,(2008)
Nathan R. Sturtevant, Richard Valenzano, Jonathan Schaeffer, Worst-case solution quality analysis when not re-expanding nodes in best-first search national conference on artificial intelligence. pp. 885- 892 ,(2014)
Ariel Felner, Roni Stern, Daniel Gilon, Dynamic Potential Search — A New Bounded Suboptimal Search annual symposium on combinatorial search. pp. 36- 44 ,(2016)
Ariel Felner, Roni Stern, Vitali Sepetnitsky, Repair Policies for Not Reopening Nodes in Different Search Settings. SOCS. pp. 81- 88 ,(2016)
Nathan R. Sturtevant, Wheeler Ruml, Jingwei Chen, William J. Doyle, Revisiting Suboptimal Search. SOCS. pp. 18- 25 ,(2019)