Detailed Information on Publication Record
2016
Optimal observation mode scheduling for systems under temporal constraints
TESAŘOVÁ, Eva, Mária SVOREŇOVÁ, Jiří BARNAT and Ivana ČERNÁBasic information
Original name
Optimal observation mode scheduling for systems under temporal constraints
Name in Czech
Optimal observation mode scheduling for systems under temporal constraints
Authors
TESAŘOVÁ, Eva (203 Czech Republic, belonging to the institution), Mária SVOREŇOVÁ (703 Slovakia, belonging to the institution), Jiří BARNAT (203 Czech Republic, belonging to the institution) and Ivana ČERNÁ (203 Czech Republic, guarantor, belonging to the institution)
Edition
Boston, 2016 American Control Conference (ACC), p. 1099-1104, 6 pp. 2016
Publisher
IEEE Conference Publications
Other information
Language
English
Type of outcome
Stať ve sborníku
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
United States of America
Confidentiality degree
není předmětem státního či obchodního tajemství
Publication form
storage medium (CD, DVD, flash disk)
References:
RIV identification code
RIV/00216224:14330/16:00088275
Organization unit
Faculty of Informatics
ISBN
978-1-4673-8682-1
ISSN
UT WoS
000388376101024
Keywords in English
Formal verification/synthesis; Optimal control; Uncertain systems
Tags
Tags
International impact, Reviewed
Změněno: 13/5/2020 19:37, RNDr. Pavel Šmerk, Ph.D.
Abstract
V originále
Modern control systems use various sensors to decrease the amount of uncertainty under which they operate. While providing observation of the current state of the system, sensors require resources such as energy, time and commu- nication. We consider discrete models of such systems with non-deterministic control transitions and multiple observation modes that provide different information about the system’s states. We consider two control problems. First, we aim to construct a control and observation mode scheduling strategy that guarantees satisfaction of a finite-time temporal property given as a formula of syntactically co-safe fragment of LTL (scLTL) and at the same time, minimizes the worst-case cost associated with observation modes until the point of satisfaction. Second, the bounded version of the problem is considered, where the temporal property must be satisfied within given finite time bound. We present correct and optimal solutions to both problems and demonstrate their usability on a case study motivated by robotic applications.
Links
GA15-08772S, research and development project |
| ||
MUNI/A/0945/2015, interní kód MU |
|