Self-taught decision theoretic planning with first order decision diagrams

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 89-96

  Joshi, Saket ^a   Kersting, Kristian ^b   Khardon, Roni ^a  

^a Tufts University   (United States)

^b FRAUNHOFER IAIS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DIAGRAM; DECISION-THEORETIC; FIRST ORDER; INTERNATIONAL PLANNING COMPETITIONS; MARKOV DECISION PROCESSES; ON THE FLIES; OPTIMAL ACTIONS; PLANNING PROBLEM; PLANNING SYSTEMS; REDUCTION OPERATION; REGION OF INTEREST; STATE OF THE ART; STATE SPACE; TRAINING EXAMPLE; VALUE FUNCTIONS;

MARKOV PROCESSES; MODEL CHECKING; SCHEDULING;

PLANNING;

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

References (18)

1. Boutilier, C.; Reiter, R.; and Price, B. 2001. Symbolic dynamic programming for first-order mdps. In Proceedings of IJCAI, 690-700.
2. Fern, A.; Yoon, S.; and Givan, R. 2003. Approximate policy iteration with a policy language bias. In Proceedings of NIPS.
3. Gretton, C., and Thiebaux, S. 2004. Exploiting first-order regression in inductive policy selection. In Proceedings of UAI.
4. Groote, J., and Tveretina, O. 2003. Binary decision diagrams for first order predicate logic. Journal of Logic and Algebraic Programming 57:1-22.
5. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. Spudd: Stochastic planning using decision diagrams. In Proceedings of UAI, 279-288.
6. Hölldobler, S.; Karabaev, E.; and Skvortsova, O. 2006. FluCaP: a heuristic search planner for first-order MDPs. JAIR 27:419-439.
7. Joshi, S., and Khardon, R. 2008. Stochastic planning with first order decision diagrams. In Proceedings of ICAPS.
8. Joshi, S.; Kersting, K.; and Khardon, R. 2009. Generalized first order decision diagrams for first order markov decision processes. In Proceedings of IJCAI.
9. Kersting, K.; Otterlo, M. V.; and De Raedt, L. 2004. Bellman goes relational. In Proceedings of ICML.
10. Lloyd, J. 1987. Foundations of Logic Programming. Springer Verlag. Second Edition.
11. Maloberti, J., and Sebag, M. 2004. Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning 55:137-174.
12. Morales, E., and Sammut, C. 2004. Learning to fly by combining reinforcement learning with behavioral cloning. In Proceedings of the ICML.
13. Price, B., and Boutilier, C. 2003. Accelerating reinforcement learning through implicit imitation. JAIR 19:569-629. (Pubitemid 41525929)
14. Puterman, M. L. 1994. Markov decision processes: Discrete stochastic dynamic programming. Wiley.
15. Sanner, S., and Boutilier, C. 2009. Practical solution techniques for first order mdps. AIJ 173:748-788.
16. Teichteil-Koenigsbuch, F.; Infantes, G.; and Kuter, U. 2008. Rff: A robust ff-based mdp planning algorithm for generating policies with low probability of failure. In Sixth IPC at ICAPS.
17. Wang, C.; Joshi, S.; and Khardon, R. 2008. First order decision diagrams for relational mdps. JAIR 31:431-472. (Pubitemid 351761993)
18. Yoon, S.; Fern, A.; and Givan, R. 2007. Ff-replan: A baseline for probabilistic planning. In Proceedings of ICAPS, 352-.