Functional Strips: a More Flexible Language for Planning and Problem Solving

EEective planning requires good modeling languages and good algorithms. The Strips language has shaped most of the work in planning since the early 70's due to its eeective solution of the frame problem and its support for divide-and-conquer strategies. In recent years, however, planning strategies not based on divide-and-conquer and work on theories of actions suggest that alternative languages can make modeling and planning easier. With this goal in mind, we have developed Functional Strips, a language that adds rst-class function symbols to Strips providing additional exibility in the codiication of planning problems. This extension is orthogonal and complementary to extensions accommodated in other languages such as conditional eeects, quantiication, negation, etc. Function symbols, unlike relational symbols, can be nested so objects need not be referred to by their explicit names and as a result more eecient encodings can be provided. For example, a problem like the 8-puzzle can be codiied in terms of four actions with no arguments; Hanoi, can be codiied with a number of ground actions independent of the number of disks; resources and constraints can be easily represented, etc. Functional Strips is both an action and a planning language in the sense that actions are understood declaratively in terms of a state-based semantics and operationally in terms of eecient updates on state representations. In this paper, we present the language, the semantics and a number of examples, and discuss possible uses in planning and problem solving.

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

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

[3]  Vladimir Lifschitz,et al.  ON THE SEMANTICS OF STRIPS , 1987 .

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

[5]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[6]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[7]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[8]  Manuela Veloso Learning by analogical reasoning in general problem-solving , 1992 .

[9]  Michael Gelfond,et al.  Representing Action and Change by Logic Programs , 1993, J. Log. Program..

[10]  Daniel S. Weld,et al.  Planning with Continous Changes , 1994 .

[11]  Erik Sandewall Features and fluents : representation of knowledge about dynamical systems , 1994 .

[12]  Christer Bäckström,et al.  Tractable Planning with State Variables by Exploiting Structural Restrictions , 1994, AAAI.

[13]  Eugene C. Freuder,et al.  Constraint satisfaction using constraint logic programming , 1994 .

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

[15]  Malik Ghallab,et al.  Planning with Sharable Resource Constraints , 1995, IJCAI.

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

[17]  A. El-Kholy,et al.  Temporal and Resource Reasoning in Planning: the parcPLAN approach , 1996, ECAI.

[18]  Enrico Giunchiglia,et al.  Representing Action: Indeterminacy and Ramifications , 1997, Artif. Intell..

[19]  M. Shanahan Solving the frame problem , 1997 .

[20]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[21]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[22]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

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

[24]  David E. Smith,et al.  Conditional Effects in Graphplan , 1998, AIPS.

[25]  David E. Smith,et al.  Conformant Graphplan , 1998, AAAI/IAAI.

[26]  Jana Koehler,et al.  Planning under Resource Constraints , 1998, ECAI.

[27]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[28]  Peter J. Stuckey,et al.  Programming with Constraints: An Introduction , 1998 .

[29]  D. Long,et al.  E cient Implementation of the Plan Graph in STAN , 1999 .

[30]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[31]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[32]  Roni Khardon,et al.  Learning Action Strategies for Planning Domains , 1999, Artif. Intell..

[33]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

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

[35]  Bernhard Nebel,et al.  On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..

[36]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[37]  Blai Bonet High-Level Planning and Control with Incomplete Information Using POMDPs Hdctor Geffner and , 2003 .