Approximate solution techniques for factored first-order MDPs

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 288-295

  Sanner, Scott ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

APPROXIMATE SOLUTION; DOMAIN SIZE; FIRST ORDER; PROBABILISTIC PLANNING; RELATIONAL MDP; SOLUTION APPROACH; SOLUTION TECHNIQUES; STATE OF THE ART; TRADITIONAL APPROACHES; TRANSITION MODEL;

DYNAMIC PROGRAMMING;

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

References (19)

1. Bellman, R. E. 1957. Dynamic Programming. Princeton, NJ: Princeton University Press.
2. Boutilier, C.; Dean, T.; and Hanks, S. 1999. Decision-theoretic planning: Structural assumptions and computational leverage. JAIR 11:1-94.
3. Boutilier, C.; Reiter, R.; and Price, B. 2001. Symbolic dynamic programming for first-order MDPs. In IJCAI-01.
4. de Salvo Braz, R.; Amir, E.; and Roth, D. 2005. Lifted first-order probabilistic inference. In IJCAI-05.
5. de Salvo Braz, R.; Amir, E.; and Roth, D. 2006. Mpe and partial inversion in lifted probabilistic variable elimination. In AAAI-06.
6. Fern, A.; Yoon, S.; and Givan, R. 2003. Approximate policy iteration with a policy language bias. In NIPS-03.
7. Gretton, C., and Thiebaux, S. 2004. Exploiting first-order regression in inductive policy selection. In UAI-04.
8. Guestrin, C.; Roller, D.; Parr, R.; and Venktaraman, S. 2002. Efficient solution methods for factored MDPs. JAIR 19:399-468.
9. Guestrin, C.; Roller, D.; Gearhart, C.; and Kanodia, N. 2003. Generalizing plans to new environments in RMDPs. In IJCAI-03.
10. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In UAI-99.
11. Hölldobler, S., and Skvortsova, O. 2004. A logic-based approach to dynamic programming. In In AAAI-2004 Workshop on Learning and Planning in Markov Processes.
12. Karabaev, E., and Skvortsova, O. 2005. A heuristic search algorithm for solving first-order MDPs. In UAI-2005, 292-299.
13. Kersting, K.; van Otterlo, M.; and de Raedt, L. 2004. Bellman goes relational. In ICML-04. ACM Press.
14. Poole, D. 2003. First-order probabilistic inference. In IJCAI-03.
15. Reiter, R. 2001. Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press.
16. Sanner, S., and Boutilier, C. 2005. Approximate linear programming for first-order MDPs. In UAI-2005.
17. Sanner, S., and Boutilier, C. 2006. Practical linear-value approximation techniques for first-order MDPs. In UAI-2006.
18. Schuurmans, D., and Patrascu, R. 2001. Direct value approximation for factored MDPs. In NIPS-2001, 1579-1586.
19. St-Aubin, R.; Hoey, J.; and Boutilier, C. 2000. APRICODD: Approximate policy construction using decision diagrams. In NIPS- 2000, 1089-1095.