RealPlan: Decoupling Causal and Resource Reasoning in Planning

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 812-818

  Srivastava, Biplav ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; RESOURCE ALLOCATION;

BACKTRACK FREE; CAUSAL REASONING; CONSTRAINT-SATISFACTION PROBLEMS; DECOUPLINGS; DYNAMIC CONSTRAINT SATISFACTIONS; GRAPHPLAN; PERFORMANCE; RESOURCE ALLOCATION PROBLEM; RESOURCE MANAGEMENT; RESOURCE REASONING;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (22)

1. Beck, J.C., and Fox, M. 1998. A Generic Framework for Constraint-directed Search and Scheduling. AI Magazine 19(4).
2. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. Proc IJCAI-95 1636-1642.
3. Cesta, A. and Cristiano, S. 1996. A Time and Resource Problem in Planning Architectures. Proc. ECP-96.
4. Currie, K. and Tate, A. 1991. O-Plan: the open planning architecture. AI, Vol 52, 49-86.
5. Do, B., and Kambhampati, S. 1999. Solving planning graph by compiling it into CSP To Appear in AIPS 2000.
6. El-Kholy, A. and Richards, B. 1996. Temporal and Resource Reasoning in Planning: the parcPlan approach. Proc. ECAI-96.
7. S. Kambhampati, M.R. Cutkoksy, J.M. Tenenbaum and S. Lee. Integrating General Purpose Planners and Specialized Reasoners: Case Study of a Hybrid Planning Architecture. IEEE Trans. on Sys., Man and Cyber., Vol. 23, No. 6, Nov/Dec, 1993.
8. Kautz, H., and Selman, B. 1998. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. Workshop Planning as Combinatorial Search, AIPS-98, Pittsburgh, PA, 1998.
9. Laborie, P., and Ghallab, M. 1995. Planning with sharable resource constraints. Proc. IJCAI-95.
10. Liatsos, V. and Richards, B. 1999. Scaleability in Planning. Proc. ECP-99.
11. Microsoft. 1998. Microsoft Project Version 4.0 User Guide. Microsoft Press.
12. Moder, J. J., and Phillips, C. R. 1964. Project Management with CPM and PERT. Reinhold Publ., Chapman & Hall Ltd., London.
13. Mittal, S., and Falkenhainer, B. 1990. Dynamic Constraint Satisfaction Problems. Proc. AAAI-90.
14. Muscettola, N. 1994. Toward real-world science mission planning. Proc. AAAI Fall Symposium.
15. Pinedo, M. 1995. Scheduling Theory, Algorithms and Systems. Prentice Hall.
16. Srivastava, B. March 2000. Efficient Planning by Effective Resource Reasoning. Ph.D. Dissertation. Arizona State Univ., USA.
17. Srivastava, B., and Kambhampati, S. 1999. Scaling up Planning by teasing out Resource Scheduling Proc. ECP-99.
18. Srivastava, B, Kambhampati, S. and Do, B. 2000. Planning the Project Management Way: Efficient Planning by Effective Integration of Causal and Resource Reasoning. Technical Report. Arizona State Univ., USA.
19. van Beek, P., and Chen, X. 1999 CPlan: A constraint programming approach to planning Proc. AAAI-99.
20. Wolfman, S., and Weld, D. 1999. The LPSAT Engine and its Application to Resource Planning. Proc. IJCAI-99.
21. Wilkins, D. E. 1988. Practical planning: Extending the classical AI planning paradigm. Morgan Kaufmann Pub., San Mateo, CA.
22. Zweben, M., and Fox, M. (ed.). 1994. Intelligent Scheduling. Morgan Kaufmann Publ., San Mateo, CA.