Generalizing graphplan by formulating planning as a CSP

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 954-960

  Lopez, Adriana ^a   Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL STRUCTURES; GRAPHPLAN; OPTIMIZED PLANNING; PLANNING GRAPHS; PLANNING PROBLEM; PROTOTYPE IMPLEMENTATIONS;

CONSTRAINT SATISFACTION PROBLEMS; ENCODING (SYMBOLS);

PROBLEM SOLVING;

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

References (19)

1. Fahiem Bacchus and Michael Ady. Planning with resources and concurrency, a forward chaining approach. In IJCAI-2001, pages 417-424.
2. Fahiem Bacchus. Extending forward checking. In CP2000, number 1894 in LNCS, pages 35-51. Springer-Verlag.
3. Avrim Blum and Merrick Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90:281 300, 1997.
4. Minh Binh Do and Subbarao Kambhampati. Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2):151-182, 2001.
5. Stefan Edelkamp. Mixed propositional and numerical planning in the model checking integrated planning system. In AIPS-2002, Workshop on Temporal Planning, 2002.
6. E. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32(4):755-761, 1985.
7. L. Getoor, G. Ottosson, M. Fromherz, and B. Carlson. Effective redundant constraints for online scheduling. In AAAI-1997, pages 302 307.
8. George Katsirelos and Fahiem Bacchus. A library for solving CSPs, 2001. www.cs.toronto.eduTgkatsi/efc.tar.gz.
9. Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic, and stochastic search. In AAAI-1996, pages 1194 1201.
10. H. Kautz and B. Selman. Blackbox: A new approach to the application of theorem proving to problem solving. Workshop on Planning as Combinatorial Search, AIPS-1998.
11. J. Kochler, B. Ncbcl, J. Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In European Conference on Planning, pages 273-285, 1997.
12. J. Kochler. Planning under resource constraints. In ECAI-1998, pages 489-493.
13. J. Koehler. Solving complex planning tasks through extraction of subproblems. In AIPS-1998, pages 62-69.
14. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient sat solver. In Proc. of the Design Automation Conference (DAC), 2001.
15. E. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In KR-1989, pages 324-332.
16. F. Pirri and R. Reiter. Planning with natural actions in the situation calculus. In Jack Minker, editor, Logic-Based Artificial Intelligence. Kluwer Press, 2000. in press.
17. R. Reiter. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, 2001.
18. P. van Beek and X. Chen. CPlan: A constraint programming approach to planning. In A A AI-1999, pages 585-590.
19. T. Vossen, M. Ball, A. Lotem, and D. Nau. Applying integer programming to AI planning. Knowledge Engineering Review, 16:85 100, 2001.