Parameterized complexity of optimal planning: a detailed map

Authors:
Martin Kronegger;Andreas Pfandler;Reinhard Pichler
Affiliations:
Vienna University of Technology, Austria;Vienna University of Technology, Austria;Vienna University of Technology, Austria
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 9
Cited 0

Planning in polynomial time: the SAS-PUBS class

Computational Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
Describing parameterized complexity classes

Information and Computation
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Factored planning: how, when, and when not

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
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
Causal graphs and structurally restricted planning

Journal of Computer and System Sciences
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The goal of this paper is a systematic parameterized complexity analysis of different variants of propositional STRIPS planning. We identify several natural problem parameters and study all possible combinations of 9 parameters in 6 different settings. These settings arise, for instance, from the distinction if negative effects of actions are allowed or not. We provide a complete picture by establishing for each case either paraNP-hardness (i.e., the parameter combination does not help) or W[t]-completeness with t ∈ {1, 2} (i.e., fixed-parameter intractability), or FPT (i.e., fixed-parameter tractability).