DUFOUR, François; GENADOT, Alexandre

Métadonnées

Licence d’utilisation du document

DUFOUR, François
Quality control and dynamic reliability [CQFD]
Institut Polytechnique de Bordeaux [Bordeaux INP]
Institut de Mathématiques de Bordeaux [IMB]

GENADOT, Alexandre
Quality control and dynamic reliability [CQFD]
Institut de Mathématiques de Bordeaux [IMB]

Langue

Document de travail - Pré-publication

Résumé en anglais

In this work, we study discrete-time Markov decision processes (MDPs) under constraints with Borel state and action spaces and where all the performance functions have the same form of the expected total reward (ETR) criterion over the infinite time horizon. One of our objective is to propose a convex programming formulation for this type of MDPs. It will be shown that the values of the constrained control problem and the associated convex program coincide and that if there exists an optimal solution to the convex program then there exists a stationary randomized policy which is optimal for the MDP. It will be also shown that in the framework of constrained control problems, the supremum of the expected total rewards over the set of randomized policies is equal to the supremum of the expected total rewards over the set of stationary randomized policies. We consider standard hypotheses such as the so-called continuity-compactness conditions and a Slater-type condition. Our assumptions are quite weak to deal with cases that have not yet been addressed in the literature. An example is presented to illustrate our results with respect to those of the literature.< Réduire

Mots clés en anglais

Convex program

Markov decision process

Expected total reward criterion

Occupation measure

Constraints

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A convex programming approach for discrete-time Markov decision processes under the expected total reward criterion

Langue

Résumé en anglais

Mots clés en anglais

URI

Origine

Unités de recherche