Fast probabilistic planning through weighted model counting

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 243-252

  Domshlak, Carmel ^a   Hoffmann, Jörg ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING;

HEURISTIC FORWARD-SEARCH MACHINERY; PROBABILISTIC DOMAINS; PROBABILISTIC PLANNING; PROBABILISTIC-FF;

PROBABILISTIC LOGICS;

EID: 33746102173     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Bertoli, P.; Cimatti, A.; Pistore, M.; Roveri, M.; and Traverse, P 2001. MBP: a model based planner. In IJCAI'01 Workshop on Planning under Uncertainty.
2. Bertoli, P.; Cimatti, A.; Slaney, J.; and Thiébaux, S. 2002. Solving power supply restoration problems with planning via symbolic model-checking. In ECAI'02,576-580.
3. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In AIPS'00.
4. Boutilier, C.; Friedman, N.; Goldszmidt, M.; and Koller, D. 1996. Context-specific independence in Bayesian networks. In UAI'96, 115-123.
5. Brafman, R. I., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In ICAPS'04, 355-364.
6. Bryce, D., and Kambhampari, S. 2004. Heuristic guidance measures for conformant planning. In ICAPS'04,365-374.
7. Chavira, M., and Darwiche, A. 2005. Compiling Bayesian networks with local structure. In IJCAI'05, 1306-1312.
8. Darwiche, A. 2000. Recursive conditioning. AIJ 125(1-2):5-41.
9. Dechter, R. 1999. Bucket elimination: A unified framework for reasoning. AIJ 113:41-85.
10. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
11. Hyafil, N., and Bacchus, F. 2003. Conformant probabilistic planning via CSPs. In ICAPS'98, 205-214.
12. Hyafil, N., and Bacchus, F. 2004. Utilizing structured representations and CSPs in conformant probabilistic planning. In ECAI'04, 1033-1034.
13. Jensen, F. 1996. An Introduction to Bayesian Networks. Springer Verlag.
14. Kushmerick, N.; Hanks, S.; and Weld, D. 1995. An algorithm for probabilistic planning. AIJ 78(1-2):239-286.
15. Littman, M.; Goldsmith, J.; and Mundhenk, M. 1998. The computational complexity of probabilistic planning. JAIR 9:1-36.
16. Majercik, S., and Littman, M. 1998. MAXPLAN: A new approach to probabilistic planning. In AIPS'98, 86-93.
17. Majercik, S., and Littman, M. 2003. Contingent planning under uncertainty via stochastic satisfiability. AIJ 147(1-2): 119-162.
18. Pearl, J. 1988. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann.
19. Roth, D. 1996. On the hardness of approximate reasoning. AIJ 82(1-2):273-302.
20. Sang, T.; Beame, P.; and Kautz, H. 2005. Solving Bayes networks by weighted model counting. In AAAI'05.
21. Sang, T.; Bacchus, F.; Beame, P.; Kautz, H.; and Pitassi, T. 2004. Combining component caching and clause learning for effective model counting. In SAT'04.
22. Zhang, N., and Poole, D. 1994. A simple approach to Bayesian network computations. In AI'94.