Engineering a conformant probabilistic planner

Document Type

Article

Publication Date

1-1-2006

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. © 2006 AI Access Foundation. All rights reserved.

Publication Title

Journal of Artificial Intelligence Research

Link to Full Text

Share

COinS