Metrics for Markov decision processes with infinite state spaces

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 201-208

  Ferns, Norm ^a   Panangaden, Prakash ^a   Precup, Doina ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BISIMULATIONS; CONTINUOUS STATE SPACE; INFINITE HORIZONS; INFINITE STATE SPACE; MARKOV DECISION PROCESSES; METRIC DISTANCES; OPTIMAL VALUE FUNCTIONS; PLANNING TASKS;

MARKOV PROCESSES;

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

References (21)

1. Anderson, E.J., & Nash, P. (1987). Linear Programming in Infinite-Dimensional Spaces John Wiley and Sons, Ltd.
2. Bernardo, M., & Bravetti, M. (2003). Performance measure sensitive congruences for Markovian process algebras. Theoretical Computer Science, 290, 117-160. (Pubitemid 35264420)
3. Blute, R., Desharnais, J., Edalat, A., & Panangaden, P. (1997). Bisimulation for labelled Markov processes. Proceedings of the Twelfth IEEE Symposium On Logic In Computer Science, Warsaw, Poland., 149-159.
4. Bouchard-Cǒté, A., Ferns, N., Panangaden, P., & Precup, D. (2005). An approximation algorithm for labeled Markov processes: towards realistic approximation. To appear in Proceedings of the 2nd International Conference on the Quantitative Evaluation of Systems (QEST).
5. Boutilier, C., Dean, T., & Hanks, S. (1999). Decisiontheoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11, 1-94. (Pubitemid 129628760)
6. Desharnais, J., Edalat, A., & Panangaden, P. (2002). Bisimulation for labeled Markov processes. Information and Computation, vol 179, 163-193.
7. Desharnais, J., Gupta, V., Jagadeesan, R., & Panangaden, P. (1999). Metrics for labeled Markov systems. International Conference on Concurrency Theory (pp. 258-273).
8. Desharnais, J., Gupta, V., Jagadeesan, R., & Panangaden, P. (2002). The metric analogue of weak bisimulation for probabilistic processes. Logic in Computer Science (pp. 413-422). IEEE Computer Society.
9. 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).
10. Gibbs, A. L., & Su, F. E. (2002). On choosing and bounding probability metrics. International Statistical Review, 70, (pp. 419-435).
11. Givan, R., Dean, T., & Greig, M. (2003). Equivalence notions and model minimization in markov decision processes. Artificial Intelligence, 147, 163-223.
12. Larsen, K., & Skou, A. (1991). Bisimulation through probabilistic testing. Information and Computation, 94, 1-28. (Pubitemid 21694897)
13. Milner, R. (1980). A calculus of communicating systems. Lecture Notes in Computer Science Vol. 92. Springer-Verlag.
14. 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.
15. Park, D. (1981). Concurrency and automata on infinite sequences. Proceedings of the 5th GI-Conference on Theoretical Computer Science (pp. 167-183). Springer-Verlag.
16. Puterman, M. L. (1994). Markov decision processes: Discrete stochastic dynamic programming. JohnWiley & Sons, Inc.
17. Rachev, S. T., & Rüschendorf L. (1998). Mass Transportation Problems, Vol. I: Theory. Springer, Berlin Heidelberg New York.
18. 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)
19. 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)
20. Villani, C. (2002). Topics in Mass Transportation. [http://www.math. toronto.edu/hmaroofi/ seminar/articles/Vilnotes.ps](28/07/03)
21. Winskel, G. (1993). The formal semantics of programming languages. Foundations of Computing. The MIT Press.