Anytime focal search with applications
作者： Liron Cohen , Matias Greco , Hang Ma , Carlos Hernandez , Ariel Felner
关键词: Computer science
摘要:
ijcai.org
unab.cl
sci-hub.st 参考文章(16)
Arthur Huang, Jur van den Berg, Rajat Shah, Kenneth Y. Goldberg, Anytime Nonparametric A national conference on artificial intelligence. ,(2011)
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
Maxim Likhachev, Sebastian Thrun, Geoff Gordon, Search-based planning for large dynamic environments Carnegie Mellon University. ,(2005)
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)
Malte Helmert, Gabriele Röger, How good is almost perfect national conference on artificial intelligence. pp. 944- 949 ,(2008)
Wheeler Ruml, Jordan Tyler Thayer, Anytime Heuristic Search: Frameworks and Algorithms annual symposium on combinatorial search. ,(2010)
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
Mohammad H. Shaelaie, Majid Salari, Zahra Naji-Azimi, The generalized covering traveling salesman problem soft computing. ,vol. 24, pp. 867- 878 ,(2014) , 10.1016/J.ASOC.2014.08.057
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)