The Complexity of Planning Revisited - A Parameterized Analysis

08/13/2012
by   Christer Baeckstroem, et al.
0

The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following research in planning in many ways. We go back and reanalyse their subclasses, but this time using the more modern tool of parameterized complexity analysis. This provides new results that together with the old results give a more detailed picture of the complexity landscape. We demonstrate separation results not possible with standard complexity theory, which contributes to explaining why certain cases of planning have seemed simpler in practice than theory has predicted. In particular, we show that certain restrictions of practical interest are tractable in the parameterized sense of the term, and that a simple heuristic is sufficient to make a well-known partial-order planner exploit this fact.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/16/2013

Parameterized Complexity Results for Plan Reuse

Planning is a notoriously difficult computational problem of high worst-...
research
11/02/2012

Parameterized Complexity and Kernel Bounds for Hard Planning Problems

The propositional planning problem is a notoriously difficult computatio...
research
05/10/2022

Exploring Viable Algorithmic Options for Learning from Demonstration (LfD): A Parameterized Complexity Approach

The key to reconciling the polynomial-time intractability of many machin...
research
03/15/2022

Quantum Parameterized Complexity

Parameterized complexity theory was developed in the 1990s to enrich the...
research
11/30/2020

Homology Localization Through the Looking-Glass of Parameterized Complexity Theory

Finding a cycle of lowest weight that represents a homology class in a s...
research
11/11/2022

A parameterized halting problem, Δ_0 truth and the MRDP theorem

We study the parameterized complexity of the problem to decide whether a...
research
02/04/2014

A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond

The causal graph of a planning instance is an important tool for plannin...

Please sign up or login with your details

Forgot password? Click here to reset