Methods for computing state similarity in Markov decision processes

Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence, UAI 2006

Volumn , Issue , 2006, Pages 174-181

  Ferns, Norm ^a   Castro, Pablo Samuel ^a   Precup, Doina ^a   Panangaden, Prakash ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL EQUIVALENCE; BISIMULATIONS; DISTANCE FUNCTIONS; EMPIRICAL EVALUATIONS; INTEGRAL COMPONENTS; KANTOROVICH METRIC; LARGE PROBABILISTIC SYSTEMS; MARKOV DECISION PROCESSES; NETWORK OPTIMIZATION; SPACE COMPLEXITY; STATE AGGREGATION; STATISTICAL SAMPLING;

ARTIFICIAL INTELLIGENCE; MARKOV PROCESSES; SAMPLING;

PROBABILITY DISTRIBUTIONS;

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

References (16)

1. Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1-94. (Pubitemid 129628760)
2. Boutilier, C., Dearden, R., & Goldszmidt, M. (1995). Exploiting structure in policy construction. IJCAI, 14, 1104-1113.
3. Desharnais, J., Gupta, V., Jagadeesan, R., & Panangaden, P. (1999). Metrics for labeled Markov systems. International Conference on Concurrency Theory (pp. 258-273).
4. Ferns, N., Panangaden, P., & Precup, D. (2004) Metrics for finite Markov decision processes Proceedings of the 20th conference on Uncertainty in artificial intelligence (pp. 162-169).
5. Ferns, N., Panangaden, P., & Precup, D. (2005) Metrics for Markov decision processes with infinite state spaces Proceedings of the 21st conference on Uncertainty in artificial intelligence (pp. 201-208).
6. Frangioni, A., & Manca, A. (2006). A Computational Study of Cost Reoptimization for Min Cost Flow Problems INFORMS Journal On Computing, 18(1), (pp. 61 - 70). (Pubitemid 43515946)
7. Givan, R., Dean, T., & Greig, M. (2003). Equivalence notions and model minimization in markov decision processes. Artificial Intelligence, 147, 163-223.
8. Larsen, K., & Skou, A. (1991). Bisimulation through probabilistic testing. Information and Computation, 94, 1-28. (Pubitemid 21694897)
9. Milner, R. (1980). A calculus of communicating systems. Lecture Notes in Computer Science Vol. 92. Springer-Verlag.
10. Munkres, J. (1957). Algorithms for the assignment and transportation problems. J. SIAM (pp. 32-38)
11. Orlin, J. (1988). A faster strongly polynomial minimum cost flow algorithm. Proceedings of the Twentieth annual ACM symposium on Theory of Computing (pp. 377-387). ACM Press.
12. Park, D. (1981). Concurrency and automata on infinite sequences. Proceedings of the 5th GI-Conference on Theoretical Computer Science (pp. 167-183). Springer-Verlag.
13. Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons, Inc.
14. van Breugel, F., & Worrell, J. (2001). Towards quantitative verification of probabilistic transition systems. Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP), (pp. 421-432) Springer-Verlag. (Pubitemid 33300818)
15. van Breugel, F., & Worrell, J. (2001). An algorithm for quantitative verification of probabilistic transition systems. Proceedings of the 12th International Conference on Concurrency Theory (pp. 336-350). Springer-Verlag. (Pubitemid 33326666)
16. Villani, C. (2002). Topics in Mass Transportation. [http://www.math. toronto.edu/hmaroofi/seminar/articles/Vilnotes.ps](28/07/03)