Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting

We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-FF to problems with probabilistic uncertainty about both the initial state and action effects. Specifically, Probabilistic-FF combines Conformant-FF’s techniques with a powerful machinery for weighted model counting in (weighted) CNFs, serving to elegantly define both the search space and the heuristic function. Our evaluation of Probabilistic-FF shows its fine scalability in a range of probabilistic domains, constituting a several orders of magnitude improvement over previous results in this area. We use a problematic case to point out the main open issue to be addressed by further research.

• Type: Journal
• Year: 2007
• Where: JAIR
• Authors: Carmel Domshlak, Jörg Hoffmann
• Keywords: Heuristic Forward-search Machinery, JAIR 2007, Probabilistic, Probabilistic Uncertainty