In this article, I will consider Markov Decision Processes with two criteria, each denned as the expected value of an infinite horizon cumulative return. The second criterion is either itself subject to an inequality constraint, or there is maximum allowable probability that the single returns violate the constraint. I describe and discuss three new reinforcement learning approaches for solving such control problems. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Geibel, P. (2006). Reinforcement learning for MDPs with constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4212 LNAI, pp. 646–653). Springer Verlag. https://doi.org/10.1007/11871842_63
Mendeley helps you to discover research relevant for your work.