Engineering a Conformant Probabilistic Planner

Abstract

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.

References in corpus (8)

• The FF Planning System: Fast Plan Generation Through Heuristic Search
• Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
• VHPOP: Versatile Heuristic Partial Order Planner
• On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
• Approximate Policy Iteration with a Policy Language Bias: Solving Relational Markov Decision Processes
• mGPT: A Probabilistic Planner Based on Heuristic Search
• Decision-Theoretic Planning with non-Markovian Rewards
• Engineering a Conformant Probabilistic Planner

Cited by in corpus (3)

• Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting
• Decision-Theoretic Planning with non-Markovian Rewards
• Engineering a Conformant Probabilistic Planner