Algebraic Markov Decision Processes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2005

Algebraic Markov Decision Processes

Patrice Perny
Olivier Spanjaard
Paul Weng
  • Fonction : Auteur
  • PersonId : 952563

Résumé

In this paper, we provide an algebraic approach to Markov Decision Processes (MDPs), which allows a unified treatment of MDPs and includes many existing models (quantitative or qualitative) as particular cases. In algebraic MDPs, rewards are expressed in a semiring structure, uncertainty is represented by a decomposable plausibility measure valued on a second semiring structure, and preferences over policies are represented by Generalized Expected Utility. We recast the problem of finding an optimal policy at a finite horizon as an algebraic path problem in a decision rule graph where arcs are valued by functions, which justifies the use of the Jacobi algorithm to solve algebraic Bellman equations. In order to show the potential of this general approach, we exhibit new variations of MDPs, admitting complete or partial preference structures, as well as probabilistic or possibilistic representation of uncertainty.
Fichier principal
Vignette du fichier
pub_359_1_1677.pdf (191.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01492606 , version 1 (10-07-2017)

Identifiants

  • HAL Id : hal-01492606 , version 1

Citer

Patrice Perny, Olivier Spanjaard, Paul Weng. Algebraic Markov Decision Processes. 19th International Joint Conference on Artificial Intelligence, Jul 2005, Edinburgh, United Kingdom. pp.1372-1377. ⟨hal-01492606⟩
169 Consultations
143 Téléchargements

Partager

Gmail Facebook X LinkedIn More