Multi-weighted Markov Decision Processes with Reachability Objectives

Multi-weighted Markov Decision Processes with Reachability Objectives

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 reachabil...

Full description

Bibliographic Details
Main Authors: Patricia Bouyer, Mauricio González, Nicolas Markey, Mickael Randour
Format: Article
Language:English
Published: Open Publishing Association 2018-09-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1809.03107v1
id doaj-3cae925e086c4b859920046a2abb280f
record_format Article
spelling doaj-3cae925e086c4b859920046a2abb280f2020-11-25T02:43:14ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802018-09-01277Proc. GandALF 201825026410.4204/EPTCS.277.18:23Multi-weighted Markov Decision Processes with Reachability ObjectivesPatricia BouyerMauricio GonzálezNicolas MarkeyMickael RandourIn 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 reachability 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.http://arxiv.org/pdf/1809.03107v1
collection DOAJ
language English
format Article
sources DOAJ
author Patricia Bouyer
Mauricio González
Nicolas Markey
Mickael Randour
spellingShingle Patricia Bouyer
Mauricio González
Nicolas Markey
Mickael Randour
Multi-weighted Markov Decision Processes with Reachability Objectives
Electronic Proceedings in Theoretical Computer Science
author_facet Patricia Bouyer
Mauricio González
Nicolas Markey
Mickael Randour
author_sort Patricia Bouyer
title Multi-weighted Markov Decision Processes with Reachability Objectives
title_short Multi-weighted Markov Decision Processes with Reachability Objectives
title_full Multi-weighted Markov Decision Processes with Reachability Objectives
title_fullStr Multi-weighted Markov Decision Processes with Reachability Objectives
title_full_unstemmed Multi-weighted Markov Decision Processes with Reachability Objectives
title_sort multi-weighted markov decision processes with reachability objectives
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2018-09-01
description 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 reachability 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.
url http://arxiv.org/pdf/1809.03107v1
work_keys_str_mv AT patriciabouyer multiweightedmarkovdecisionprocesseswithreachabilityobjectives
AT mauriciogonzalez multiweightedmarkovdecisionprocesseswithreachabilityobjectives
AT nicolasmarkey multiweightedmarkovdecisionprocesseswithreachabilityobjectives
AT mickaelrandour multiweightedmarkovdecisionprocesseswithreachabilityobjectives
_version_ 1724770599509688320

Similar Items