Planning for conjunctive goals
Artificial Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Tractable planning with state variables by exploiting structural restrictions
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Expressive equivalence of planning formalisms
Artificial Intelligence - Special volume on planning and scheduling
New directions in AI planning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Planning with abstraction hierarchies can be exponentially less efficient
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Structure and complexity in planning with unary operators
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
The complexity of planning problems with simple causal graphs
Journal of Artificial Intelligence Research
New Islands of tractability of cost-optimal planning
Journal of Artificial Intelligence Research
Planning over chain causal graphs for variables with domains of size 5 Is NP-hard
Journal of Artificial Intelligence Research
The role of macros in tractable planning over causal graphs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The role of macros in tractable planning
Journal of Artificial Intelligence Research
An LP-based heuristic for optimal planning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences
Algorithms and limits for compact plan representations
Journal of Artificial Intelligence Research
Computing upper bounds on lengths of transition sequences
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A refined view of causal graphs and component sizes: SP-closed graph classes and beyond
Journal of Artificial Intelligence Research
Limitations of acyclic causal graphs for planning
Artificial Intelligence
Hi-index | 0.00 |
We present a class, 3S, of planning instances such that the plan existence problem is tractable while plan generation is provably intractable for instances of this class. The class is defined by simple structural restrictions, all of them testable in polynomial‐time. Furthermore, we show that plan generation can be carried out in time bounded by a polynomial in the size of the input and the size of the generated solution. For this class, we propose a provably sound and complete incremental planner, i.e., a planner that can usually output an executable prefix of the final plan before it has generated the whole plan.