Flexible abstraction heuristics for optimal sequential planning

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 176-183

  Helmert, Malte ^a   Haslum, Patrik ^b   Hoffmann, Jörg ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; OPTIMIZATION; SCHEDULING;

AUTOMATED PLANNING; BENCHMARK DOMAINS; EMPIRICAL EXPERIMENTS; INTERLEAVINGS; OPTIMAL SEQUENTIAL; OPTIMAL SOLUTIONS; PATTERN DATABASE; POLYNOMIAL-TIME; STATE-SPACE; STATE-VARIABLES;

POLYNOMIAL APPROXIMATION;

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

References (14)

1. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1):5-33.
2. Culberson, J. C., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Drager, K.; Finkbeiner, B.; and Podelski, A. 2006. Directed model checking with distance-preserving abstractions. In Proc. SPIN-2006, 19-34.
4. Edelkamp, S. 2001. Planning with pattern databases. In Proc. ECP 2001, 13-24.
5. Edelkamp, S. 2005. External symbolic heuristic search with pattern databases. In Proc. ICAPS 2005, 51-60.
6. Edelkamp, S. 2006. Automated creation of pattern database search heuristics. In Proc. MoChArt-2006, 121-135.
7. Grandcolas, S., and Pain-Barre, C. 2007. Filtering, decomposition and search space reduction for optimal sequential planning. In Proc. AAAI 2007.
8. 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. AAAI 2007, 1007-1012.
9. Helmert, M. 2006a. The Fast Downward planning system. JAIR 26:191-246.
10. Helmert, M. 2006b. Solving Planning Tasks in Theory and Practice. Ph.D. Dissertation, Albert-Ludwigs-Universitat Freiburg.
11. Hoffmann, J.; Sabharwal, A.; and Domshlak, C. 2006. Friends or foes? An AI planning perspective on abstraction and search. In Proc. ICAPS 2006, 294-303.
12. Kautz, H.; Selman, B.; and Hoffmann, J. 2006. Satplan: Planning as satisfiability. In IPCS planner abstracts.
13. Vidal, V., and Geffner, H. 2006. Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170(3):298-335.
14. Zhou, R., and Hansen, E. A. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.