In recent years the MPC landscape has changeddrastically, with a large increase in the number of reported applications, significant improvements intechnical capability, and mergers between several of the vendor companies. The primary purpose of thispaper is to present an updated, representative snapshotof commercially available MPC technology. The in-formation reported here was collected from vendorsstarting in mid-1999, reflecting the status of MPCpractice just prior to the new millennium, roughly 25years after the first applications.A brief history of MPC technology development ispresented first, followed by the results of our industrialsurvey. Significant features of each offering are outlinedand discussed. MPC applications to date by each vendorare then summarized by application area. The finalsection presents a view of next-generation MPCtechnology, emphasizing potential business and researchopportunities.
2. A brief history of industrial MPC
This section presents an abbreviated history of industrial MPC technology.Fig. 1shows an evolution-ary tree for the most significant industrial MPCalgorithms, illustrating their connections in a conciseway. Control algorithms are emphasized here becauserelatively little information is available on the develop-ment of industrial identification technology. The follow-ing sub-sections describe key algorithms on the MPCevolutionary tree.
2.1. LQG
The development of modern control concepts can betraced to the work of Kalman et al. in the early 1960s(Kalman, 1960a, b). A greatly simplified description of their results will be presented here as a reference pointfor the discussion to come. In the discrete-time context,the process considered by Kalman and co-workers canbe described by a discrete-time, linear state-space model:
x
k
þ
1
¼
Ax
k
þ
Bu
k
þ
Gw
k
;
ð
1a
Þ
y
k
¼
Cx
k
þ
n
k
:
ð
1b
Þ
The vector
u
represents process inputs, or manipulatedvariables, and vector
y
describes measured processoutputs. The vector
x
represents process states to becontrolled. The state disturbance
w
k
and measurementnoise
n
k
are independent Gaussian noise with zeromean. The initial state
x
0
is assumed to be Gaussianwith non-zero mean.The objective function
F
to be minimizedpenalizes expected values of squared input and statedeviations from the origin and includes separate stateand input weight matrices
Q
and
R
to allow for tuningtrade-offs:
F
¼
E
ð
J
Þ
;
J
¼
X
N
j
¼
1
ðjj
x
k
þ
j
jj
2
Q
þ jj
u
k
þ
j
jj
2
R
Þ
:
ð
2
Þ
The norm terms in the objective function are defined asfollows:
jj
x
jj
2
Q
¼
x
T
Qx
:
ð
3
Þ
Implicit in this formulation is the assumption that allvariables are written in terms of deviations from adesired steady state. It was found that the solution tothis problem, known as the
linear quadratic Gaussian
(LQG) controller, involves two separate steps. At timeinterval
k
;
the output measurement
y
k
is first used toobtain an optimal state estimate
#
x
k
j
k
:
#
x
k
j
k
À
1
¼
A
#
x
k
À
1
j
k
À
1
þ
Bu
k
À
1
;
ð
4a
Þ
#
x
k
j
k
¼
#
x
k
j
k
À
1
þ
K
f
ð
y
k
À
C
#
x
k
j
k
À
1
Þ
:
ð
4b
Þ
Then the optimal input
u
k
is computed using an optimalproportional state controller:
u
k
¼ À
K
c
#
x
k
j
k
:
ð
5
Þ
LQG
IDCOM-MHIECON
SMCAPCTPFCIDCOMSMOC
Connoisseur
DMCDMC+QDMCRMPCRMPCT
19601970198019902000
1st generationMPC2nd generationMPC3rd generationMPC4th generationMPC
Fig. 1. Approximate genealogy of linear MPC algorithms.
S.J. Qin, T.A. Badgwell / Control Engineering Practice 11 (2003) 733–764
734