Bounded suboptimal search: A direct approach using inadmissible estimates

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 674-679

  Thayer, Jordan T ^a   Ruml, Wheeler ^a  

^a Univ of New Hampshire   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; COST BOUNDS; DIRECT APPROACH; EMPIRICAL EVALUATIONS; NEW APPROACHES; SEARCH ALGORITHMS; STATE OF THE ART; SUBOPTIMALITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COST ESTIMATING; ESTIMATION; OPTIMIZATION;

COST BENEFIT ANALYSIS;

EID: 84866462669     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-119     Document Type: Conference Paper

References (13)

1. ε: An efficient near admissible heuristic search algorithm. In Proceedings of IJCAI-83, 1983.
2. Malik Ghallab, Dana Nau, and Paolo Traverso. Automated Planning: Theory and Practice. Morgan Kaufmann, San Francisco, CA, 2004.
3. Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics, SSC-4(2):100-107, July 1968.
4. Richard E. Korf. Iterative-deepening-A*: An optimal admissible tree search. In Proceedings of IJCAI-85, pages 1034-1036, 1985.
5. Maxim Likhachev, Geoff Gordon, and Sebastian Thrun. ARA*: Anytime A*with provable bounds on sub-optimality. In Proceedings of NIPS-03, 2003.
6. Judea Pearl and Jin H. Kim. Studies in semiadmissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-4(4):391-399, July 1982.
7. Ira Pohl. Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1:193-204, 1970.
8. Ira Pohl. The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computation issues in heuristic problem solving. In Proceedings of IJCAI-73, pages 12-17, 1973.
9. Stuart Russell and Peteer Norvig. Artificial Intelligence: A Modern Approach . Third edition, 2010.
10. Jordan T. Thayer and Wheeler Ruml. Faster than weighted A*: An optimistic approach to bounded suboptimal search. In Proceedings of ICAPS-08, 2008.
11. Jordan T. Thayer andWheeler Ruml. Using distance estimates in heuristic search. In Proceedings of ICAPS-09, 2009.
12. Jordan T. Thayer and Wheeler Ruml. Learning inadmissible heuristics during search. In Proceedings of ICAPS-11, 2011.
13. Jordan T. Thayer, Wheeler Ruml, and Jeff Kreis. Using distance estimates in heuristic search: A re-evaluation. In Symposium on Combinatorial Search, 2009.