Professional Documents
Culture Documents
Abstract: In this paper, load frequency control by optimal control algorithm using quasi-Newton method for microgrid
introducing diesel generator and battery is discussed. In the proposed method, we consider microgrid model including
diesel generator and battery. Also, saturation is taken into account as a constraint on the input to the model of diesel
generator and battery. Then, a cost function considering the storage capacity constraint is formulated. Therefore, we
propose an algorithm using the quasi-Newton method to determine inputs that minimize the formalized cost function. In
addition to the quasi-Newton method, we propose an algorithm using Backward Sweep to match the terminal condition.
Finally, we confirm the effectiveness of the proposed method through numerical simulations.
Saturation
3. OPTIMAL CONTROL BASED ON
Battery Generator QUASI-NEWTON METHOD
INCLUDING SATURATION
Fig. 1 Power system model
In this chapter, we consider setting to solve a problem
Table 1 Definition of Symbols not including the terminal penalty of the first item in the
∆f Frequency deviation [Hz] equation (6). When including a terminal penalty, in ad-
∆PG Output of generator [pu] dition to the algorithm shown in this chapter, a method
∆PB Output of battery [pu] combining an optimal control algorithm by Backward
∆PGref Output command value of generator [pu] Sweep of chapter 4. We simplify it in order to empha-
∆PBref Output command value of battery [pu] size the algorithm by the quasi-Newton method. First,
∆uG Generation command value to generator [pu] for the cost function of the previous chapter, we define it
R Regulation constant [Hz/pu]
as the equations (8), (9).
M Inertia constant [pu・s/Hz]
D Damping constant [pu/Hz]
∫ tf
TT Turbine time constant [s] F (u) ≡ {xT Qx + satT [u] sat[u]} dt
t0
(8)
TG Generator time constant [s] ∫t
TB Battery time constant [s] G(u) ≡ E2 (t0 ) − t0 ∆PB (τ )dτ (9)
From Fig. 1, frequency deviation, diesel generator out- Therefore, the optimal control problem solving can be ex-
put fluctuation, governor output fluctuation and battery pressed as the equation (10).
output fluctuation can be expressed as the equations (1) -
(4). minu F (u), s.t. G(u) ≥ 0 (10)
∆f˙= − M
D
∆f + 1
M (∆PG + ∆PB ) (1)
∆ṖG = − T1T ∆PG + T1T ∆uG (2) There exist ∇F (u), ∇G(u) because F, G can be Frechet
ref
differentiable with respect to u. ∇F (u), ∇G(u) can be
∆u̇G = − T1G ∆uG + 1
TG sat[∆PG ] (3) expressed as the following equations (11), (12) [6].
ref
∆ṖB = − T1B ∆PB + 1
TB sat[∆PB ] (4)
∇F (u) = H0u (x(t), u(t), p0 (t)) (11)
For the equations (1) - (4), put it as follows.
∇G(u) = H1u (x(t), u(t), p1 (t)) (12)
x = [∆f ∆PG ∆uG ∆PB ]T , u = [∆PGref ∆PBref ]T
Therefore, it can be represented by a state space model H0u represents a partial differentiable of H0 with respect
such as the equation (5). to u. H0 , H1 , p0 , p1 can be expressed as the following
equations (13) - (16).
D 1 1
−M M 0 M 0 0
0 − T1T 1
TT 0 x + 01
0 ( )
ẋ = sat[u]
H0 (x, u, p0 ) = xT Qx + satT [u] sat[u]
0 0 − T1G 0 T
G
0
1
0 0 0 − T1B 0 TB
| {z } | {z } +pT0 (Ax + Bsat[u]) (13)
A B
(5) H1 (x, u, p1 ) = ∆PB + pT1 (Ax + Bsat[u]) (14)
ṗ0 (t) = −H0x (x(t), u(t), p0 (t))T , p0 (tf ) = 0 (15)
2.2. Cost function
ṗ1 (t) = −H1x (x(t), u(t), p1 (t))T , p1 (tf ) = 0 (16)
The cost function to be set in this paper expressed in
the following equations (6), (7).
∫ tf
We refer to [6] for deriving the definition of Hi , pi . On
J = β(E2 (tf ) − E2∗ )2 + t0
{xT Qx + satT [u] sat[u]} dt the other hand, the optimal condition in this chapter is as
(6) follows by using the Kuhn-Tucker condition.
∫t
s.t. E2 (t0 ) − t0
∆PB (τ )dτ ≥ 0 (7)
Optimal condition of Kuhn-Tucker:
β and Q = diag{q1 , q2 , q3 , q4 } represent the weights u∗ ∈ U is the optimal control input, and the Lagrangian
of the cost function. E2 (t) represents the storage capac- multiplier λ satisfies the following equations. In other
ity energy of battery. E2 (t0 ), E2 (tf ) represent the initial words, solving the equation (10) can result in a problem
959
of finding u∗ that satisfies the following condition. 0.03
0.02 umax
H0u (x(t), u∗ (t), p0 (t)) + λH1u (x(t), u∗ (t), p1 (t)) = θ S(v)
(17) 0.01
∫t
λ{E2 (t0 ) − t0 ∆PB (τ ) dτ } = 0, λ ≤ 0 (18) 0
umin
∫t umax
E2 (t0 ) − t0 ∆PB (τ ) dτ ≥ 0 (19)
-0.01
ẋ(t) = Ax + Bsat[u∗ ], x(t0 ) = x0 (20)
-0.02 umin
ṗ0 (t) = −H0x (x(t), u∗ (t), p0 (t))T , p0 (tf ) = 0 (21)
ṗ1 (t) = −H1x (x(t), u∗ (t), p1 (t))T , p1 (tf ) = 0 (22) -0.03
-0.03 -0.02 -0.01 0 0.01 0.02 0.03
k = 1. (j = 2, · · · , k − 1)
(26)
Step 2: Derive pki (i = 0, 1) by solving the equation (21),
(22). The new Lagrangian multiplier µ placed on behalf of λ
in the equation (24) is solved by a quadratic programming
Step 3: From the pki (i = 0, 1) derived in Step 2, problems such as the equations (27) - (33).
Hix (xk , uk , pki ), Hiu (xk , uk , pki ) (i = 0, 1) are derived.
However, since partial differentiable due to the input minµ 21 µT Λk µ − 12 αk (27)
of Hi is considered for saturation, it becomes impossi- k
s.t. − Λ µ ≥ β k
(28)
ble to differentiate at the switching point of saturation. where
Therefore, insert a differentiable saturation function S(v) ∫ tf T
1
such as Fig. 2. If the input v(t) to this function is re- αk = 2 H0ku ak0 dt
t0
(29)
garded as the manipulated variable of the controlled ob- ∫t
γ k = E2 (t0 ) − t0 ∆PBk (τ ) dτ (30)
ject, Hi can be partially differentiated with respect to the ∫t T
input. umax , umin represent the upper and lower limits ck = t0f H1ku ak0 dt (31)
for the input. k
β =c −γ k k
(32)
∫t T
umax − δ(umax − umin ) · exp(−1 + δ(uumax Λk = t0f H1ku ak1 dt (33)
−umin ) ),
max −v
v > umax − δ(umax − umin )
v−umin
S(v) = umin + δ(umax − umin ) · exp(−1 + δ(umax −umin ) ), By substituting µ into the equation (24), the search
v < u min + δ(u max − u min ) direction sk can be derived. At this time, if arbitrary
v, otherwise
ϵ > 0 satisfies the relationship ∥ sk ∥< ϵ, new input
(23) uk+1 = uk + sk can be updated. If it does not satisfy, we
update the input as uk+1 = uk + αk sk .
Step 4: Update the input using the D-F-P formula in the
quasi-Newton method.
Step 5: k = k + 1, and go back to Step 1.
The search direction s for determining the input of the
next step can be expressed as the equation (24).
4. OPTIMAL CONTROL BASED ON
k
s = −ak0 − µak1 (24) BACKWARD SWEEP
We consider a method of determining the input u
With dk−1 = uk − uk−1 , q k−1 = H0ku − H0k−1 u
+ that minimizes the cost function considering the terminal
λ k−1
{H1ku − H1k−1u
}, the update equation can be ex- penalty in this chapter. As a change from the previous
pressed as the following equations (25), (26). chapter, terminal condition such as equations (34), (35)
960
are considered for adjoint variables. the adjoint variable pi is the equation (47) - (49).
(
∂φ0
)T δ ẋ Ab (t) Bb (t) Cb (t) δx
ṗ0 (t) = −H0x (x, u, p0 )T , p0 (tf ) = ∂x (x(tf )) δ ṗ0 = Db (t) Eb (t) Fb (t) δp0 (47)
(34) δ ṗ1 Gb (t) Hb (t) Ib (t) δp1
( )T δx(t0 ) = 0 (48)
∂φ1
ṗ1 (t) = −H1x (x, u, p1 )T , p1 (tf ) = ∂x (x(tf ))
∂ 2 φi
(35) δpi (tf ) = ∂x2 (x(tf ))δx(tf ) + dei (49)
2 2
( )−1 ( 2 ) ( )−1 ( )T
H1 ∂ 2 H 0 ∂ 2 H1 ∂ 2 H1 2
H1 ∂ 2 H0 ∂ 2 H1 ∂f
Gb (t) = − ∂∂xH21 + ∂∂x∂u ∂u2 + λ ∂u2
∂ H0
∂u∂x + λ ∂u∂x , Hb (t) = ∂∂x∂u ∂u2 + λ ∂u2 ∂u
( )T 2
( )−1 ( )T
H1 ∂ 2 H0 ∂ 2 H1
Ib (t) = − ∂f
∂x + ∂∂x∂u ∂u2 + λ ∂u2 λ ∂u∂f
0.02
Disturbance[pu]
Step 1: As pi (t0 ) is the initial condition, solving numeri-
0
cally up to the terminal time tf using the optimal control
algorithm based on the quasi-Newton method including -0.02
the state x(t), the input u(t), the adjoint variable pi (t), 0 5 10 15 20 25
Time[sec]
and the Lagrangian multiplier λ(t).
Fig. 3 Disturbance
Step 2: Calculate the errors e0 , e1 of the terminal con-
dition by the equations (40), (41). Unless ∥e0 ∥, ∥e1 ∥ is The simulation results are shown in Figs. 4 - 6. From
sufficiently close to 0, go to Step 3. Fig. 4, it can be seen that the frequency deviation of the
time that the disturbance was given is not greatly differ-
Step 3: Numerically solve the equations (57) - (60) in the ent. However, the LPF+PI control requires more time
inverse time direction from the terminal time using the because the frequency deviation converges to zero. This
terminal condition (50), (51) to find matrix S0 , S1 and is also clear from the output of the diesel generator and
vector c0 , c1 . battery (Fig. 5). From the input of the diesel generator
and battery (Fig. 6) of the proposed method, it can also
be confirmed that saturation constraints on input are sat-
Step 4: Derive δpi (t0 ) using the equation (61).
isfied. Therefore, from the viewpoint of the convergence
speed, it is considered that the proposed method using co-
Step 5: pi (t0 ) := pi (t0 ) + δpi (t0 ), and go back to Step
operative control of the diesel generator and the battery is
1.
better.
5. NUMERICAL SIMULATION 0.15
0.1
0
TG Generator time constant 0.1[s]
TT Turbine time constant 5.0[s] -0.05
TB Battery time constant 0.3[s]
-0.1
E0 Power storage initial 0.5[pu]
∆PGref
max
Output fluctuation of generator upper limit 5.0 × 10−2 [pu] -0.15
0 5 10 15 20 25
Time[sec]
∆PGref
min
Output fluctuation of generator lower limit −5.0 × 10−2 [pu]
ref
∆PBmax Output fluctuation of battery upper limit 4.0 × 10−2 [pu] (b): LPF+PI control
ref
∆PBmin Output fluctuation of battery lower limit −4.0 × 10−2 [pu]
Fig. 4 Frequency deviation
962
0.05
Diesel generator
6. CONCLUSION
Battery
0
Newton method. Initially, we make a microgrid model
G
0
ity about the proposed method.
As a future work, convergence analysis of quasi-
G
Battery
REFERENCES
B
-0.02
963