Discovering relational domain features for probabilistic planning

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

Volumn , Issue , 2007, Pages 344-351

  Wu, Jia Hong ^a   Givan, Robert ^a  

^a Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; DECISION MAKING; DOMAIN KNOWLEDGE; ITERATIVE METHODS; STOCHASTIC SYSTEMS;

DECISION-MAKING PROBLEM; DOMAIN FEATURE; FEATURE LEARNING; FUNCTION REPRESENTATIONS; MARKOV DECISION PROCESSES; PROBABILISTIC PLANNING; PROCESS STATE; RELATIONAL FEATURES; SEQUENTIAL DECISION MAKING; VALUE FUNCTIONS;

MARKOV PROCESSES;

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

References (17)

1. Bertsekas, D. P., and Tsitsiklis, J. N. 1996. Neuro-Dynamic Programming. Athena Scientific.
2. Driessens, K., and Džeroski, S. 2002. Integrating experimentation and guidance in relational reinforcement learning. In ICML.
3. Driessens, K.; Ramon, J.; and Gartner, T. 2006. Graph kernels and gaussian processes for relational reinforcement learning. MLJ 64:91-119.
4. Dzeroski, S.; DeRaedt, L.; and Driessens, K. 2001. Relational reinforcement learning. MLJ 43:7-52.
5. Gretton, C., and Thiébaux, S. 2004. Exploiting first-order regression in inductive policy selection. In UAI.
6. Martin, M., and Geffner, H. 2000. Learning generalized policies in planning domains using concept languages. In KRR.
7. Patrascu, R.; Poupart, P.; Schuurmans, D.; Boutilier, C.; and Guestrin, C. 2002. Greedy linear value-approximation for factored markov decision processes. In AAAI.
8. Sanner, S., and Boutilier, C. 2006. Practical linear valueapproximation techniques for first-order mdps. In UAI.
9. Sutton, R. S., and Barto, A. G. 1998. Reinforcement Learning. MIT Press.
10. Sutton, R. S. 1988. Learning to predict by the methods of temporal differences. MLJ 3:9-44.
11. Tesauro, G. 1995. Temporal difference learning and td-gammon. Comm. ACM 38(3):58-68.
12. Widrow, B., and Hoff, Jr, M. E. 1960. Adaptive switching circuits. IRE WESCON Convention Record 96-104.
13. Williams, R. J., and Baird, L. C. 1993. Tight performance bounds on greedy policies based on imperfect value functions. Technical report, Northeastern University.
14. Wu, J., and Givan, R. 2005. Feature-discovering approximate value iteration methods. In SARA.
15. Yoon, S.; Fern, A.; and Givan, R. 2002. Inductive policy selection for first-order MDPs. In UAI.
16. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-Replan: A baseline for probabilistic planning. In ICAPS.
17. Younes, H.; Littman, M.; Weissman, D.; and Asmuth, J. 2005. The first probabilistic track of the international planning competition. JAIR 24:851-887.