Proceedings

Generalizing Nonlinear Planning to Handle Complex Goals and Actions with Context-Dependent Effects

Download BibTeX Cite

Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 240-244.

© 1991 International Joint Conferences on Artificial Intelligence

Abstract

This paper presents a general, mathematically rigorous approach to nonlinear planning that handles both complex goals and actions with context-dependent effects. A goal can be any arbitrary well-formed formula containing conjunctions, disjunctions, negations, and quantifiers. Actions are likewise not constrained and can have an unrestricted number of complex, situation-dependent effects. The approach presented here can thus be used to solve a wider range of problems than previous approaches to nonlinear planning. The approach is based on previous work by the author on linear planning. The same mathematical framework is used with the results extended to nonlinear plans.

  1. Chapman, D. (1985). Planning for Conjunctive Goals. Technical Report 802, M.I.T. AI Lab.
  2. Chapman, D. (1987). "Planning for Conjunctive Goals." Artificial Intelligence. 32: 333-377.
  3. Christensen, J. (1990a). Automatic Abstraction in Planning. Ph.D. Thesis, Computer Science Department, Stanford University, Stanford, California
  4. Christensen, J. (1990b). "A Heirarchical Planner that Generates its Own Hierarchies." Proc. AAA/-90, Boston, Massachusetts, pp 1004-1009.
  5. Fikes, R. E. and N. J. Nilsson. (1971). "STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving." Artificial Intelligence. 2: 189-208. IJCAI
  6. McAllester, D. and D. Rosenblitt. (1991). "Systematic Nonlinear Planning." Proc. AAA/-91 (submitted),
  7. McDermott, D. (1991). "Regression Planning." International Journal of Intelligent Systems. : (in press).
  8. Pednault, E. P. D. (1985). Preliminary Report on A Theory of Plan Synthesis. Technical Report 358, AI center, SRI International, Menlo Park, California.
  9. Pednault, E. P. D. (1986). Toward a Mathematical Theory of Plan Synthesis. PHD Thesis, Dept. of Electrical Engineering, Stanford University, Stanford Ca.
  10. Pednault, E. P. D. (1987). "Formulating Multiagent, Dynamic-World Problems in the Classical Planning Framework." InReasoning About Actions and Plans: Proceedings of the 1986 Workshop, M.P. Georgeff and A. L. Lansky (ed). Los Altos, Ca., Morgan Kaufmann.
  11. Pednault, E. P. D. (1988). "Synthesizing Plans that Contain Actions with Context-Dependent Effects." Computational Intelligence. 4(4): 356-372.
  12. Pednault, E. P. D. (1989). "ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus." Proc. KR'89, Toronto, Canada, pp 324.
  13. Pednault, E. P. D. (forthcoming). "Generalizing Nonlinear Planning."
  14. Tate, A. (1977). "Generating Project Networks." Proc. /JCAI-77, Massachusetts Institute of Technology, Cambridge, Mass, pp 888-893. IJCAI
  15. Waldinger, R. (1977). "Achieving Several Goals Simultaneously." InMachine Intelligence 8, E. Elcock and D. Michie (ed). Edinburgh, Scotland, Ellis Horwood.
  16. Yang, Q. and J. D. Tenenberg. (1990). "ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner." Proc. AAA/-90, Boston, Massachusetts, pp 204-209.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards