Fast Probabilistic Planning Through Weighted Model Counting

Domshlak, Carmel; Hoffmann, Jörg; Long, Derek; Smith, Stephen F.; Borrajo, Daniel; McCluskey, Lee

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Fast Probabilistic Planning Through Weighted Model Counting

MPS-Authors

/persons/resource/persons44632

Hoffmann, Jörg
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Domshlak, C., & Hoffmann, J. (2006). Fast Probabilistic Planning Through Weighted Model Counting. In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006) (pp. 243-252). Menlo Park, USA: AAAI.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-22CE-0

要旨

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.