Multi-weighted Markov Decision Processes with Reachability Objectives - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Multi-weighted Markov Decision Processes with Reachability Objectives

Résumé

In this paper, we are interested in the synthesis of schedulers in double-weighted Markov decision processes, which satisfy both a percentile constraint over a weighted reachability condition, and a quantitative constraint on the expected value of a random variable defined using a weighted reacha-bility condition. This problem is inspired by the modelization of an electric-vehicle charging problem. We study the cartography of the problem, when one parameter varies, and show how a partial cartography can be obtained via two sequences of opimization problems. We discuss completeness and feasability of the method.
Fichier principal
Vignette du fichier
gandalf2018-BGMR.pdf (272.99 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01889020 , version 1 (05-10-2018)

Identifiants

Citer

Patricia Bouyer, Mauricio Gonzalez, Nicolas Markey, Mickaël Randour. Multi-weighted Markov Decision Processes with Reachability Objectives. Gandalf 2018 - Ninth International Symposium on Games, Automata, Logics, and Formal Verification, Sep 2018, Sarrebruck, Germany. pp.250 - 264, ⟨10.4204/EPTCS.277.18⟩. ⟨hal-01889020⟩
117 Consultations
112 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More