Temporal Logic Control of Discrete-Time Piecewise Affine Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057211" target="_blank" >RIV/00216224:14330/12:00057211 - isvavai.cz</a>

Výsledek na webu

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

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Temporal Logic Control of Discrete-Time Piecewise Affine Systems

Popis výsledku v původním jazyce

We present a computational framework for automatic synthesis of a feedback control strategy for a discrete-time piece-wise affine (PWA) system from a specification given as a linear temporal logic (LTL) formula over an arbitrary set of linear predicatesin the system's state variables. Our approach consists of two main steps. First, by defining appropriate partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. Second, byleveraging ideas and techniques from LTL model checking and Rabin games, we develop an algorithm to generate a control strategy for the finite abstraction. While provably correct and robust to state measurements and small perturbations in the applied inputs, the overall procedure is conservative and expensive. The proposed algorithms have been implemented as a software package and made available for download. Illustrative examples are included.

Název v anglickém jazyce

Temporal Logic Control of Discrete-Time Piecewise Affine Systems

Popis výsledku anglicky

We present a computational framework for automatic synthesis of a feedback control strategy for a discrete-time piece-wise affine (PWA) system from a specification given as a linear temporal logic (LTL) formula over an arbitrary set of linear predicatesin the system's state variables. Our approach consists of two main steps. First, by defining appropriate partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. Second, byleveraging ideas and techniques from LTL model checking and Rabin games, we develop an algorithm to generate a control strategy for the finite abstraction. While provably correct and robust to state measurements and small perturbations in the applied inputs, the overall procedure is conservative and expensive. The proposed algorithms have been implemented as a software package and made available for download. Illustrative examples are included.

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)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

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

57

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

14

Strana od-do

1491-1504

Kód UT WoS článku

000304609300012

EID výsledku v databázi Scopus

—