A Candidate Set based analysis of Subgoal Interactions in conjunctive goal planning

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages

  Kambhampati, Subbarao ^a   Ihrig, Laurie ^a   Srivastava, Biplav ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; CANDIDATE SETS; INTERACTION ANALYSIS; MULTI METHODS; SERIALIZABILITY; SET-BASED ANALYSIS; SPECIFIC CLASS; SUBGOALS;

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

References (15)

1. A. Barrett and D. Weld. Partial Order Planning: Evaluating Possible Efficiency Gains. Artificial Intelligence, Vol. 67, No. 1, 1994.
2. D. Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333 -377, 1987.
3. R. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. In Readings in Planning. Morgan Kaufmann, 1990.
4. M. Ginsberg. Approximate Planning. ArtificialIntelligence, special issue on Planning and Scheduling. Vol. 76. 1995.
5. L. Ihrig and S. Kambhampati. On the Relative Utility of Plan¬ space vs. State-space planning in a case-based framework A S U C S E T R 94-006; Dec 1994. (Submitted for publication)
6. D. Joslin and J. Roach. A Theoretical Analysis of Conjunc¬ tive Goal Problems. Research Note, Artificial Intelligence, Vol. 41,1989/90.
7. S. Kambhampati and B. Srivastava. Universal Classical Planner: An algorithm for unifying state space and plan space approaches. In Current Trends in AI Planning: EWSP 95, IOS Press, 1995.
8. S. Kambhampati. Refinement search as a unifying frame¬ work for analyzing planning algorithms. In Proc. KR-94, May 1994.
9. S. Kambhampati. Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation. ArtificialIntelli¬ gence, Vol. 69, 1994. pp. 235-278.
10. S. Kambhampati, C. Knoblock and Q. Yang. Planning as Refinement Search: A Unified framework for evaluating design tradeoffs in partial order planning. Artificial Intel¬ ligence special issue on Planning and Scheduling. Vol. 76. 1995.
11. R. Korf. Planning as Search: A Quantitative Approach. Artificial Intelligence, Vol. 33, 1987.
12. D. McAllester and D. Rosenblitt. Systematic Nonlinear Planning. In Proc. 9th AAAI, 1991.
13. S. Minton, J. Bresina and M. Drummond. Total Order and Partial Order Planning: a comparative analysis. Journal of Artificial Intelligence Research 2 (1994) 227-262.
14. M. Veloso and J. Blythe. Linkability: Examining causal link commitments in partial-order planning. Proceedingsof AIPS-94, 1994.
15. Q. Yang, D. Nau and J. Hendler. Merging separately gen¬ erated plans with restricted interactions. Computational Intelligence, 8(2):648-676, February 1992