The Complexity of Action Redundancy

An action is redundant in a planning domain if it is not needed to reach the goal. In this paper, we study the computational complexity of some problems related to the redundancy of actions: checking whether a domain contains a redundant action, what is the minimal number of actions needed to make the goal reachable, checking whether the removal of an action does not increase the minimal plan length, etc.

[1]  Daniel S. Weld,et al.  A Domain-Independent Algorithm for Plan Adaptation , 1994, J. Artif. Intell. Res..

[2]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[3]  Qiang Yang,et al.  ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner , 1990, AAAI.

[4]  Eugene Fink,et al.  Formalizing Plan Justifications , 1992 .

[5]  Robert P. Goldman,et al.  A New Model of Plan Recognition , 1999, UAI.

[6]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection, Planning, and Plan Validation , 1994, Artif. Intell..

[7]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[8]  Subbarao Kambhampati,et al.  On the Utility of Systematicity: Understanding Tradeoffs between Redundancy and Commitment in Partial-ordering Planning , 1993, IJCAI.

[9]  Christer Bäckström,et al.  Planning with Abstraction Hierarchies can be Exponentially Less Efficient , 1995, IJCAI.

[10]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..

[11]  Bernhard Nebel,et al.  On the Computational Complexity of Planning and Story Understanding , 1992, ECAI.

[12]  Daniel S. Weld.  Recent Advances in AI Planning , 1999, AI Mag..

[13]  Christer Bäckström.  Equivalence and Tractability Results for SAS+ Planning , 1992, KR.

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

[15]  Eugene Fink,et al.  A Spectrum of Plan Justifications , 1993, AAAI 1993.

[16]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[17]  Qiang Yang,et al.  Characterizing Abstraction Hierarchies for Planning , 1991, AAAI.

[18]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[19]  Qiang Yang,et al.  The Downward Refinement Property , 1991, IJCAI.

[20]  Paolo Liberatore,et al.  On Non-Conservative Plan Modification , 1998, ECAI.