Parameterized Complexity and Kernel Bounds for Hard Planning Problems

11/02/2012
by   Christer Bäckström, et al.
0

The propositional planning problem is a notoriously difficult computational problem. Downey et al. (1999) initiated the parameterized analysis of planning (with plan length as the parameter) and Bäckström et al. (2012) picked up this line of research and provided an extensive parameterized analysis under various restrictions, leaving open only one stubborn case. We continue this work and provide a full classification. In particular, we show that the case when actions have no preconditions and at most e postconditions is fixed-parameter tractable if e≤ 2 and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; this problem has been shown fixed-parameter tractable by Guo et al. (2007). If a problem is fixed-parameter tractable, then it admits a polynomial-time self-reduction to instances whose input size is bounded by a function of the parameter, called the kernel. For some problems, this function is even polynomial which has desirable computational implications. Recent research in parameterized complexity has focused on classifying fixed-parameter tractable problems on whether they admit polynomial kernels or not. We revisit all the previously obtained restrictions of planning that are fixed-parameter tractable and show that none of them admits a polynomial kernel unless the polynomial hierarchy collapses to its third level.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/13/2011

Kernels for Global Constraints

Bessiere et al. (AAAI'08) showed that several intractable global constra...
research
11/16/2020

The Longest Run Subsequence Problem: Further Complexity Results

Longest Run Subsequence is a problem introduced recently in the context ...
research
03/05/2023

Expansion Lemma – Variations and Applications to Polynomial-Time Preprocessing

In parameterized complexity, it is well-known that a parameterized probl...
research
04/28/2021

Kernelization, Proof Complexity and Social Choice

We display an application of the notions of kernelization and data reduc...
research
09/14/2017

Levelable Sets and the Algebraic Structure of Parameterizations

Asking which sets are fixed-parameter tractable for a given parameteriza...
research
08/13/2012

The Complexity of Planning Revisited - A Parameterized Analysis

The early classifications of the computational complexity of planning un...
research
07/16/2013

Parameterized Complexity Results for Plan Reuse

Planning is a notoriously difficult computational problem of high worst-...

Please sign up or login with your details

Forgot password? Click here to reset