MAXPLAN:A New Approach to Probabilistic Planning

Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998

Volumn , Issue , 1998, Pages 86-93

  Majercik, Stephen M ^a   Littman, Michael L ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; OPERATIONS RESEARCH; STOCHASTIC SYSTEMS;

ARTIFICIAL INTELLIGENCE PLANNING; DETERMINISTICS; LARGE DOMAIN; NEW APPROACHES; OPERATION RESEARCH; PLANNING TECHNIQUES; PROBABILISTIC PLANNING; PROBABILISTICS; RESEARCH PLANNING; TEST PROBLEM;

DYNAMIC PROGRAMMING;

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

References (14)

1. Blum, A. L., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):279-298.
2. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1104-1113.
3. Cassandra, A.; Littman, M. L.; and Zhang, N. L. 1997. Incremental Pruning: A simple, fast, exact method for partially observable Markovdecision processes. In Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-gT), 54-61. San Francisco, CA: Morgan Kaufmann Publishers.
4. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM5:394-397.
5. Ernst, M. D.; Millstein, T. D.; and Weld, D. S. 1997. Automatic SAT-compilation of planning problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1169-1176.
6. Goldsmith, J.; Littman, M. L.; and Mundhenk, M. 1997. The complexity of plan existence and evaluation in probabilistic domains. In Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97), 182-189. San Francisco, CA: Morgan Kaufmann Publishers.
7. Hooker, J. N., and Vinay, V. 1994. Branchingrules for satisfiability. Technical Report GSIAWorkingPaper 1994-09, Carnegie Mellon University. Revised January 1995.
8. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1194-1201. AAAIPress/The MITPress.
9. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in propositional logic. In Proceedings of the Fifth International Conferenceon Principles of Knowledge Representation and Reasoning (KR-96).
10. Kushrnerick, N.; Hanks, S.; and Weld, D. S. 1995. An algorithm for probabilistic planning. Artificial Intelligence 76(1-2):239-286.
11. Littman, M. L.; Goldsmith, J.; and Mundhenk, M. 1997. The computational complexity of probabilistic plan existence and evaluation. Submitted.
12. Littman, M. L. 1997. Probabilistic propositional planning: Representations and complexity. In Proceedings of the FourteenthNational Conferenceon Artificial Intelligence, 748-754. AAAIPress/The MITPress.
13. Majercik, S. M., and Littman, M. L. 1998. Using caching to solve larger probabilistic planning problems. To appear in the proceedings of the Fifteenth National Conferenceon Artificial Intelligence.
14. Zhang, H., and Stickel, M. E. 1994. Implementing the Davis-Putnam algorithm by tries. Technical report, Computer Science Department, University of Iowa, Iowa City, IA.