Model minimization in hierarchical reinforcement learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2371, Issue , 2002, Pages 196-211

  Ravindran, Balaraman ^a   Barto, Andrew G ^a  

^a The Manning College of Information and Computer Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MACHINE LEARNING; MARKOV PROCESSES; REDUNDANCY;

EQUIVALENT MODEL; FRAME OF REFERENCE; HIERARCHICAL REINFORCEMENT LEARNING; MARKOV DECISION PROCESSES; REAL-WORLD PROBLEM;

REINFORCEMENT LEARNING;

EID: 84956854078     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45622-8_15     Document Type: Conference Paper

References (19)

1. C. Boutilier and R. Dearden. Using abstractions for decision theoretic planning with time constraints. In Proceedings of the AAAI-94, pages 1016-1022. AAAI, 1994.
2. C. Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction. In Proceedings of International Joint Conference on Artificial Intelligence 14, pages 1104-1111, 1995.
3. Steven J. Bradtke and Michael O. Duff. Reinforcement learning methods for continuous-time Markov decision problems. In Advances in Neural Information Processing Systems 7. MIT Press, 1995.
4. Thomas Dean and Robert Givan. Model minimization in markov decision processes. In Proceedings of AAAI-97, pages 106-111. AAAI, 1997.
5. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9(1/2):105-131, 1996.
6. Robert Givan, Thomas Dean, and Matthew Greig. Equivalence notions and model minimization in markov decision processes. Submitted to Artificial Intelligence, 2001.
7. Robert Givan, Sonia Leach, and Thomas Dean. Bounded-parameter markov decision processes. Artificial Intelligence, 122:71-109, 2000.
8. J. Glover. Symmetry groups and translation invariant representations of markov processes. The Annals of Probability, 19(2):562-586, 1991.
9. J. Hartmanis and R. E. Stearns. Algebraic Structure Theory of Sequential Machines. Prentice-Hall, Englewood Cliffs, NJ, 1966.
10. Glenn A. Iba. A heuristic approach to the discovery of macro-operators. Machine Learning, 3:285-317, 1989.
11. J. R. Jump. A note on the iterative decomposition of finite automata. Information and Control, 15:424-435, 1969.
12. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
13. D. Lee and M. Yannakakis. Online minimization of transition systems. In Proceedings of 24th Annual ACM Symposium on the Theory of Computing, pages 264-274. ACM, 1992.
14. Doina Precup. Temporal Abstraction in Reinforcement Learning. PhD thesis, University of Massachusetts, Amherst, May 2000.
15. B. Ravindran and A. G. Barto. Symmetries and model minimization of markov decision processes. Technical Report 01-43, University of Massachusetts, Amherst, 2001.
16. Richard S. Sutton and Andrew G. Barto. Reinforcement Learning. An Introduction. MIT Press, Cambridge, MA, 1998.
17. Richard S. Sutton, Doina Precup, and Satinder Singh. Between MDPs and Semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence, 112:181-211, 1999.
18. C. J. C. H. Watkins. Learning from delayed rewards. PhD thesis, Cambridge University, Cambridge, England, 1989.
19. M. Zinkevich and T. Balch. Symmetry in markov decision processes and its implications for single agent and multi agent learning. In Proceedings of the 18th International Conference on Machine Learning, pages 632-640, San Francisco, CA, 2001. Morgan Kaufmann.