Generalizing plans to new environments in relational MDPs

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1003-1010

  Guestrin, Carlos ^a   Koller, Daphne ^a   Gearhart, Chris ^a   Kanodia, Neal ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE VALUE FUNCTION; DIFFERENT CLASS; LOSS OF PERFORMANCE; MARKOV DECISION PROCESSES; MULTI-AGENT SETTING; PLANNING TIME; POLYNOMIAL NUMBER; PROBLEM-BASED;

MARKOV PROCESSES; MULTI AGENT SYSTEMS; OPTIMIZATION;

COMPUTER GAMES;

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

References (17)

1. C. Boutilier, R. Reitcr, and B. Price. Symbolic dynamic programming for first-order MDPs. In IJCA1-0I, 2001.
2. D.P. de Farias and B. Van Roy. On constraint sampling for the linear programming approach to approximate dynamic programming. Submitted to Math, of Operations Research, 2001.
3. T. Dean and K. Kanazawa. Probabilistic temporal reasoning. In AAA1-88, 1988.
4. T. G. Dietterich. Hierarchical reinforcement learning with the MAXQ value function decomposition. Journal of Artificial Intelligence Research, 13:227-303, 2000.
5. R E. Fikes, P. E. Hart, and N. J. Nilsson. Learning and executing generalized robot plans. Artf. Intel, 3(4):251-288, 1972.
6. C. E. Guestrin, D. Koller, and R. Parr. Multiagent planning with factored MDPs. In NIPS-14, 2001.
7. C. E. Guestrin, S. Venkataraman, and D. Roller. Context specific multiagent coordination and planning with factored MDPs. In AAA/-02, 2002.
8. M. Hauskrecht, N. Meuleau, L. Kaelbling, T. Dean, and C. Boutilier. Hierarchical solution of Markov decision processes using macro-actions. In UAI, 1998.
9. R. Khardon. Learning action strategics for planning domains. Artificial Intelligence, 113:125-148, 1999. (Pubitemid 30542740)
10. D. Koller and A. Pfeffer. Probabilistic frame-based systems. In AAA A 1998.
11. M. Martin and H. Gcffner. Learning generalized policies in planning using concept languages. In KR, 2000.
12. R. Parr. Flexible decomposition algorithms for weakly coupled markov decision problems. In UAI-98, 1998.
13. D. Schuurmans and R. Patrascu. Direct value-approximation for factored MDPs. In NIPS-14, 2001.
14. P. Schweitzer and A. Seidmann. Generalized polynomial approximations in Markovian decision processes. / of Mathematical Analysis and Applications, 110:568-582, 1985.
15. R. Sutton and A. Barto. Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA, 1998.
16. S. Thrun and J. O'Sullivan. Discovering structure in multiple learning tasks: The TC algorithm. In 1CML-96, 1996.
17. S. W. Yoon, A. Fern, and B. Givan. Inductive policy selection for first-order MDPs. In UAI-02, 2002.