Proceedings 0137
Proceedings 0137
Abstract— Development of a first principles model of a system mial nonlinear autoregressive exogenous (NARX) models are
is not only a time- and cost- consuming task, but often leads particular interesting, since they allow a direct interpretation
to model structures which are not directly usable to design a and analysis of the nonlinear input-output dependencies. Sev-
controller using current available methodologies. In this paper
we use a sparse identification procedure to obtain a nonlinear eral experimental studies have shown that many systems can
polynomial model. Since this is a NP-hard problem, a relaxed be accurately approximated by polynomial NARX models of
algorithm is employed to accelerate its convergence speed. The relatively small size (see e.g., [4], [5]).
obtained model is further used inside the nonlinear Extended In this contribution the objective is to identify a sparse
Prediction Self-Adaptive control (NEPSAC) approach to Non- nonlinear polynomial model using a modified version of
linear Model Predictive Control (NMPC), which replaces the
complex nonlinear optimization problem by a simpler iterative the Elastic Net regression algorithm originally proposed in
quadratic programming procedure. An organic Rankine cycle [6]. First it is essential to clarify what sparse means in this
system, characterized for presenting nonlinear time-varying context. It consists in approximating a function using a ‘few’
dynamics, is used as benchmark to illustrate the effectiveness basis functions properly selected within a ‘large’ set. More
of the proposed combined strategies. precisely, a sparse approximation is a linear combination of
fixed basis functions, where the vector of linear combination
I. INTRODUCTION
coefficients is sparse, i.e. it has only a ‘few’ non-zero
Today process industry is experiencing an increasing pro- elements. The pioneer work performed in [6], [7] shows
ductivity demand. This, together with tighter environmental that a sparse model can be obtained by making a basic
regulations, demanding economical considerations and the augmentation of the ordinary least squares solution, with the
need of operating in an energy-efficient manner, is forcing goal of obtaining a coefficient shrinkage and selection. The
industry to operate systems closer to the boundary of the augmentation often consists in including penalty functions to
admissible operating region, where productivity is often the least square problem, thus providing some regularization.
maximized. In this regard modeling and control design play In [6], [7] and the references therein, it is shown that for
an important role to achieve optimal operation of a system. sufficient amounts of regularization, solutions are sparse,
One of the control strategies which has been well-accepted i.e., some of the coefficients of the model are exactly zero,
by industry is Model Predictive Control (MPC) [1]. MPC leading to more compact models which are easier to interpret.
refers to a family of control approaches, which makes explicit The modification here proposed in section II, is used to
use of a model of the process to optimally obtain the control accelerate convergence speed by relaxing the optimization
signal by minimizing an objective function [2]. Due to this problem, whereas the goal is to minimize a combination
active use of a model, its performance is strongly linked to of the `1 - and `2 - norm of the parameter vector, with
the model’s ability to accurately predict the system dynamics. a constraint on the model accuracy. The relaxed Sparse
Real processes are inherently nonlinear, thus ideally a low- identification algorithm allows to obtain the structure of the
order nonlinear model and therefore a nonlinear MPC should model, then a second step is implemented by identifying
be used to control the system. However, linear predictive its coefficients using a least-squares criterion and applying
controllers have been predominantly used, this is due to pruning. Finally an input/output polynomial model of the
the easy to obtain linear parametric models compared to system with prescribed modeling error is obtained [8]. The
nonlinear ones [3]. methodology is similar to the one known as simulation error
Many model classes have been considered for nonlinear minimization with pruning (SEMP), which as reported in
identification purposes, e.g., Wiener or Hammerstein, neu- [9], can yield an increase in robustness for model selection
ronal networks, radial basis functions, support vector ma- compared to prediction error minimization (PEM) framework
chines and polynomial expansions. From those the polyno- with respect to low excitation identification conditions.
1 A.
Then the obtained polynomial model is used to construct
Hernandez, C. Ionescu and R. De Keyser are with
Faculty of Engineering and Architecture, Department of Electrical
a nonlinear MPC strategy, i.e., the Nonlinear Extended
energy, Systems and Automation, Ghent University, Belgium. Prediction Self-Adaptive Control (NEPSAC) approach to
[email protected] NMPC. This controller, fully described in [10], can deal
2 F. Ruiz is with Department of electronics engineering, Pontificia Uni-
with models in different formats (e.g. state-space, transfer
versidad Javeriana, Colombia. [email protected]
3 S. Quoilin and V. Lemort are with Thermodynamics Laboratory, Uni- functions, neuronal networks, polynomial parametric models,
versity of Liege, Belgium. [email protected] etc.) as it uses the nonlinear model for prediction directly,
ponents are mainly allocated in the evaporator, therefore where φ (x) = [φ1 (x), φ2 (x), . . . , φn (x)], φi : X → Y are known
research in modeling has been focused on finding a trade-off fixed basis functions, and a = [a1 , a2 , . . . , an ]T ∈ Rn is an
between model accuracy and simulation speed as evaluated in unknown coefficient vector.
[12], where finite volume and moving boundary approaches Problem 1: from the data set D, identify a coefficient
to evaporator modeling are proposed. vector a such that
Regarding the control design for ORC systems, it is (i) is sparse and
essential to guarantee a vapor quality at the inlet of the (ii) the identification error
expander, since liquid droplets can damage the machine. This
requirement can be achieved by ensuring a certain level of ˙ f 0 − f a k2
e( fa )=k (4)
superheating [13], [14]. For example, in [15] a feed-forward is small and bounded.
and gain-scheduled PI controller is proposed. In [16] an Sparse solutions may be preferred to full counterparts if
explicit multi-model MPC is applied to control superheating. the model can be assumed to be sparse or when interpretation
In conclusion, identifying a nonlinear model for superheating of the results can be important.
and achieving a proper regulation of this signal despite waste-
heat variations represents the target for the controller. B. Sparse Identification algorithm
The performance of the nonlinear identification and con- The sparsity of a vector is typically measured by the `0
trol algorithms is evaluated by developing a superheating quasi-norm, defined as the number of its non-zero elements.
control of an ORC system as described in section IV. Finally, Sparse identification can be performed by looking for a
the main outcome of this investigation is summarized in coefficient vector of the basis function linear combination
section V. with a ‘small’ `0 quasi-norm, that yields a ‘small’ prediction
error ε between the measured output ỹ and the predicted
output fa (x̃) = φ (x̃)a. Thus, a solution to problem 1 could
II. S PARSE I DENTIFICATION OF NONLINEAR FUNCTIONS be found by solving the following optimization problem:
In cases where an accurate first principle model is not a0 = arg minn kak0
a∈R (5)
available for a complex system, models deduced from ex- sub ject to kỹ − Φak2 ≤ ε
perimental data by means of system identification techniques
provide reliable alternatives. Whilst existing system identifi- with ε the maximum desired prediction error and
cation methods for linear systems can be considered to be at a
ỹ =
˙ (ỹ1 , . . . , ỹL )
mature stage, nonlinear system identification techniques still
reveal several fundamental issues to be resolved to further φ1 (x̃1 ) . . . φn (x̃1 )
improve general model performance. In this section a sparse Φ= ˙
.. . . .. (6)
. . .
identification algorithm of nonlinear functions is presented. φ1 (x̃L ) . . . φn (x̃L )
Identifying a sparse approximation of a function from a set =
˙ [φ1 (x̃) . . . φn (x̃)]
of data, possibly corrupted by noise, is what is called sparse
identification. It consists in constructing a sparse model However, the `0 is a non-convex function and therefore
which involves a minimum model variables and terms but can minimization of (5) is in general an NP-hard problem.
generate a maximum of model generalization performance. Similarly as proposed by [8], we propose a convex relaxation,
Therefore, a sparse approximation is a linear combination of where an optimization problem similar to (5) is solved, by
fixed basis functions, where the vector of linear combination replacing the `0 quasi-norm by a combination of a `1 and
coefficients is sparse, i.e. it has only a ‘few’ non-zero weighted `2 norms. The optimization problem (5) is thus
elements. redefined as a two-step algorithm:
1013
Step 1: solve the optimization problem x(t + k|t) and n(t + k|t) can be predicted by recursion of
1 −1 the process model (10) and by using filtering techniques on
a = arg minn L kak1 + β kak2
a∈R (7) the noise model (11), respectively [10].
s.t. kỹ − Φak2 ≤ ε
B. Optimization Procedure
with L the length of the data set, β a weighting coefficient A key element in linear MPC is the use of base (or
and ε the maximum expected prediction error. free) and optimizing (or forced) response concepts [2]. This
This structure of the optimization problem in equation (7) is however no longer valid for nonlinear processes, since
is chosen, as the `2 penalty ensures an unique solution also the superposition principle does not hold in that case. In
when the number of basis functions is larger than the data NEPSAC this is solved as follows:
length, and the `1 penalty offers variable selection via a The future response can then be expressed as:
sparse vector of coefficients a as demonstrated in [6].
Step 2: define a sub-space with the active basis of a1 y(t + k|t) = ybase (t + k|t) + yoptimize (t + k|t) (13)
and compute the estimate a∗ of a0 using least-squares of
The two contributing factors have the following origin:
prediction error
• ybase (t + k|t) is the effect of the past inputs, the apriori
a∗ = arg minn kỹ − Φai k2 defined future base control sequence ubase (t + k|t) and
ai ∈R
(8) the predicted disturbance n(t + k|t).
s.t. ai = 0, ∀i |a1i | < γ
• yoptimize (t + k|t) is the effect of the additions δ u(t + k|t)
with γ an additional tolerance value used for pruning, thus that are optimized and added to ubase (t + k|t), according
enhancing sparsity. to δ u(t + k|t) = u(t + k|t) − ubase (t + k|t). The effect of
Note that the major problem with regularization methods these additions is the discrete time convolution of ∆U =
is the optimal selection of the regularization parameters, in {δ u(t|t), . . . , δ u(t +Nu −1|t)} with the impulse response
this case γ, β and ε, which correspond to a complexity/bias coefficients of the system (G matrix), where Nu is the
vs. variance trade-off [6]. chosen control horizon.
III. NMPC-NEPSAC ALGORITHM The control ∆U is the solution to the following constrained
optimization problem:
A brief introduction to NEPSAC algorithm is presented in
N2
this section. For a detailed description the reader is referred
∆U =arg min ∑ [r(t + k|t) − y(t + k|t)]2
to [10] and [17]. ∆U∈ RNu k=N (14)
1
1014
quasi-steady-state situations, the number of iterations is low speed is kept constant at 3000 rpm to emulate an installation
(1 . . . 2) [17]. On the other hand, during transients the number directly connected to the grid.
of iterations might raise to 10 [17]. Regarding the optimal operation of the ORC unit, the
superheating and the evaporating temperature are the most
IV. C ASE STUDY: WASTE HEAT RECOVERY APPLICATION relevant variables to be controlled [19]. The superheating is
This section describes the architecture and main charac- defined as:
teristics of the Organic Rankine Cycle (ORC) system used
∆Tsh = Texp,su − Tsat,ev (15)
for evaluating the performance of the developed control
strategies.
where Texp,su is the temperature measured at the inlet of the
A. The Organic Rankine Cycle system expander and Tsat,ev the evaporating temperature, correspond-
ing to the temperature at which the fluid undergoes the phase
The ORC power unit investigated in this work is based transition from saturated liquid to saturated vapor at the fixed
on a sub-critical 11 kWel unit for stationary low temperature evaporating pressure Psat,ev .
waste heat recovery. The system is based on a regenerative
Research performed on ORC technology (e.g., [13], [14])
cycle and Solkatherm (SES36) as working fluid. The 11 kWel
has already established that to optimally operate the ORC
expander is originally a single screw compressor adapted to
power unit, two conditions need to be satisfied: 1) A ‘high’
run in expander mode.
efficiency and a safe operation of the ORC unit is achieved
if a minimum amount of superheating at expander inlet is
guaranteed. 2) For each heat source condition there exists
an optimal evaporating temperature which maximizes the
output power. In this study we will focus on fulfilling the
first condition, by designing a controller for superheating.
In order to assess the overall performance of the system the
net-output power Ẇel,net is computed:
1015
30
25 Data Linear Nonlinear
∆Tsh (q) −0.063q−1 +0.059q−2
= 1−2.44q−1 +1.955q−2 −0.51q−3
(17a) 20
∆ Tsh [°C]
N pp (q) 15
∆Tsh (q) 0.47q−1 10
= 1−0.51q−1
(17b)
Th f (q) 5
Error
Tsat,ev (q) −11
0.0017q −0.0017q −12
= 1−3.6q−1 +4.88q−2 −2.95q−3 +0.67q−4
(17e) −10
Th f (q)
Tsat,ev (q) −1 −2
2.43q −6.16q +5.33q −1.6q −3 −4
= 1−2.93q−1 +3.12q−2 −1.42q−3 +0.23q−4
(17f) −20
0 500 1000 1500 2000
mh f (q) Time [s]
2 (18)
y(k − r) ∗ mh f (k − r), N pp (k − r) ,
mhf [kg/s]
Thf [ºC]
1016
25
Next Generation Organic Rankine Cycles (www.orcnext.be),
20 funded by the Institute for the Promotion and Innovation by
Science and Technology in Flanders. This financial support
∆ T (°C)
15
10 is gratefully acknowledged
5 MPC NMPC SetPoint R EFERENCES
0
0 500 1000 1500 2000 [1] S. Qin and T. Badgwell., “A survey of industrial model predictive
Time (s)
control technology.” Control engineering practice, vol. 11, pp. 733–
2200 764, 2003.
2000
[2] E. F. Camacho and C. Bordons., Model Predictive Control, 2nd ed.
Npp (rpm)
1017