Optimal Temporal Logic Control for Deterministic Transition Systems with Probabilistic Penalties

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Optimal Temporal Logic Control for Deterministic Transition Systems with Probabilistic Penalties

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

Optimal Temporal Logic Control for Deterministic Transition Systems with Probabilistic Penalties

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2015

Kód důvěrnosti údajů

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

Název periodika

IEEE Transactions on Automatic Control

ISSN

0018-9286

e-ISSN

—

Svazek periodika

60

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

14

Strana od-do

1528-1541

Kód UT WoS článku

000355316200006

EID výsledku v databázi Scopus

—