2016 IEEE 55th Conference on Decision and Control (CDC) 2016
DOI: 10.1109/cdc.2016.7799149
|View full text |Cite
|
Sign up to set email alerts
|

Symbolic control of systems with dead times using symbolic smith predictors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…In order to guarantee the satisfaction of the specification, it is necessary that a control input determined by a symbolic Smith controller is valid for all candidates listed by the predictor. Note that, if (16) does not hold, we cannot design a deadlock-free symbolic controller.…”
Section: Definitionmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to guarantee the satisfaction of the specification, it is necessary that a control input determined by a symbolic Smith controller is valid for all candidates listed by the predictor. Note that, if (16) does not hold, we cannot design a deadlock-free symbolic controller.…”
Section: Definitionmentioning
confidence: 99%
“…The authors extended the acASR-based symbolic synthesis to partial observation and delayed systems [13]- [17]. These approaches are extended to networked control systems [18], [19] Especially, in [16], the authors proposed a framework of a symbolic Smith controller, which proves that the Smith method is applicable not only in the classical control but also in symbolic control. A symbolic controller designed for a plant with no dead time is successfully extended to control a plant with a dead time by adding a predictor on plant states after the dead time is elapsed.…”
Section: Introductionmentioning
confidence: 99%
“…To discuss the relationship between a controlled system and desired behaviors (i.e., control specifications), simulation relations and alternating simulation relations have been introduced [24]. These have been extended to approximate simulation relations and approximate alternating simulation relations for the finite abstraction of infinite transition systems, such as hybrid systems [25], [26], [27], possibly with bounded disturbances [28], and cyber-physical systems [29], [30]. Recently, the authors extended control barrier functions to symbolic control barrier functions for abstraction-based formal synthesis, in which set invariance is enforced on a (physical) plant with a finite abstracted controller, despite unpredictable packet dropouts [31].…”
Section: Introductionmentioning
confidence: 99%