Declarative Formalization of Strategies for Action Selection: Applications to Planning

We present a representation scheme for the declarative formalization of strategies for action selection based on the situation calculus and circumscription. The formalism is applied to represent a number of heuristics for moving blocks in order to solve planning problems in the blocks world. The formal model of a heuristic forward chaining planner, which can take advantage of declarative formalizations of strategies for action selection, is proposed. Experiments showing how the use of declarative representations of strategies for action selection allows a heuristic forward chaining planner to improve the performance of state of the art planning systems are described.

[1]  John McCarthy,et al.  SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTI CIAL INTELLIGENCE , 1987 .

[2]  Vladimir Lifschitz,et al.  Nested Abnormality Theories , 1995, Artif. Intell..

[3]  Vladimir Lifschitz,et al.  Frames in the Space of Situations , 1990, Artif. Intell..

[4]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[5]  Bernhard Nebel,et al.  Extending Planning Graphs to an ADL Subset , 1997, ECP.

[6]  Henry A. Kautz,et al.  BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving , 1998 .

[7]  Hector J. Levesque,et al.  GOLOG: A Logic Programming Language for Dynamic Domains , 1997, J. Log. Program..

[8]  Raymond Reiter,et al.  Open World Planning in the Situation Calculus , 2000, AAAI/IAAI.

[9]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

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

[11]  Dov M. Gabbay,et al.  Nonmonotonic reasoning and uncertain reasoning , 1994 .

[12]  Raymond Reiter,et al.  Proving Properties of States in the Situation Calculus , 1993, Artif. Intell..

[13]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[14]  Allen Newell,et al.  SOAR: An Architecture for General Intelligence , 1987, Artif. Intell..

[15]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[16]  Paul Morris,et al.  Don't Be Stupid , 1981, IJCAI.

[17]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[18]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[19]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

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

[21]  Josefina Sierra-Santibáñez,et al.  A Declarative Formalization of STRIPS , 1998, ECAI.

[22]  John McCarthy,et al.  Programs with common sense , 1960 .

[23]  Bart Selman,et al.  Control Knowledge in Planning: Benefits and Tradeoffs , 1999, AAAI/IAAI.