Robust constrained model predictive control using linear matrix inequalities

43Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The primary disadvantage of current design techniques for model predictive control (MPC) is their inability to explicitly deal with model uncertainty. In this paper, we address the robustness issue in MPC by directly incorporating the description of plant uncertainty in the MPC problem formulation. The plant uncertainty is expressed in the time-domain by allowing the state-space matrices of the discrete-time plant to be arbitrarily time-varying and belonging to a polytope. The existence of a feedback control law minimizing an upper bound on the infinite horizon objective function and satisfying the input and output constraints is reduced to a convex optimization over linear matrix inequalities (LMIs). It is shown that for the plant uncertainty described by the polytope, the feasible receding horizon state feedback control design is robustly stabilizing.

Cite

CITATION STYLE

APA

Kothare, M. V., Balakrishnan, V., & Morari, M. (1994). Robust constrained model predictive control using linear matrix inequalities. In Proceedings of the American Control Conference (Vol. 1, pp. 440–444). American Automatic Control Council. https://doi.org/10.1109/acc.1994.751775

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free