2012
DOI: 10.1007/s10626-012-0155-x
|View full text |Cite
|
Sign up to set email alerts
|

Minimum attention control for linear systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0
2

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 38 publications
(34 citation statements)
references
References 19 publications
0
32
0
2
Order By: Relevance
“…The corresponding control input and the next time the controller needs to execute for an initial state inside the polytope are obtained based on a slightly modified version of the self-triggered controller approach in [DTH14]. From the transition graph, we know that if the initial state is in a particular polytope, the trajectory can only end up in a subset of polytopes.…”
Section: Online Stepmentioning
confidence: 99%
See 4 more Smart Citations
“…The corresponding control input and the next time the controller needs to execute for an initial state inside the polytope are obtained based on a slightly modified version of the self-triggered controller approach in [DTH14]. From the transition graph, we know that if the initial state is in a particular polytope, the trajectory can only end up in a subset of polytopes.…”
Section: Online Stepmentioning
confidence: 99%
“…From the transition graph, we know that if the initial state is in a particular polytope, the trajectory can only end up in a subset of polytopes. Then, we shall solve the minimum attention control problem [DTH14], but enforcing extra constraints such that the final state of the plant after running in open-loop is guaranteed to be within this subset of polytopes. The problem remains a linear feasibility problem and, therefore, is of the same complexity order as the proposed approach in [DTH14].…”
Section: Online Stepmentioning
confidence: 99%
See 3 more Smart Citations