Qualitative Numeric Planning: Reductions and Complexity

12/10/2019
by   Blai Bonet, et al.
0

Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive random amounts. While deterministic planning with numerical variables is undecidable in general, qualitative numerical planning is decidable and provides a convenient abstract model for generalized planning. Qualitative numerical planning, introduced by Srivastava, Zilberstein, Immerman, and Geffner (2011), showed that solutions to qualitative numerical problems (QNPs) correspond to the strong cyclic solutions of an associated fully observable non-deterministic (FOND) problem that terminate. The approach leads to a generate-and-test algorithm for solving QNPs where solutions to a FOND problem are generated one by one and tested for termination. The computational shortcomings of this approach, however, are that it is not simple to amend FOND planners to generate all solutions, and that the number of solutions to check can be doubly exponential in the number of variables. In this work we address these limitations, while providing additional insights on QNPs. More precisely, we introduce two reductions, one from QNPs to FOND problems and the other from FOND problems to QNPs both of which do not involve termination tests. A result of these reductions is that QNPs are shown to have the same expressive power and the same complexity as FOND problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/26/2019

Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints

We study the characterization and computation of general policies for fa...
research
06/25/2018

Compact Policies for Fully-Observable Non-Deterministic Planning as SAT

Fully observable non-deterministic (FOND) planning is becoming increasin...
research
09/23/2021

Safe-Planner: A Single-Outcome Replanner for Computing Strong Cyclic Policies in Fully Observable Non-Deterministic Domains

Replanners are efficient methods for solving non-deterministic planning ...
research
06/29/2022

Representation and Synthesis of C++ Programs for Generalized Planning

The paper introduces a novel representation for Generalized Planning (GP...
research
04/08/2022

Iterative Depth-First Search for Fully Observable Non-Deterministic Planning

Fully Observable Non-Deterministic (FOND) planning models uncertainty th...
research
05/09/2012

Deterministic POMDPs Revisited

We study a subclass of POMDPs, called Deterministic POMDPs, that is char...
research
11/17/2017

Complexity Results and Fast Methods for Optimal Tabletop Rearrangement with Overhand Grasps

This paper studies the underlying combinatorial structure of a class of ...

Please sign up or login with your details

Forgot password? Click here to reset