Constrained Risk-Averse Markov Decision Processes
Keywords:Planning with Markov Models (MDPs, POMDPs)
AbstractWe consider the problem of designing policies for Markov decision processes (MDPs) with dynamic coherent risk objectives and constraints. We begin by formulating the problem in a Lagrangian framework. Under the assumption that the risk objectives and constraints can be represented by a Markov risk transition mapping, we propose an optimization-based method to synthesize Markovian policies that lower-bound the constrained risk-averse problem. We demonstrate that the formulated optimization problems are in the form of difference convex programs (DCPs) and can be solved by the disciplined convex-concave programming (DCCP) framework. We show that these results generalize linear programs for constrained MDPs with total discounted expected costs and constraints. Finally, we illustrate the effectiveness of the proposed method with numerical experiments on a rover navigation problem involving conditional-value-at-risk (CVaR) and entropic-value-at-risk (EVaR) coherent risk measures.
How to Cite
Ahmadi, M., Rosolia, U., Ingham, M. D., Murray, R. M., & Ames, A. D. (2021). Constrained Risk-Averse Markov Decision Processes. Proceedings of the AAAI Conference on Artificial Intelligence, 35(13), 11718-11725. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/17393
AAAI Technical Track on Planning, Routing, and Scheduling