Mean field for Markov Decision Processes: from Discrete to Continuous Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Automatic Control Année : 2012

Mean field for Markov Decision Processes: from Discrete to Continuous Optimization

Nicolas Gast
Bruno Gaujal

Résumé

We study the convergence of Markov decision processes, composed of a large number of objects, to optimization problems on ordinary differential equations. We show that the optimal reward of such a Markov decision process, which satisfies a Bellman equation, converges to the solution of a continuous Hamilton-Jacobi-Bellman (HJB) equation based on the mean field approximation of the Markov decision process. We give bounds on the difference of the rewards and an algorithm for deriving an approximating solution to the Markov decision process from a solution of the HJB equations. We illustrate the method on three examples pertaining, respectively, to investment strategies, population dynamics control and scheduling in queues. They are used to illustrate and justify the construction of the controlled ODE and to show the advantage of solving a continuous HJB equation rather than a large discrete Bellman equation.

Dates et versions

hal-00787996 , version 1 (13-02-2013)

Identifiants

Citer

Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec. Mean field for Markov Decision Processes: from Discrete to Continuous Optimization. IEEE Transactions on Automatic Control, 2012, 57 (9), pp.2266 - 2280. ⟨10.1109/TAC.2012.2186176⟩. ⟨hal-00787996⟩
209 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More