2015
DOI: 10.1016/j.sysconle.2015.03.003
|View full text |Cite
|
Sign up to set email alerts
|

Resource-aware MPC for constrained nonlinear systems: A self-triggered control approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 77 publications
(29 citation statements)
references
References 41 publications
0
29
0
Order By: Relevance
“…Easily can be seen that neither linear (q ) nor constant (r ) component is present in a MPC cost function (5).…”
Section: Cost Function Formulationmentioning
confidence: 99%
See 3 more Smart Citations
“…Easily can be seen that neither linear (q ) nor constant (r ) component is present in a MPC cost function (5).…”
Section: Cost Function Formulationmentioning
confidence: 99%
“…Also an on-line approach for improving performance of the off-line control and resource schedule, called Optimal Pointer Placement , is presented in this work. Interesting approaches can also be found in the literature dealing with the networked control systems (NCS), two main approaches oriented towards achieving resource utilization reduction (to save computation and communication resources) can be distinguished, namely, Event-Triggered Control (ETC) and Self-Triggered Control (STC) [5,6]. The control law in ETC and STC consists of a feedback controller that computes the control signals, and a triggering mechanism that determines when the control signals have to be updated.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…This implies that this particular schedule will be chosen for a smaller set of states in the state space. Define also V µ,M For any given x T k ∈ R n , T k ∈ N, the scheduling function Ω is defined by the optimization problem (12) which is adapted from Gommans and Heemels (2015). The intuition behind this definition of Ω is to select the schedule with the least number of required communications which guarantees (i) robust constraint satisfaction and (ii) a bound on the cost function which ensures the stabilization of a certain sequence of compact sets.…”
Section: Scheduling Functionmentioning
confidence: 99%