Cost Sensitive Reachability Heuristics for Handling State Uncertainty

07/04/2012
by   Daniel Bryce, et al.
0

While POMDPs provide a general platform for non-deterministic conditional planning under a variety of quality metrics they have limited scalability. On the other hand, non-deterministic conditional planners scale very well, but many lack the ability to optimize plan quality metrics. We present a novel generalization of planning graph based heuristics that helps conditional planners both scale and generate high quality plans when using actions with nonuniform costs. We make empirical comparisons with two state of the art planners to show the benefit of our techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/14/2023

Probabilistic contingent planning based on HTN for high-quality plans

Deterministic planning assumes that the planning evolves along a fully p...
research
03/09/2011

Planning Graph Heuristics for Belief Space Search

Some recent works in conditional planning have proposed reachability heu...
research
11/29/2019

Learning Domain-Independent Planning Heuristics with Hypergraph Networks

We present the first approach capable of learning domain-independent pla...
research
05/27/2011

Constructing Conditional Plans by a Theorem-Prover

The research on conditional planning rejects the assumptions that there ...
research
05/12/2014

The Metrics Matter! On the Incompatibility of Different Flavors of Replanning

When autonomous agents are executing in the real world, the state of the...
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 ...

Please sign up or login with your details

Forgot password? Click here to reset