including Biosystems
June 6-8, 2016. NTNU, Trondheim, Norway
Keywords: Process control, PID control, self-tuning control, data-driven control, extended
fictitious reference iterative tuning (E-FRIT)
It is assumed that the controlled object is described as the PID Controller System
following equation.
y(t) = f (φ(t − 1)), (1)
where, y(t) is the system output and f (·) indicates a non- Fig. 1. Block diagram of the data-driven proportional-
linear function whose output is determined by a historical integral-derivative (DD-PID) control system.
data vector φ(t − 1) (See Yamamoto et al. (2009)). The
historical data φ(t − 1) denotes as follows. PID gains at each step t are calculated by the following
φ(t − 1) := [y(t − 1), . . . , y(t − ny ), [STEP 2] and [STEP 3].
u(t − 1), . . . , u(t − nu )]. (2) [STEP 2] Calculate Distance and Select Neighbor Data
In (2), u(t) is the system input, ny and nu are orders of
y(t) and u(t), respectively. The distance between the query (which is the information
vector that indicates current system state) φ̄(t) and an
2.2 PID Control Law information vector φ̄(tj ) in the database is calculated by
the following L 1 norm with some weights.
When a PID controller is applied to process systems, ny +nu +1
φ̄l (t) − φ̄l (tj )
sometimes derivative kick depending on set value change d(φ̄(t), φ̄(tj )) =
max φ̄ (m) − min φ̄ (m) ,
causes problems for stability of a process. In order to avoid l=1 l l
the derivative kick, this paper introduces the following PID (8)
control law. This control law is known as I-PD control law. j = 1, . . . , N.
Δu(t) = KI (t)e(t) − KP (t)Δy(t) − KD (t)Δ2 y(t),
(3) In (8), φ̄l (t) expresses the l-th element in the j-th dataset,
and φ̄l (t) expresses the l-th element in the query at t.
where, e(t) is the control error between the set value r(t) Moreover, max φ̄l (m) and min φ̄l (m) indicate the maxi-
and the system output y(t), and is defined as mum value and minimum value of the l-th element of all
e(t) := r(t) − y(t). (4) datasets in the database. In this method, the datasets in
In (3), KP (t), KI (t) and KD (t) express the proportional the database are sorted in ascending order of their dis-
gain, the integral gain and the derivative gain, respectively. tance, and k-pieces of datasets with the smallest distances
Moreover, Δ denotes the differencing operator given by among them are chosen as neighbor datasets. Where, k is
Δ := 1 − z −1 , and z −1 is the backward operator which set by the user at will.
implies z −1 y(t) = y(t − 1). In the DD-PID method, these
[STEP 3] Compute PID gains
PID gains at each step t are adaptively tuned using a
database. From the selected k-pieces of neighbor datasets, a suitable
set of PID gains at t steps are computed by the following
2.3 Data-driven PID controller equation.
k k
This section explains the working principle of the DD-
K(t) = wi K(i), wi = 1, (9)
PID controller. In the DD-PID controller, an initial
i=1 i=1
database has to be created because the controller requires
a database for its actions. Thus, if a database does not where
exist, an initial database is created by the following pro- exp(−di )
wi = k . (10)
cedure.
exp(−di )
[STEP 1] Generate Initial Database
i=1
Initial operating data r0 (t), u0 (t), y0 (t) are obtained by
using an I-PD controller with fixed PID gains. Datasets The block diagram of the DD-PID controller is shown in
at each step are generated by obtained operating data, Fig. 1. By executing [STEP 2] and [STEP 3] every time,
and are sequentially stored in the database. The dataset the PID gains are adaptively tuned if the PID gains in
is defined by the following equation. the database are suitably tuned in advance. However, if
a result obtained by a fixed PID controller is applied to
Φ(j) = [φ̄(tj ), θ P ID (tj )], j = 1, 2, . . . , N. (5) create a database, then all PID gains included in the initial
Where, N indicates the total number of datasets. φ̄(tj ) information vectors may be equal. Expressed numerically,
and θ P ID (tj ) are expresses as follows. that is
φ̄(tj ) := [r0 (tj + 1), r0 (tj ), θ P ID (1) = θ P ID (2) = · · · = θ P ID (N ). (11)
y0 (tj ), . . . , y0 (tj − ny + 1),
In this case, the PID gains in the database have to be tuned
u0 (tj − 1), . . . , u0 (tj − nu + 1)] (6)
in an offline manner or online manner. The online learning
θ P ID (tj ) = [KP (tj ), KI (tj ), KD (tj )]. (7) method requires many experiments to get optimal PID
343
IFAC DYCOPS-CAB, 2016
June 6-8, 2016. NTNU, Trondheim, Norway
344
IFAC DYCOPS-CAB, 2016
June 6-8, 2016. NTNU, Trondheim, Norway
z −1 P (1)
Gm (z −1 ) = , (27)
P (z −1 )
P (z −1 ) = 1 + p1 z −1 + p2 z −2 , (28)
√ ⎫
ρ 4μ − 1
p1 = −2 exp − cos ρ ⎪ ⎪
⎪
2μ 2μ ⎪
⎪
⎬
ρ
p2 = exp − . (29)
μ ⎪
⎪
⎪
⎪
ρ := Ts /σ ⎪
⎭
μ := 0.25(1 − δ) + 0.51δ
In (29), Ts indicates the sampling time. σ and δ are
defined as the rise time and the attenuation parameter,
respectively, and these parameters are designed by the
user at will. Δũ(t) is calculated based on the relationship
between (3) and (20).
Δũ(t) = KI (t){r̃(t) − yr (t)}
− KP (t)Δyr (t) − KD (t)Δ2 yr (t). (30)
From the above relationship, the second term of the right
Fig. 3. Appearance of the heat exchange system.
side (23) is expanded as follows.
⎫
∂J(t + 1) ∂J(t + 1) ∂yr (t + 1) ∂ r̃(t) ⎪
⎪
∂yr (t + 1) ∂ r̃(t) ∂KP (t) ⎪
= ⎪
∂KP (t) ⎪
⎪
2 ⎪
⎪
∂Δũ(t) ∂Δũ(t) ⎪
⎪
+λfs ⎪
⎪
∂Δũ(t) ∂KP (t) ⎪
⎪
∂J(t + 1) ∂J(t + 1) ∂yr (t + 1) ∂ r̃(t) ⎪ ⎪
⎪
⎪
= ⎬
∂KI (t) ∂yr (t + 1) ∂ r̃(t) ∂KI (t) . (31)
∂Δũ(t)2 ∂Δũ(t) ⎪
⎪
+λfs ⎪
⎪
∂Δũ(t) ∂KI (t) ⎪
⎪
⎪
∂J(t + 1) ∂J(t + 1) ∂yr (t + 1) ∂ r̃(t) ⎪ ⎪
⎪
= ⎪
⎪
∂KD (t) ∂yr (t + 1) ∂ r̃(t) ∂KD (t) ⎪ ⎪
⎪
⎪
2
∂Δũ(t) ∂Δũ(t) ⎪
⎪
+λfs ⎭
∂Δũ(t) ∂KD (t)
The PID gains in the database are updated based on the
PID gains θ new
P ID (t) corrected by (23) as follows.
Φ(1) ← [φ̄(t1 ), θ new
P ID (t)],
Φ(j) ← [φ̄(tj ), ωj θ new
P ID (t)], j = 2, . . . , k. (32) Fig. 4. Appearance of the spiral heat exchanger.
It can execute offline learning to iterate the above proce-
dure until J(t) becomes small. Step7 Iterating from Step1 to Step 5 until (24) at each
step becomes small.
3.3 Algorithm
4. APPLICATION TO SPIRAL HEAT EXCHANGER
The proposed algorithm is summed up as follows:
In this paper, the proposed DD-PID controller is applied
Step1 Creating a query φ̄0 (t) from operating data, and to a heat exchange system shown in Fig.3. This system
calculating distance between φ̄0 (t) and all of the φ̄(j) by has two tanks for storing hot water and cold water,
(8). respectively, and conducts heat exchange by flowing these
waters into a spiral heat exchanger shown in Fig.4. In this
Step2 Sorting the database in ascending order of their experiment, the flow of cold water is fixed at 2.0 L/min,
distance, choosing out data from Φ(2) to Φ(k) as neighbor the temperature of hot water in the tank is kept at 50 ◦ C.
data. Then, the temperature of the cold water is controlled by
adjusting the flow of hot water. Moreover, the sampling
Step3 Calculating local PID gains θ P ID (t) using the time is set as Ts = 5 s, and reference value is set as follows.
neighbor data by (22).
33 ◦ C (0 ≤ t < 200s)
r(t) = . (33)
Step4 yr (t), r̃(t) and Δũ(t) are calculated by (25), (26) 40 ◦ C (200 ≤ t ≤ 400s)
and (30). First, the control result with the fixed PID controller is
shown in Fig.5. PID gains are determined as follows by
Step5 Calculating correction terms by (31) and calcu- the CHR method.
lating θ new
P ID (t) by (23).
KP = 3.62, KI = 0.65, KD = 3.75. (34)
Step6 Updating PID gains in the database by (32). Next, an initial database is designed by the above I/O
345
IFAC DYCOPS-CAB, 2016
June 6-8, 2016. NTNU, Trondheim, Norway
45
Temp. HEX[deg.]
this study, the updating rule of the PID parameters is
40
derived based on the criterion of the E-FRIT method;
35
it is shown that the database can be updated in an
30
offline manner using a set of experimental I/O data. The
25
effectiveness of the proposed method is experimentally
20
0 50 100 150 200 250 300 350 400 evaluated by applying it to a spiral heat exchanger. The
100
results show that the tracking property of the closed
loop system is improved by only a set of experimental
Valve aperture[%]
80
60
data. However, in this method, the calculated control
40
parameters may converge to a local solution because the
20
method obtains optimum parameters using the steepest
0
descent method. In the future, more suitable optimization
0 50 100 150 200 250 300 350 400
time [s] calculations of the PID gains should be considered.
40
80
60
the automatic control of generalized passice systems.
40
Trans. ASME, 74, 175–185.
20
Kaneko, O., Souma, S., and Fujii, T. (2005). A fictitious
0 reference iterative tuning (frit) in the two-degree of
0 50 100 150 200 250 300 350 400
time [s] freedom control scheme and its application to closed
loop system identification. Proc. of 16th IFAC World
Fig. 6. Control result using the proposed method. congress (CD-ROM).
Kano, M., Tasaka, K., Ogawa, M., Takinami, A., Taka-
4 hashi, S., and Yoshii, S. (2011). Extended fictitious
P
0
processes. Proc. of the 2011 4th International Sympo-
0 50 100 150 200 250 300 350 400
2
sium on Advanced Control of Industrial Processes (AD-
1.5
CONIP), 379–384.
Masuda, S., Kano, M., and Yasuda, Y. (2010). A fictitious
KI
0.5
reference iterative tuning method with simultaneous
0 50 100 150 200 250 300 350 400
delay parameter tuning of the reference model. Inter-
5
4
national Journal of Innovative Computing, Information
and Control, 6(4), 1–13.
D
3
K
2
Nakpong, N. and Yamamoto, S. (2012). Just-in-time
1
0 50 100 150 200
time [s]
250 300 350 400 predictive control for a two-wheeled robot. Proc. ICT-
KE2012, 95–98.
Fig. 7. Trajectories of PID gains corresponding to Fig.6. Stenman, A., Gustafsson, F., and Ljung, L. (1996). Just
in time models for dynamical systems. 35th IEEE
data and is learned by the proposed method. Where, Conference on Decision and Control, 1115–1120.
design parameters for the learning are set as k = 3, Vilanova, R. and Visioli, A. (2012). PID control in the
λ = 1.0, and the learning coefficients are set as follows. Third Millennium : lessons learned and new approaches.
η = [0.1 0.01 0.1]. (35) Springer.
In addition, the design polynomial is designed as follows. Wakitani, S., Nishida, K., Nakamoto, M., and Yamamoto,
T. (2013). Design of a data-driven pid controller using
P (z −1 ) = 1 − 1.03z −1 + 0.264z −2 . (36) operating data. Proc. 11th IFAC International Work-
The control result by the proposed DD-PID controller is shop on Adaptation and Learning in Control and Signal
as shown in Fig.6. Also, the trajectories of PID gains are Processing, 587–592.
shown in Fig.7. From the results, the tracking property of Yamamoto, T., Takao, K., and Yamada, T. (2009). Design
the closed loop system is improved by adjusting PID gains of a data-driven pid controller. IEEE Trans. Control
adaptively. Systems Technology, 17(1), 29–39.
Zheng, Q. and Kimura, H. (2001). Just-in-time pid control.
5. CONCLUSIONS The 44th Japan Joint Automatic Control Conference,
336–339.
In this paper, a new offline learning method of a DD-PID Ziegler, J.G. and Nichols, N.B. (1942). Optimum settings
controller based on the E-FRIT method is proposed. In for automatic controllers. Trans. ASME, 64(8), 759–768.
346