Planning as Artificial Intelligence Problem - Short Introduction and Overview

Planning belongs to fundamental AI domains. Examples of planning applications are manufacturing, production planning, logistics and agentics. Over the decades planning techniques were improved and now they are able to capable real environment problems in the presence of uncertain and incomplete information. This article introduces the notion of so called classical planning, indicating connected with this computational complexity problems and possible ways of treating uncertainty.

[1]  Jussi Rintanen,et al.  Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[2]  Jim Blythe,et al.  An Overview of Planning Under Certainty , 1999, Artificial Intelligence Today.

[3]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[4]  George J. Klir,et al.  Fuzzy sets, uncertainty and information , 1988 .

[5]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[6]  Peter Haddawy,et al.  Decision-theoretic Refinement Planning Using Inheritance Abstraction , 1994, AIPS.

[7]  Tom Bylander A Linear Programming Heuristic for Optimal Planning , 1997, AAAI/IAAI.

[8]  Gerd Brewka,et al.  Artificial intelligence - a modern approach by Stuart Russell and Peter Norvig, Prentice Hall. Series in Artificial Intelligence, Englewood Cliffs, NJ , 1996, The Knowledge Engineering Review.

[9]  Nicholas Kushmerick,et al.  An Algorithm for Probabilistic Least-Commitment Planning , 1994, AAAI.

[10]  David E. Smith,et al.  Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.

[11]  Anthony Barrett,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.

[12]  Christer Bäckström Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..

[13]  Randy Goebel,et al.  Computational intelligence - a logical approach , 1998 .

[14]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

[15]  Lenhart K. Schubert,et al.  Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning , 1996, J. Artif. Intell. Res..

[16]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..

[17]  Ingrid Zukerman,et al.  Inductive Learning of Search Control Rules for Planning , 1998, Artif. Intell..

[18]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[19]  Vladik Kreinovich,et al.  Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness , 1999, IJCAI.

[20]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Jörg Hoffmann,et al.  On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm , 2000, J. Artif. Intell. Res..

[22]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..