Computing Parameter Domains as an Aid to Planning

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

Volumn , Issue , 1996, Pages 94-101

  Gerevini, Alfonso ^a   Schubert, Lenhart ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b University of Rochester   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETER ESTIMATION;

COMPUTING PARAMETERS; CONDITION; DOMAIN CONSTRAINT; FORWARD PROPAGATION; INITIAL CONDITIONS; PLANNING OPERATORS; PLANNING PARAMETERS; PLANNING PROCESS; POLYNOMIAL-TIME ALGORITHMS; SPEED UP;

POLYNOMIAL APPROXIMATION;

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

References (16)

1. Allen, J., and Schubert, L. 1991. The TRAINS project. Tech. Rep. 382, Dept. of Computer Science, Univ. of Rochester, Rochester, NY.
2. Allen, J.; Schubert, L.; Ferguson, G.; Heeman, P.; Hwang, C; Kato, T.; Light, M.; Martin, N.; Miller, B.; Poesio, M.; and Traum, B. 1995. The TRAINS project: A case study in building a conversational planning agent. Experimental and Theoretical Artificial Intelligence 7:7-48.
3. Barrett, A.; Golden, K.; Penberthy, S.; and Weld, D. 1994. UCPOP user's manual. Tech. Rep. 93¬ 09-06, Dept. of Computer Science and Engineering, University of Washington, Seattle, WA 98105.
4. Blum, A., and Fürst, M.L. 1995. Fast planning through planning graph analysis. In Proc. of the lĄth Int. Joint Conf. on Artificial Intelligence (IJCAI-95), 1636-1642, Montreal, CA: Morgan Kaufmeuin.
5. Chapman, D. 1987. Planning for conjunctive goals. Artificial Intelligence 32(3):333-377.
6. Currie, K., and Tate, A. 1991. 0-Plan: The open planning architecture. Artificial Intelligence, 51(1).
7. Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2:189-208.
8. Gerevini, A., and Schubert, L. 1996. Computing parameter domains as an Eiid to planning. To appear as Dept. of Computer Science Tech. Rep., University of Rochester, Rochester, NY 14627-0226.
9. Georgeff, M., and Lansky, A. 1987. Reactive reasoning and planning. In Proc. of the 6th Nat. Conf. of the Am. Assoc. for Artificial Intelligence(AAAI-87), 677-682. Seattle, WA: Morgan Kaufmann.
10. Goldszmidt M.; Darwiche, A.; Chavez, T.; Smith, D.; and White, J. 1994. Decision-theory for crisis management. Tech. Rep. RL-TR-94-235, Rome Laboratory.
11. Joshn, D., and Pollack, M. 1994. Least-cost flaw repair: a plan refinement strategj' for partial-order planning. In Proc. of the 12th Nat. Conf. of the Am. Assoc. for Artificial Intelligence (AAAI-94), 1004¬ 1009. Seattle, WA: Morgan Kaufmann.
12. McAUester, D., and RosenbUtt, D. 1991. Systematic nonlinear planning. In Proc. of the 9th Nat. Conf on Artificial Intelligence (AAAI-91), 634-639. Auheim, Los Angeles, CA: Morgan Kaufmann.
13. Penberthy, J., and Weld, D. 1992. U C P O P: A sound, complete, partial order planner for A D L. In Nebel, B.; Rich, C; and Swartout, W., eds., Proc. of the 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning (KR92), 103-114. Boston, MA: Morgan Kaufmann.
14. Schubert, L., and Gerevini, A. 1995. Accelerating partial order planners by improving plan and goal choices. In Proc. of the 7th IEEE Int. Conf on Tools with Artificial Intelligence, 442-50. Herndon, Virginia: IEEE Computer Society Press.
15. Weld, D. 1994. An introduction to least commitment planning. AI Magazine 15(4):27-62.
16. Wilkins, D. 1988. Practical Planning: Extending the Classical AI Planning Paradigm. San Mateo, CA: Morgan Kaufmann.