Abstract
A mathematical model of planning is worked out in this paper. The terms ’planning problem‘, ‘plan’, ’solution of a planning problem’ etc. are often used in the fields of Artificial Intelligence, Decision Support Systems and Operation Research. The meaning of these terms, however, is rather intuitive. This article presents a general concept of planning that covers a wide range of planning problems. The definitions that capture the necessary notions can be viewed as a framework to specify planning problems with. The formalism applied here directly leads to a high level description language. This provides a basis of the knowledge representation shell of systems that deal with planning problems. Examples given in the appendices demonstrate how to describe different ‘planning type‘ tasks with the language extracted from the theory.
Preview
Unable to display preview. Download preview PDF.
Literature
Forbus, K. D., Qualitative Process Theory, Artificial Intelligence 24 (1984) 85–168.
Genesereth, M.R., and Nilsson, N.J., Logical Foundations of Artificial Intelligence, Morgan Kaufman, 1987.
Manna, Z., and Waldinger, R., How to Clear a Block: A Theory of Plans, Journal of Automated Reasoning 3 (1987), 343–377.
Pearl, J., Heuristics, Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984.
Pednault, E.P.D., Formulating Multiagent Dynamic-World Problems in the Classical Planning Framework, in Georgeff, M.P. and Lansky, A. (eds.), Reasonong About Actions and Plans, Morgan Kaufman, 1987.
Wilkins, D.E., Domain Independent Planning: Representation and Plan Generation, Artificial Intelligence 22 (1984), 269–301.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eiben, A.E. (1989). Modeling planning problems. In: Demetrovics, J., Thalheim, B. (eds) MFDBS 89. MFDBS 1989. Lecture Notes in Computer Science, vol 364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51251-9_12
Download citation
DOI: https://doi.org/10.1007/3-540-51251-9_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51251-6
Online ISBN: 978-3-540-46182-1
eBook Packages: Springer Book Archive