Planning for conjunctive goals
Artificial Intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Automatically generating abstractions for planning
Artificial Intelligence
Factored planning: how, when, and when not
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Domain-independent construction of pattern database heuristics for cost-optimal planning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Fast planning by search in domain transition graph
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
A reactive planner for a model-based executive
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical 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
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
The role of macros in tractable planning
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
Hi-index | 0.00 |
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is of interest because k is a constant for all but a few of the current benchmark domains in planning, and is known to have implications for tractability. In this paper, we present an algorithm for solving planning problems in P(k), the class of k-dependent planning problems with binary variables and polytree causal graphs. We prove that our algorithm runs in polynomial time when k is a fixed constant. If, in addition, the causal graph has bounded depth, we show that plan generation is linear in the size of the input. Although these contributions are theoretical due to the limited scope of the class P(k), suitable reductions from more complex planning problems to P(k) could potentially give rise to fast domain-independent heuristics.