2020
DOI: 10.1109/tac.2019.2953147
|View full text |Cite
|
Sign up to set email alerts
|

Lebesgue-Approximation Model Predictive Control of Nonlinear Sampled-Data Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 20 publications
(13 citation statements)
references
References 30 publications
0
13
0
Order By: Relevance
“…Remark 8: Event generator a i is used to save the network transmission resources. However, compared with the works [33], [34], event generator b i is used to prevent the control packet − → U i (t i mi ) ′ s size from getting too large.…”
Section: ûI ( Timentioning
confidence: 99%
See 2 more Smart Citations
“…Remark 8: Event generator a i is used to save the network transmission resources. However, compared with the works [33], [34], event generator b i is used to prevent the control packet − → U i (t i mi ) ′ s size from getting too large.…”
Section: ûI ( Timentioning
confidence: 99%
“…For (34), it can be easily deduced by taking into account that µ i (t i 0 ) = μi (t i 0 ) and the event-triggering conditions in (3-4) for event generator a i and (11-14), (17)(18)(19)(20)(21) for event generatorb i are the same.…”
Section: Establishing the Geschlossenes System Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…It is worth pointing out, however, that all the previously mentioned work on aperiodic sampled‐data MPC only focuses on when to solve the FHOCP, while leaving the FHOCP itself still continuous‐time. Recently, a Lebesgue approximation based MPC approach was proposed in References 30 and 31 for nonlinear systems, where the sampling time and the state transitions in the approximation model are both aperiodic and state‐dependent. It can enlarge the inter‐sampling time intervals, while reducing the number of steps in the discrete‐time FHOCP to prediction the same length of horizon in continuous‐time domain.…”
Section: Introductionmentioning
confidence: 99%
“…In [18], two approaches are proposed to solve the chance-constrained predictive control based on max-affine form, then probabilistic and chance constraints can be transformed into linear constraints by Chebyshev's inequality, which yields a faster convergence and a lower closed-loop cost. Moreover, there are other results which have made a number of significant contributions to this field (see [19][20][21][22][23] and the references therein).…”
Section: Introductionmentioning
confidence: 99%