Discounted Markov Decision Processes with Constrained Costs: the decomposition approach

¹ Laboratory TIAD, Faculty of Sciences and Techniques, Sultan Moulay Slimane University, Campus Mghilla, Beni Mellal, Morocco
² Laboratory of Computer Sciences, Faculty of Sciences Kenitra, IbnTofail University, Morocco

^* Corresponding author: abd_semmouri@yahoo.fr

Abstract

In this paper we consider a constrained optimization of discrete time Markov Decision Processes (MDPs) with finite state and action spaces, which accumulate both a reward and costs at each decision epoch. We will study the problem of finding a policy that maximizes the expected total discounted reward subject to the constraints that the expected total discounted costs are not greater than given values. Thus, we will investigate the decomposition method of the state space into the strongly communicating classes for computing an optimal or a nearly optimal stationary policy. The discounted criterion has many applications in several areas such that the Forest Management, the Management of Energy Consumption, the finance, the Communication System (Mobile Networks) and the artificial intelligence.