Relational Partially Observable MDPs

Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010

Volumn , Issue , 2010, Pages 1153-1158

  Wang, Chenggang ^a   Khardon, Roni ^a  

^a Tufts University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; ITERATIVE METHODS; STOCHASTIC SYSTEMS;

ACTION EFFECT; DOMAIN SIZE; FINITE HORIZONS; FORMALISATION; MARKOV DECISION PROCESSES; PARTIALLY OBSERVABLE MDP; PLANNING PROBLEM; STOCHASTIC PLANNING; STOCHASTICS; UNCERTAINTY;

MARKOV PROCESSES;

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

References (23)

1. Bacchus, F.; Halpern, J. Y.; and Levesque, H. J. 1999. Reasoning about noisy sensors and effectors in the situation calculus. Artificial Intelligence 111:171-208.
2. Bahar, R. I.; Frohm, E. A.; Gaona, C. M.; Hachtel, G. D.; Macii, E.; Pardo, A.; and Somenzi, F. 1993. Algebraic decision diagrams and their applications. In Proceedings of the International Conference on Computer-Aided Design, 188-191.
3. Boutilier, C., and Poole, D. 1996. Computing optimal policies for partially observable decision processes using compact representations. In AAAI, 1168-1175.
4. Boutilier, C.; Reiter, R.; and Price, B. 2001. Symbolic dynamic programming for first-order MDPs. In IJCAI, 690-700.
5. Cassandra, A.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact method for partially observable Markov Decision Processes. In UAI, 54-61.
6. Fern, A.; Yoon, S.; and Givan, R. 2006. Approximate policy iteration with a policy language bias: Solving relational markov decision processes. JAIR 25:75-118.
7. Geffner, H., and Bonet, B. 1998. High-level planning and control with incomplete information using POMDPs. In Proceedings of Fall AAAI Symposium on Cognitive Robotics.
8. Hansen, E. A., and Feng, Z. 2000. Dynamic programming for POMDPs using a factored state representation. In AIPS, 130-139.
9. Hansen, E. A. 1998. Solving POMDPs by search in policy space. In UAI, 211-219.
10. Hauskrecht, M. 1997. A heuristic variable-grid solution method for POMDPs. In AAAI, 727-733.
11. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In UAI, 279-288.
12. Hölldobler, S., and Skvortsova, O. 2004. A logic-based approach to dynamic programming. In AAAI-04 workshop on learning and planning in Markov Processes - advances and challenges.
13. Joshi, S., and Khardon, R. 2008. Stochastic planning with first order decision diagrams. In ICAPS, 156-163.
14. Joshi, S.; Kersting, K.; and Khardon, R. 2009. Generalized first order decision diagrams for first order markov decision processes. In IJCAI, 1916-1921.
15. Joshi, S.; Kersting, K.; and Khardon, R. 2010. Self-taught decision theoretic planning with first order decision diagrams. In ICAPS.
16. Kersting, K.; Van Otterlo, M.; and De Raedt, L. 2004. Bellman goes relational. In ICML, 465-472.
17. Poole, D. 1997. The independent choice logic for modeling multiple agents under uncertainty. Artificial Intelligence 94:7-56.
18. Sanner, S., and Boutilier, C. 2009. Practical solution techniques for first-order MDPs. Artificial Intelligence 173:748-488.
19. Sanner, S., and Kersting, K. 2010. Symbolic dynamic programming for first-order POMDPs. In AAAI.
20. Shani, G.; Brafman, R.; Shimony, S.; and Poupart, P. 2008. Efficient ADD operations for point-based algorithms. In ICAPS.
21. Wang, C., and Schmolze, J. 2005. Planning with POMDPs using a compact, logic-based representations. In ICTAI, 523-530.
22. Wang, C.; Joshi, S.; and Khardon, R. 2008. First order decision diagrams for relational MDPs. JAIR 31:431-472.
23. Wang, C. 2007. First order Markov Decision Processes. Ph.D. Dissertation, Tufts University. Technical Report TR-2007-4.