Parameterized Complexity Results for Plan Reuse

07/16/2013
by   Ronald de Haan, et al.
0

Planning is a notoriously difficult computational problem of high worst-case complexity. Researchers have been investing significant efforts to develop heuristics or restrictions to make planning practically feasible. Case-based planning is a heuristic approach where one tries to reuse previous experience when solving similar problems in order to avoid some of the planning effort. Plan reuse may offer an interesting alternative to plan generation in some settings. We provide theoretical results that identify situations in which plan reuse is provably tractable. We perform our analysis in the framework of parameterized complexity, which supports a rigorous worst-case complexity analysis that takes structural properties of the input into account in terms of parameters. A central notion of parameterized complexity is fixed-parameter tractability which extends the classical notion of polynomial-time tractability by utilizing the effect of structural properties of the problem input. We draw a detailed map of the parameterized complexity landscape of several variants of problems that arise in the context of case-based planning. In particular, we consider the problem of reusing an existing plan, imposing various restrictions in terms of parameters, such as the number of steps that can be added to the existing plan to turn it into a solution of the planning instance at hand.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2013

Case-Based Merging Techniques in OAKPLAN

Case-based planning can take advantage of former problem-solving experie...
research
08/13/2012

The Complexity of Planning Revisited - A Parameterized Analysis

The early classifications of the computational complexity of planning un...
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
04/30/2018

Fundamentals of Parameterized Complexity Revisited

What is a parameterized algorithm? What is a parameterized problem and w...
research
06/26/2011

Structure and Complexity in Planning with Unary Operators

Unary operator domains -- i.e., domains in which operators have a single...
research
09/29/2011

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

In a field of research about general reasoning mechanisms, it is essenti...

Please sign up or login with your details

Forgot password? Click here to reset