Fast Probabilistic Planning through 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 on several probabilistic domains shows an unprecedented, several orders of magnitude improvement over previous results in this area.

• Type: Conference
• Year: 2006
• Where: AIPS
• Authors: Carmel Domshlak, Jörg Hoffmann
• Keywords: AIPS 2006, Artificial Intelligence, Heuristic Forward-search Machinery, Probabilistic, Weighted Model Counting