Robust constrained model predictive control using linear matrix inequalities

Mayuresh V. Kothare

doi:10.1016/0005-1098(96)00063-5

Return

Robust constrained model predictive control using linear matrix inequalities

1996-10-01

2.0K

PRE

Mayuresh V. Kothare

Balakrishnan, V

Manfred Morari

DOI：10.1016/0005-1098(96)00063-5

Original

Original request for help

Save

Abstract

En 中文

The primary disadvantage of current design techniques for model predictive control (MPC) is their inability to deal explicitly with plant model uncertainty. In this paper, we present a new approach for robust MPC synthesis that allows explicit incorporation of the description of plant uncertainty in the problem formulation The uncertainty is expressed in both the time and frequency domains. The goal is to design, at each time step, a state-feedback control law that minimizes a 'worst-case' infinite horizon objective function, subject to constraints on the control input and plant output. Using standard techniques, the problem of minimizing an upper bound on the 'worst-case' objective function, subject to input and output constraints, is reduced to a convex optimization involving linear matrix inequalities (LMIs). It is shown that the feasible receding horizon state-feedback control design robustly stabilizes the set of uncertain plants. Several extensions, such as application to systems with time delays, problems involving constant set-point tracking, trajectory tracking and disturbance rejection, which follow naturally from our formulation, are discussed. The controller design is illustrated with two examples. Copyright (C) 1996 Elsevier Science Ltd.

Keywords:

model predictive control

linear matrix inequalities

convex optimization

multivariable control systems

state-feedback

on-line operation

robust control

robust stability

time-varying systems

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.