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”

Optimal Temporal Logic Control for Deterministic Transition Systems with Probabilistic Penalties

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00080609" target="_blank" >RIV/00216224:14330/15:00080609 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/TAC.2014.2381451" target="_blank" >http://dx.doi.org/10.1109/TAC.2014.2381451</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TAC.2014.2381451" target="_blank" >10.1109/TAC.2014.2381451</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimal Temporal Logic Control for Deterministic Transition Systems with Probabilistic Penalties

  • Original language description

    We consider an optimal control problem for a weighted deterministic transition system required to satisfy a constraint expressed as a Linear Temporal Logic (LTL) formula over its labels. By assuming that the executions of the system incur time-varying penalties modeled as Markov chains, our goal is to minimize the expected average cumulative penalty incurred between consecutive satisfactions of a desired property. Using concepts from theoretical computer science, we provide two solutions to this problem. First, we derive a provably correct optimal strategy within the class of strategies that do not exploit values of penalties sensed in real time. Second, we show that by taking advantage of locally sensing the penalties, we can construct heuristic strategies leading to lower collected penalty. While still ensuring satisfaction of the LTL constraint, we cannot guarantee optimality in the latter case. We provide a user-friendly implementation of the proposed algorithms and analysis of two

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2015

  • 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

    IEEE Transactions on Automatic Control

  • ISSN

    0018-9286

  • e-ISSN

  • Volume of the periodical

    60

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    14

  • Pages from-to

    1528-1541

  • UT code for WoS article

    000355316200006

  • EID of the result in the Scopus database