Accuracy of admissible heuristic functions in selected planning domains

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 938-943

  Helmert, Malte ^a   Mattmiiller, Robert ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVES; ARTIFICIAL INTELLIGENCE; COST BENEFIT ANALYSIS; COST ESTIMATING; DATABASE SYSTEMS;

ADDITIVE PATTERN DATABASE HEURISTICS; BENCHMARK DOMAINS; DOMAIN INDEPENDENTS; DOMAIN-INDEPENDENT PLANNING; HEURISTIC FUNCTIONS; HEURISTIC PLANNING; HEURISTIC SEARCH; OPTIMAL PLANNING ALGORITHMS;

HEURISTIC ALGORITHMS;

EID: 57749169920     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Bacchus, F. 2001. The AIPS'00 planning competition. AI Magazine 22(3):47-56.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1):5-33.
3. Bylander, T. 1994. The computational complexity of prepositional STRIPS planning. AIJ 69(1-2):165-204.
4. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
5. Edelkamp, S., and Helmert, M. 2001. The model checking integrated planning system (MIPS). AI Magazine 22(3):67-71.
6. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. AIPS 2000, 140-149.
7. Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. AAAI2007, 1007-1012.
8. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proc. AAAI 2005, 1163-1168.
9. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In Proc. ICAPS 2007, 176-183.
10. Helmert, M. 2008. Understanding Planning Tasks - Domain Complexity and Heuristic Decomposition, volume 4929 of LNAI. Springer-Verlag.
11. Hoffmann, J., and Edelkamp, S. 2005. The deterministic part of IPC-4: An overview. JAIR 24:519-579.
12. Hoffmann, J. 2005. Where 'ignoring delete lists' works:
13. Local search topology in planning benchmarks. JAIR 24:685-758.
14. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proc. AAAI-96, 1194-1201.
15. Kautz, H., and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proc. IJCAI-99, 318-325. Long, D., and Fox, M. 2003. The 3rd International Planning Competition: Results and analysis. JAIR 20:1-59.
16. McDermott, D. 1996. A heuristic estimator for means-ends analysis in planning. In Proc. AIPS 1996, 142-149.
17. McDermott, D. 2000. The 1998 Al Planning Systems competition. Al Magazine 21(2):35-55.