A validation-structure-based theory of plan modification and reuse
Artificial Intelligence
On the computational complexity of planning and story understanding
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
On the computational complexity of temporal projection, planning, and plan validation
Artificial Intelligence
Plan reuse versus plan generation: a theoretical and empirical analysis
Artificial Intelligence - Special volume on planning and scheduling
Ignoring Irrelevant Facts and Operators in Plan Generation
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
A domain-independent algorithm for plan adaptation
Journal of Artificial Intelligence Research
STRIPS: a new approach to the application of theorem proving to problem solving
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Complexity results for planning
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The downward refinement property
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Planning with abstraction hierarchies can be exponentially less efficient
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
ABTWEAK: abstracting a nonlinear, least commitment planner
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Characterizing abstraction hierarchies for planning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
A new model of plan recognition
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
| Hi-index | 0.00 |
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.