Combining knowledge compilation and search for conformant probabilistic planning

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

Volumn 2006, Issue , 2006, Pages 253-262

  Huang, Jinbo ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; KNOWLEDGE ACQUISITION; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING;

BRANCHAND-BOUND ALGORITHMS; KNOWLEDGE COMPILATION; PROBABILISTIC PLANNING; SENSORY INFORMATION;

PROBABILISTIC LOGICS;

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

References (21)

1. Bonet, B., and Geffner, H. 2000. Planning with incomplete information as heuristic search in belief space. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems (AIPS), 52-61.
2. Bonet, B., and Geffner, H. 2001. GPT: A tool for planning with uncertainty and partial information. In Proceedings of the IJCAI01 Workshop on Planning with Uncertainty and Partial Information, 82-87.
3. Brafman, R. I., and Hoffmann, J. 2004. Conformant planning via heuristic forward search: A new approach. In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS), 355-364.
4. Cimatti, A., and Roveri, M. 2000. Conformant planning via symbolic model checking. Journal of Artificial Intelligence Research 13:305-338.
5. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. Journal of Artificial Intelligence Research 17:229-264.
6. Darwiche, A. 2001a. On the tractability of counting theory models and its application to belief revision and truth maintenance. Journal of Applied Non-Classical Logics 11(1-2): 11-34.
7. Darwiche, A. 2001b. Recursive conditioning. Artificial Intelligence 126(1-2):5-41.
8. Darwiche, A. 2004. New advances in compiling CNF into decomposable negation normal form. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), 328-332.
9. Darwiche, A. 2005. The C2D compiler user manual. Technical Report D-147, Computer Science Department, UCLA. http://reasoning.cs.ucla.edu/c2d/.
10. Dechter, R. 1996. Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI), 211-219.
11. Hyafil, N., and Bacchus, F. 2003. Conformant probabilistic planning via CSPs. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS), 205-214.
12. Hyafil, N., and Bacchus, F. 2004. Utilizing structured representations and CSPs in conformant probabilistic planning. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), 1033-1034.
13. Kautz, H., and Selman, B. 1992. Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI), 359-363.
14. Kushmerick, N.; Hanks, S.; and Weld, D. S. 1995. An algorithm for probabilistic planning. Artificial Intelligence 76(1-2):239-286.
15. Littman, M. L. 1997. Probabilistic prepositional planning: Representations and complexity. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI), 748-754.
16. Majercik, S. M., and Littman, M. L. 1998a. MAXPLAN: A new approach to probabilistic planning. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS), 86-93.
17. Majercik, S. M., and Littman, M. L. 1998b. Using caching to solve larger probabilistic planning problems. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), 954-959.
18. Palacios, H.; Bonet, B.; Darwiche, A.; and Geffner, H. 2005. Pruning conformant plans by counting models on compiled dDNNF representations. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS), 141-150.
19. Park, J., and Darwiche, A. 2003. Solving MAP exactly using systematic search. In Proceedings of the 19th Conference on Uncertainty in Artificial Intelligence (UAI), 459-468.
20. Robertson, N., and Seymour, P. D. 1986. Graph minors II: Algorithmic aspects of treewidth. Journal of Algorithms 7:309-322.
21. Smith, D. E., and Weld, D. S. 1998. Conformant Graphplan. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), 889-896.