Engineering a Conformant Probabilistic Planner

09/26/2011
by   L. Li, et al.
0

We present a partial-order, conformant, probabilistic planner, Probapop which competed in the blind track of the Probabilistic Planning Competition in IPC-4. We explain how we adapt distance based heuristics for use with probabilistic domains. Probapop also incorporates heuristics based on probability of success. We explain the successes and difficulties encountered during the design and implementation of Probapop.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2011

Planning Graph Heuristics for Belief Space Search

Some recent works in conditional planning have proposed reachability heu...
research
06/24/2011

VHPOP: Versatile Heuristic Partial Order Planner

VHPOP is a partial order causal link (POCL) planner loosely based on UCP...
research
09/09/2011

mGPT: A Probabilistic Planner Based on Heuristic Search

We describe the version of the GPT planner used in the probabilistic tra...
research
05/21/2017

Generalizing the Role of Determinization in Probabilistic Planning

The stochastic shortest path problem (SSP) is a highly expressive model ...
research
06/26/2011

SAPA: A Multi-objective Metric Temporal Planner

SAPA is a domain-independent heuristic forward chaining planner that can...
research
06/26/2011

TALplanner in IPC-2002: Extensions and Control Rules

TALplanner is a forward-chaining planner that relies on domain knowledge...
research
03/20/2013

A Language for Planning with Statistics

When a planner must decide whether it has enough evidence to make a deci...

Please sign up or login with your details

Forgot password? Click here to reset