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

06/25/2018
by   Tomas Geffner, et al.
0

Fully observable non-deterministic (FOND) planning is becoming increasingly important as an approach for computing proper policies in probabilistic planning, extended temporal plans in LTL planning, and general plans in generalized planning. In this work, we introduce a SAT encoding for FOND planning that is compact and can produce compact strong cyclic policies. Simple variations of the encodings are also introduced for strong planning and for what we call, dual FOND planning, where some non-deterministic actions are assumed to be fair (e.g., probabilistic) and others unfair (e.g., adversarial). The resulting FOND planners are compared empirically with existing planners over existing and new benchmarks. The notion of "probabilistic interesting problems" is also revisited to yield a more comprehensive picture of the strengths and limitations of current FOND planners and the proposed SAT approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/17/2018

Learning Features and Abstract Actions for Computing Generalized Plans

Generalized planning is concerned with the computation of plans that sol...
research
04/08/2022

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

Fully Observable Non-Deterministic (FOND) planning models uncertainty th...
research
06/18/2021

Classical Planning as QBF without Grounding (extended version)

Most classical planners use grounding as a preprocessing step, reducing ...
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
12/10/2019

Qualitative Numeric Planning: Reductions and Complexity

Qualitative numerical planning is classical planning extended with non-n...
research
01/30/2018

Features, Projections, and Representation Change for Generalized Planning

Generalized planning is concerned with the characterization and computat...
research
01/18/2014

SAS+ Planning as Satisfiability

Planning as satisfiability is a principal approach to planning with many...

Please sign up or login with your details

Forgot password? Click here to reset