Friends or foes? An AI planning perspective on abstraction and search

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 294-303

  Hoffmann, Jörg ^a   Sabharwal, Ashish ^b   Domshlak, Carmel ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; STATE SPACE METHODS;

BLIND SEARCHES; INFORMED SEARCHES; MODEL CHECKING; OVER-APPROXIMATION;

ARTIFICIAL INTELLIGENCE;

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

References (21)

1. Beame, P.; Kautz, H.; and Sabharwal, A. 2004. Towards understanding and harnessing the potential of clause learning. JAIR 22:319-351.
2. Biere, A.; Cimatti, A.; Clarke, H.; and Zhu, Y. 1999. Symbolic model checking without BDDs. In Proc. TACAS'99, 193-207.
3. Blum, A., and Furst, M. 1997. Fast planning through planning graph analysis. AIJ 90(1-2):279-298.
4. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
5. Clarke, E.; Grumberg, O.; and Peled, D. 1999, Model Checking. MIT Press.
6. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
7. Edelkamp, S., and Helmert, M. 1999. Exhibiting knowledge in planning problems to minimize stale encoding length. In Proc. ECP'99, 135-147.
8. Edelkamp, S. 2001. Planning with pattern databases. In Proc. ECP'0I, 13-24.
9. Edelkamp, S. 2003. Promela planning. In Proc: SPIN'03, 197-212.
10. Gupta, A., and Strichman, O. 2005. Abstraction refinement for bounded model checking. In Proc. CAV'05, 112-124.
11. Haken, A. 1985. The intractability of resolution. TCS 39:297-308.
12. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. AIPS'00, 140-149.
13. Hernadvölgyi, I., and Holte, R. 1999. PSVN: A vector representation for production systems. Technical Report 1999-07, University of Ottawa.
14. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
15. Hoffmann, J.; Sabharwal, A.; and Domshlak, C. 2006. Friends or foes? An Al planning perspective on abstraction and search. Technical Report. Available at http://www.mpisb.mpg.de/~hoffmann/tr-icaps06a.ps.gz.
16. Hoffmann, J. 2005. Where ignoring delete lists works: Local search topology in planning benchmarks. JAIR. To appear.
17. Kautz, H., and Selman, B. 1999. Unifying SAT-based and graph-based planning. In Proc. UCA1'99, 318-325.
18. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. In Proc. ECP'97, 273-285.
19. McDermott, D. 1999. Using regression-match graphs to control search in planning. AIJ 109(1-2):111-159.
20. Nebel, B.; Dimopoulos, Y.; and Koehler, J. 1997. Ignoring irrelevant facts and operators in plan generation. In Proc. ECP'97, 338-350.
21. Sacerdoti, E. 1973. Planning in a hierarchy of abstraction spaces. In Proc. IJCAI'73.