Decision tree methods for finding reusable MDP homomorphisms

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 530-535

  Wolfe, Alicia Peregrin ^a,b   Barto, Andrew G ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b National Physical Science Consortium   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX ENVIRONMENTS; HOMOMORPHISMS; STATE ABSTRACTION; TRANSITION PROBABILITIES;

ABSTRACTING; ALGORITHMS; DECISION THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBABILITY; TREES (MATHEMATICS); VIRTUAL REALITY;

MARKOV PROCESSES;

EID: 33750683324     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 the 17th International Joint Conference on Artificial Intelligence, 690-697.
2. Chapman, D., and Kaelbling, L. P. 1991. Input generalization in delayed reinforcement learning: An algorithm and performance comparisons. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, volume 2, 726-731.
3. Ernst, D.; Geurts, P.; and Wehenkel, L. 2005. Tree-based batch mode reinforcement learning. Journal of Machine Learning Research 6:503-556.
4. Givan, R.; Dean, T.; and Greig, M. 2003. Equivalence notions and model minimization in markov decision processes. Artificial Intelligence 147(1-2): 163-223.
5. Givan, R.; Leach, S. M.; and Dean, T. 2000. Bounded-parameter markov decision processes. Artificial Intelligence 122(1-2):71-109.
6. Hengst, B. 2002. Discovering hierarchy in reinforcement learning with hexq. In Proceedings of the 19th International Conference on Machine Learning, 243-250.
7. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. Spudd: Stochastic planning using decision diagrams. In Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI), 527-534.
8. Jodogne, S., and Piater, J. H. 2005. Interactive learning of mappings from visual percepts to actions. In Proceedings of the 22nd International Conference on Machine Learning.
9. Jonsson, A., and Barto, A. 2001. Automated state abstraction for options using the u-tree algorithm. In Advances in Neural Information Processing Systems 13, 1054-1060.
10. Jonsson, A., and Barto, A. 2005. A causal approach to hierarchical decomposition of factored mdps. In Proceedings of the 22nd International Conference on Machine Learning, volume 22.
11. Kersting, K., and Raedt, L. D. 2003. Logical markov decision programs. In Proceedings of the 20th International Conference on Machine Learning (ICML-2003).
12. McCallum, A. K. 1995. Reinforcement Learning with Selective Perception and Hidden State. Ph.D. Dissertation, Rutgers University.
13. Poupart, P., and Boutilier, C. 2002. Value-directed compression of pomdps. In Advances in Neural Information Processing Systems 75, 1547-1554.
14. Ravindran, B., and Barto, A. G. 2003. Smdp homomorphisms: An algebraic approach to abstraction in semi markov decision processes. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, 1011-1016. AAAI Press.
15. Ravindran, B. 2004. An Algebraic Approach to Abstraction in Reinforcement Learning. Ph.D. Dissertation, University of Massachusetts.
16. Sutton, R. S.; Precup, D.; and Singh, S. P. 1999. Between mdps and semi-mdps: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence 112:181-211.
17. Whitehead, S., and Ballard, D. 1991. Learning to perceive and act by trial and error. Machine Learning 7:45-83.
18. Wu, J.-H., and Givan, R. 2005. Feature-discovering approximate value iteration methods. In Jean-Daniel Zucker, L. S., ed., Abstraction, Reformulation and Approximation: 6th International Symposium.