Synthesizing plans that contain actions with context‐dependent effects 1

This paper presents a method of solving planning problems that involve actions whose effects change according to the situations in which they are performed. The approach is an extension of the conventional planning methodology in which plans are constructed through an iterative process of scanning for goals that are not yet satisfied, inserting actions to achieve them, and introducing subgoals to these actions. This methodology was originally developed under the assumption that one would be dealing exclusively with actions that produce the same effects in every situation. The extension involves introducing additional subgoals to actions above and beyond the preconditions of execution normally introduced. These additional subgoals, called secondary preconditions, ensure that the actions are performed in contexts conducive to producing the effects we desire. This paper defines and analyzes secondary preconditions from a mathematically rigorous standpoint and demonstrates how they can be derived from regression operators.

[1]  P. Hayes.  The frame problem and related problems in artificial intelligence , 1971 .

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

[3]  Gerald J. Sussman,et al.  A Computational Model of Skill Acquisition , 1973 .

[4]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[5]  Laurent Siklóssy,et al.  An Efficient Robot Planner which Generates Its Own Procedures , 1973, IJCAI.

[6]  Earl D. Sacerdott.  Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

[7]  Scott E. Fahlman,et al.  A Planning System for Robot Construction Tasks , 1973, Artif. Intell..

[8]  Austin Tate,et al.  Interacting Goals And Their Use , 1975, IJCAI.

[9]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[10]  David H. D. Warren,et al.  Generating Conditional Plans and Programs , 1976, AISB.

[11]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[12]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[13]  David Harel,et al.  First-Order Dynamic Logic , 1979, Lecture Notes in Computer Science.

[14]  Barbara Hayes-Roth,et al.  A Cognitive Model of Planning , 1979, Cogn. Sci..

[15]  Dirk van Dalen,et al.  Logic and structure , 1980 .

[16]  Stanley J. Rosenschein,et al.  Plan Synthesis: A Logical Perspective , 1981, IJCAI.

[17]  Mark Stefik,et al.  Planning with Constraints (MOLGEN: Part 1) , 1981, Artif. Intell..

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

[19]  Steven A. Vere,et al.  Planning in Time: Windows and Durations for Activities and Goals , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

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

[22]  Frank Markham Brown.  The Frame Problem in Artificial Intelligence: Proceedings of the 1987 Workshop April 12-15, 1987 Lawrence, Kansas , 1987 .

[23]  Edwin P. D. Pednault,et al.  FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .

[24]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[25]  Reid G. Simmons,et al.  Generate, Test and Debug: Combining Associational Rules and Causal Models , 1987, IJCAI.

[26]  Mark S. Boddy,et al.  Incremental Causal Reasoning , 1987, AAAI.

[27]  E. Pednault.  Toward a mathematical theory of plan synthesis , 1987 .

[28]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[29]  AMY L. LANSKY,et al.  Localized event‐based reasoning for multiagent domain 1 , 1988, Comput. Intell..