2017
DOI: 10.1002/rnc.3906
|View full text |Cite
|
Sign up to set email alerts
|

An improved robust model predictive control for linear parameter‐varying input‐output models

Abstract: Summary This paper describes a new robust model predictive control (MPC) scheme to control the discrete‐time linear parameter‐varying input‐output models subject to input and output constraints. Closed‐loop asymptotic stability is guaranteed by including a quadratic terminal cost and an ellipsoidal terminal set, which are solved offline, for the underlying online MPC optimization problem. The main attractive feature of the proposed scheme in comparison with previously published results is that all offline comp… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
21
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 34 publications
(29 citation statements)
references
References 37 publications
0
21
0
Order By: Relevance
“…The nominal states z i|k are computed according to the nominal model in (19) given p 0|k = p(k) (for computing the corresponding system matrix), where z 0|k = x(k). The tightened state and input constraint sets Z and V are computed offline from (17a) and (17b), respectively.…”
Section: Optimization Problemmentioning
confidence: 99%
See 1 more Smart Citation
“…The nominal states z i|k are computed according to the nominal model in (19) given p 0|k = p(k) (for computing the corresponding system matrix), where z 0|k = x(k). The tightened state and input constraint sets Z and V are computed offline from (17a) and (17b), respectively.…”
Section: Optimization Problemmentioning
confidence: 99%
“…Such a control problem has been rarely investigated in the context of LPVMPC, where most of the developed methods have focused on regulating the state of the controlled system to the origin or to a set point. Robust tracking MPC approaches for LPV systems have been developed recently in [19], which have achieved offset-free tracking for piecewise constant references. In [20]- [22] LPVMPC algorithms have been proposed for tracking time-varying reference trajectories, e.g., command trajectories in robotics applications.…”
Section: Introductionmentioning
confidence: 99%
“…when G [1] = G [2] and G [3] = −G [4] . In other cases, one can look for state transformations such that z(t) depends only on measurable/observable states, the (past) input and output (Abbas et al, 2017).…”
Section: Remarksmentioning
confidence: 99%
“…In this context, MPC for LPV systems with exogenous scheduling variables has received a fair degree of attention in recent years. Most of these approaches are based on a worst‐case objective function that minimizes maximum values of an objective function for different values of the scheduling variables, which results in conservatism, this conservatism can be partially addressed by relaxation techniques . MPC for a certain class of quasi‐LPV systems, specifically those derived from output nonlinear systems, was studied in Chisci et al, where stability guarantees for set point tracking were obtained by partitioning the state space and deriving the terminal ingredients for each partition.…”
Section: Introductionmentioning
confidence: 99%