Probabilistic planning via heuristic forward search and weighted model counting

Journal of Artificial Intelligence Research

Volumn 30, Issue , 2007, Pages 565-620

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; ONLINE SEARCHING; PROBLEM SOLVING; UNCERTAINTY ANALYSIS;

HEURISTIC FORWARD SEARCH; HEURISTIC FUNCTIONS; PROBABILISTIC PLANNING;

HEURISTIC ALGORITHMS;

EID: 38349168404     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2289     Document Type: Article

References (41)

1. Bertoli, P., Cimatti, A., Pistore, M., Roveri, M., & Traverso, P. (2001). MBP: a model based planner. In Proc. IJCAI'01 Workshop on Planning under Uncertainty and Incomplete Information, Seattle, WA.
2. Bertoli, P., Cimatti, A., Slaney, J., & Thiébaux, S. (2002). Solving power supply restoration problems with planning via symbolic model-checking. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), pp. 576-580, Lion, France.
3. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
4. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1-2), 5-33.
5. Bonet, B., & Geffner, H. (2000). Planning with incomplete information as heuristic search in belief space. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling Systems (AIPS), pp. 52-61, Breckenridge, CO.
6. Boutilier, C., Friedman, N., Goldszmidt, M., & Koller, D. (1996). Context-specific independence in Bayesian networks. In Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI), pp. 115-123, Portland, OR.
7. Brafman, R. I., & Domshlak, C. (2006). Factored planning: How, when, and when not. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), pp. 809-814, Boston, MA.
8. Bryce, D., & Kambhampati, S. (2004). Heuristic guidance measures for conformant planning. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), pp. 365-374, Whistler, BC, Canada.
9. Bryce, D., Kambhampati, S., & Smith, D. (2006). Sequential Monte Carlo in probabilistic planning reachability heuristics. In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 233-242, Cumbria, UK.
10. Chavira, M., & Darwiche, A. (2005). Compiling Bayesian networks with local structure. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1306-1312, Edinburgh, Scotland.
11. Darwiche, A. (2000). Recursive conditioning. Artificial Intelligence, 125(1-2), 5-41.
12. Darwiche, A. (2001). Constant-space reasoning in dynamic Bayesian networks. International Journal of Approximate Reasoning, 26(3), 161-178.
13. Dean, T., & Kanazawa, K. (1989). A model for reasoning about persistence and causation. Computational Intelligence, 5, 142-150.
14. Dechter, R. (1999). Bucket elimination: A unified framework for reasoning. Artificial Intelligence, 113, 41-85.
15. Domshlak, C., & Hoffmann, J. (2006). Fast probabilistic planning through weighted model counting. In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 243-252, Cumbria, UK.
16. Gomes, C. P., Hoffmann, J., Sabharwal, A., & Selman, B. (2007). From sampling to model counting. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), Hyderabad, India.
17. Gomes, C. P., Sabharwal, A., & Selman, B. (2006). Model counting: A new strategy for obtaining good bounds. In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI-06), pp. 54-61, Boston, MA.
18. Hanks, S., & McDermott, D. (1994). Modeling a dynamic and uncertain world I: Symbolic and probabilistic reasoning about change. Artificial Intelligence, 66(1), 1-55.
19. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
20. Hoffmann, J., & Brafman, R. (2006). Conformant planning via heuristic forward search: A new approach. Artificial Intelligence, 170(6-7), 507-541.
21. Huang, J. (2006). Combining knowledge compilation and search for efficient conformant probabilistic planning. In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 253-262, Cumbria, UK.
22. Hyafil, N., & Bacchus, F. (2004). Utilizing structured representations and CSPs in conformant probabilistic planning. In Proceedings of the European Conference on Artificial Intelligence (ECAI), pp. 1033-1034, Valencia, Spain.
23. Jensen, F. (1996). An Introduction to Bayesian Networks. Springer Verlag, New York.
24. Kushmerick, N., Hanks, S., & Weld, D. (1995). An algorithm for probabilistic planning. Artificial Intelligence, 78(1-2), 239-286.
25. Little, I., Aberdeen, D., & Thiébaux, S. (2005). Prottle: A probabilistic temporal planner. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-05), pp. 1181-1186, Pittsburgh, PA.
26. Littman, M. L., Goldsmith, J., & Mundhenk, M. (1998). The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9, 1-36.
27. Majercik, S. M., & Littman, M. L. (1998). MAXPLAN: A new approach to probabilistic planning. In Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems (AlPS), pp. 86-93, Pittsburgh, PA.
28. Majercik, S. M., & Littman, M. L. (2003). Contingent planning under uncertainty via stochastic satisfiability. Artificial Intelligence, 147(1-2), 119-162.
29. McDermott, D. (1998). The 1998 AI Planning Systems Competition. AI Magazine, 2(2), 35-55.
30. McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109(1-2), 111-159.
31. Onder, N., Whelan, G. C., & Li, L. (2006). Engineering a conformant probabilistic planner. Journal of Artificial Intelligence Research, 25, 1-15.
32. Pearl, J. (1984). Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
33. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA.
34. Rintanen, J. (2003). Expressive equivalence of formalisms for planning with sensing. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS), pp. 185-194, Trento, Italy.
35. Roth, D. (1996). On the hardness of approximate reasoning. Artificial Intelligence, 82(1-2), 273-302.
36. Russell, S., & Norvig, P. (2004). Artificial Intelligence: A Modern Approach (2 edition). Pearson.
37. Sang, T., Bacchus, F., Beame, P., Kautz, H., & Pitassi, T. (2004). Combining component caching and clause learning for effective model counting. In (Online) Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT), Vancouver, BC, Canada.
38. Sang, T., Beame, P., & Kautz, H. (2005). Solving Bayes networks by weighted model counting. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pp. 475-482, Pittsburgh, PA.
39. Shimony, S. E. (1993). The role of relevance in explanation I: Irrelevance as statistical independence. International Journal of Approximate Reasoning, 8(4), 281-324.
40. Shimony, S. E. (1995). The role of relevance in explanation II: Disjunctive assignments and approximate independence. International Journal of Approximate Reasoning, 13(1), 27-60.
41. Zhang, N. L., & Poole, D. (1994). A simple approach to Bayesian network computations. In Proceedings of the 10th Canadian Conference on Artificial Intelligence, pp. 171-178, Banff, Alberta, Canada.