All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Policy learning in continuous-time Markov decision processes using Gaussian Processes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F17%3A00107689" target="_blank" >RIV/00216224:14330/17:00107689 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1016/j.peva.2017.08.007" target="_blank" >http://dx.doi.org/10.1016/j.peva.2017.08.007</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.peva.2017.08.007" target="_blank" >10.1016/j.peva.2017.08.007</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Policy learning in continuous-time Markov decision processes using Gaussian Processes

  • Original language description

    Continuous-time Markov decision processes provide a very powerful mathematical framework to solve policy-making problems in a wide range of applications, ranging from the control of populations to cyber–physical systems. The key problem to solve for these models is to efficiently compute an optimal policy to control the system in order to maximise the probability of satisfying a set of temporal logic specifications. Here we introduce a novel method based on statistical model checking and an unbiased estimation of a functional gradient in the space of possible policies. Our approach presents several advantages over the classical methods based on discretisation techniques, as it does not assume the a-priori knowledge of a model that can be replaced by a black-box, and does not suffer from state-space explosion. The use of a stochastic moment-based gradient ascent algorithm to guide our search considerably improves the efficiency of learning policies and accelerates the convergence using the momentum term. We demonstrate the strong performance of our approach on two examples of non-linear population models: an epidemiology model with no permanent recovery and a queuing system with non-deterministic choice.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA15-17564S" target="_blank" >GA15-17564S: Game Theory in Formal Analysis and Verification of Computer Systems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Performance Evaluation

  • ISSN

    0166-5316

  • e-ISSN

  • Volume of the periodical

    116

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    17

  • Pages from-to

    84-100

  • UT code for WoS article

    000413797400005

  • EID of the result in the Scopus database

    2-s2.0-85029590224