Approximate policy iteration with a policy language bias

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Fern, Alan ^a   Yoon, SungWook ^a   Givan, Robert ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

CLASSICAL PLANNING; DOMAIN SPECIFIC; HIGH QUALITY; MARKOV DECISION PROCESSES; POLICY ITERATION; POLICY LANGUAGE;

ITERATIVE METHODS;

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

References (28)

1. Ricardo Aler, Daniel Borrajo, and Pedro Isasi. Using genetic programming to learn and improve control knowledge. AIJ, 141(1-2):29-56, 2002.
2. Fahiem Bacchus. The AIPS '00 planning competition. AI Magazine, 22(3)(3):57-62, 2001.
3. Fahiem Bacchus and Froduald Kabanza. Using temporal logics to express search control knowledge for planning. AIJ, 16:123-191, 2000.
4. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
5. D. P. Bertsekas and J. N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, 1996.
6. Craig Boutilier and Richard Dearden. Approximating value trees in structured dynamic programming. In Lorenza Saitta, editor, ICML, 1996.
7. Craig Boutilier, Richard Dearden, and Moises Goldszmidt. Stochastic dynamic programming with factored representations. AIJ, 121(1-2):49-107, 2000.
8. Craig Boutilier, Raymond Reiter, and Bob Price. Symbolic dynamic programming for firstorder MDPs. In IJCAI, 2001.
9. S. Dzeroski, L. De Raedt & K. Driessens. Relational reinforcement learning. MLJ, 43:7-52, 2001.
10. Tara A. Estlin and Raymond J. Mooney. Multi-strategy learning of search control for partialorder planning. In AAAI, 1996.
11. Robert Givan, Thomas Dean, and Matt Greig. Equivalence notions and model minimization in Markov decision processes. AIJ, 147(1-2):163-223, 2003.
12. Carlos Guestrin, Daphne Koller, and Ronald Parr. Max-norm projections for factored MDPs. In IJCAI, pages 673-680, 2001.
13. Jorg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14:263-302, 2001.
14. R. Howard. Dynamic Programming and Markov Decision Processes. MIT Press, 1960.
15. Yi-Cheng Huang, Bart Selman, and Henry Kautz. Learning declarative control rules for constraint-based planning. In ICML, pages 415-422, 2000.
16. Michael J. Kearns, Yishay Mansour, and Andrew Y. Ng. A sparse sampling algorithm for nearoptimal planning in large markov decision processes. MLJ, 49(2-3):193-208, 2002.
17. Roni Khardon. Learning action strategies for planning domains. AIJ, 113(1-2):125-148, 1999.
18. M. Lagoudakis and R. Parr. Reinforcement learning as classification: Leveraging modern classifiers. In ICML, 2003.
19. Mario Martin and Hector Geffner. Learning generalized policies in planning domains using concept languages. In KRR, 2000.
20. D. McAllester & R. Givan. Taxonomic syntax for 1st-order inference. JACM, 40:246-83, 1993.
21. S. Minton. Quantitative results on the utility of explanation-based learning. In AAAI, 1988.
22. S. Minton, editor. Machine Learning Methods for Planning. MorganKaufmann, 1993.
23. S. Minton, J. Carbonell, C. A. Knoblock, D. R. Kuokka, O. Etzioni, and Y. Gil. Explanationbased learning: A problem solving perspective. AIJ, 40:63-118, 1989.
24. G. Tesauro. Practical issues in temporal difference learning. MLJ, 8:257-277, 1992.
25. G. Tesauro & G. Galperin. Online policy improvement via monte-carlo search. In NIPS, 1996.
26. J. Tsitsiklis and B. Van Roy. Feature-based methods for large scale DP. MLJ, 22:59-94, 1996.
27. M. Veloso, J. Carbonell, A. Perez, D. Borrajo, E. Fink, and J. Blythe. Integrating planning and learning: The PRODIGY architecture. Journal of Experimental and Theoretical AI, 7(1), 1995.
28. S. Yoon, A. Fern, and R. Givan. Inductive policy selection for first-order MDPs. In UAI, 2002.