Ev1 PDF
Ev1 PDF
Abstract—Electric vehicle (EV) fleets can provide ancillary base load or non-EV load to perform the optimal EV charging
services, such as frequency regulation, to the utility grid, if their control.
charging/discharging schedules are coordinated appropriately. In
this paper, a multi-level architecture for bidirectional vehicle-
to-grid regulation service is proposed. In this architecture, ag- V2G seeks to utilize the battery packs installed on EVs
gregators coordinate the charging/discharging schedules of EVs as energy storage to provide energy and ancillary services to
in order to meet their shares of regulation demand requested the grid [5]. It can be both unidirectional when EVs provide
by the grid operator. Based on this architecture, the scheduling ancillary services by modulating their charging rates, and
problem of V2G regulation is then formulated as a convex bidirectional when EVs are also allowed to discharge their
optimization problem, which in turn degenerates to an online
scheduling problem for charging/discharging of EVs. It requires batteries to inject energy back to the grid. Most research efforts
only the current and past regulation profiles, and does not depend on V2G ancillary services focus on frequency regulation
on the accurate forecast of regulation demand. A decentralized service. Frequency regulation is a zero-energy service that
algorithm, which enables every EV to solve its local optimization compensates the minute-to-minute fluctuations of generation
problem and obtain its own schedule, is applied to solve the online and demand [6]. Distributed control strategies based on local
scheduling problem. Based on the household driving pattern
and regulation signal data from the PJM market, a simulation frequency measurement have been proposed in [7], [8]. The
study of 1,000 EVs has been performed. The simulation results control strategy proposed in [7] ensures that an EV will be
show that the proposed online scheduling algorithm is able to charged to a desired level of state-of-charge (SOC), but it
smooth out the power fluctuations of the grid by coordinating the cannot achieve the global optimum among the EV fleet since
EV schedules, demonstrating the potential of V2G in providing the control is for a single EV and the discharging/charging
regulation service to the grid.
schedules of EVs are not coordinated. In [8], each EV decides
its own charging/discharging schedule in response to its locally
I. I NTRODUCTION
measured frequency deviation, but there is no guarantee on
Electric vehicles (EVs) can provide ancillary services, charging needs. Again, global optimum is not achievable.
such as regulation services, to the utility grid if their In [9], [10], centralized scheduling is employed where an
charging/discharging schedules are coordinated appropri- aggregator acts as the central controller. They try to optimize
ately. Therefore, the scheduling problem for EV charg- the schedules of the EV fleets so as to maximize the revenue of
ing/discharging is an important research topic in recent years. regulation service. However, they do not consider whether the
Most research on this topic falls into two categories: EV EVs are adequately charged. The concept of EV aggregators is
charging control and vehicle-to-grid (V2G) scheduling. applied in [9], [10], but no existing work has clearly specifiied
Studies on EV charging control regard the EV charging the structure or architecture of the V2G system consisting of
load as controllable load. Research on smart/coordinated EV the utility grid, aggregators, and EVs. Moreover, the functions
charging can be categorized as centralized control [1], [2], and relations of different parts of the system have not been
and decentralized control [3], [4]. They try to determine the well defined.
optimal EV charging schedules to minimize the distribution
system losses by flattening the total load without sacrificing the In this paper, we try to tackle the problems of V2G
charging needs of EVs. However, the centralized algorithms scheduling mentioned above. In Section II, we first propose
proposed in [1], [2] are inadequate due to high computational a multi-level architecture for bidirectional V2G regulation
complexity as the number of EVs scales up. This is one of service with three types of operation protocols. The scheduling
the key reasons why the decentralized control strategies [3], problem is then formulated as a convex optimization problem
[4], which distribute the computation to EVs and allow them which may be operated online with guarantees of adequate
to determine their schedules locally, are preferred, since the charging for EVs in Section III. A decentralized algorithm
penetration of EVs is expected to be high in the future. We is designed to solve the optimization problem in Section IV.
regard the formulation and algorithms proposed in [1]–[4] as Simulation results are presented and discussed in Section V.
forecast-based, since they all require accurate forecasts of the Finally, Section VI draws the conclusions.
44
IEEE SmartGridComm 2013 Symposium - Architectures and Models for the Smart Grid
where
or X NT
2 X
(R(Tk ) + Pn (Tk )) (8) F Pn (Tk ) := Pn (Ti ) (13)
n∈N i=k+1
P
We call the term n∈N Pn (Tk ) in (7) and (8) the aggre- is the sum of future charging/discharging profile of EV n.
gated EV power at Tk ∈ T . Since (7) is non-convex, it entails By (11), the conditional expectation of the sum of the future
a higher computational complexity for optimization than the regulation requests in (12) can be calculated as:
convex one (8). Thus, we choose (8) instead and introduce a
NT
forecast-based or offline formulation of the scheduling prob- X k
X
lem over the participation period T . Assume that, before the E( R(Ti ) | {R(Tj )|1 ≤ j ≤ k}) = − R(Tj ) (14)
participation period T , the aggregator receives the forecasting i=k+1 j=1
profile of its assigned regulation demand {R(Tk )|Tk ∈ T }.
Then, it coordinates the EVs to determine the optimal schedule Let Qn (Tk ) := (Pn (Tk ), F Pn (Tk )) be the schedule of EV
by the following optimization: n ∈ N , and Q(Tk ) := (Q1 (Tk ), Q2 (Tk ), . . . , QNEV (Tk ))
min
X
(R(Tk ) +
X
Pn (Tk ))2 (9)
denote the schedules of all EVs at time slot Tk ∈ T . We apply
{Pn (Tk )|n∈N ,Tk ∈T }
Tk ∈T n∈N
the lower bound derived in (12) and propose the formulation
of online scheduling for V2G frequency regulation as follows.
The optimization result of the forecast-based formulation (9) For any Tk ∈ T ,
provides the best possible schedule if the forecasting profile of min U (Q(Tk )) (15)
Q(Tk )
{R(Tk )|Tk ∈ T } is accurate. However, in reality, the forecast
of regulation demand is highly inaccurate and unreliable be- such that
cause regulation demand is vulnerable to forecasting errors of En,min X
k−1
generation and load. Therefore, the forecast-based formulation Pn (Tk ) + F Pn (Tk ) ≥ − Pn (Ti ) (16)
∆t i=1
is not appropriate or practical for frequency regulation.
Considering that regulation demand is derived from the Cn
Pn (Tk ) ≥ (SOCn,min − SOCn (Tk−1 )) (17)
regulation signals measured in real time, an online formula- ∆t
tion, which schedules the EV power in response to the real- Cn
Pn (Tk ) ≤ (SOCn,max − SOCn (Tk−1 )) (18)
time input of R(Tk ), is more realistic. At time slot Tk , the ∆t
aggregator receives the real-time signal of R(Tk ). It then Pn (Tk ) ≤ Pn (Tk ) ≤ Pn (Tk ) (19)
45
IEEE SmartGridComm 2013 Symposium - Architectures and Models for the Smart Grid
NT NT
X X Algorithm 1 Online Scheduling
Pn (Tk ) ≤ F Pn (Tk ) ≤ Pn (Tk ) (20)
i=k+1 i=k+1
Input: At any time slot Tk ∈ T , the aggregator knows the
total number of time slots, NT , and the number of EVs,
where NEV , and it has received the requests of regulation demand
P
2 {R(Ti )|1 ≤ i ≤ k}. Each EV n ∈ N knows about its own
(Pn∈N Pn (TNT ) + R(TNT ))
if k = NT
constraint set (16) – (20) and the constraint parameters.
2
U (Q(Tk )) := ( n∈N Pn (Tk ) + R(Tk )) + NT1−k ·
(P
Pk 2
Output: Schedule Q(Tk ) = (Q1 (Tk ), . . . , QNEV (Tk ).
n∈N F Pn (Tk ) − j=1 R(Tj )) otherwise
Choose a parameter β satisfying 0 < β < 2N1EV .
(21)
Initialize the schedule Q0n (Tk ) of every EV n ∈ N as:
(
The constraint set (16) – (20) is a simple transformation of (0, 0) k=1
the definitions and constraints (1) – (6) introduced in Section Q0n (Tk ) := (22)
(0, F Pn (Tk−1 )) otherwise
III-A.
It can be shown that the objective function (21) and the Set the iteration number m ← 1, repeat Steps 1) – 3).
set of feasible solutions under the constraint set (16) – (20) 1) The aggregator calculates the control signal sm (Tk ) as
follows. When k 6= NT :
are both convex. Therefore, the proposed formulation (15) –
(21) is a convex optimization problem. Although (15) only ∂U (Q(Tk )) ∂U (Q(Tk ))
sm (Tk ) := β( P , P )
seeks to optimize a lower bound of (10), it is tractable and ∂(
n∈N Pn (Tk )) ∂( n∈N F Pn (Tk ))
X m−1
more practical than (10). In addition, (15) requires much lower = 2β(R(Tk ) + Pn (Tk ),
computational complexity than (9) and (10) since it reduces n∈N
the number of variables needed significantly. 1
k
X X
( R(Tj ) + F Pnm−1 (Tk )))
NT − k j=1
IV. D ECENTRALIZED S CHEDULING A LGORITHM n∈N
(23)
In this section, we propose a decentralized algorithm to
solve the proposed convex optimization problem (15) – (21) When k = NT :
for V2G scheduling. ∂U (Q(TNT ))
Let h·, ·i represent the dot product operation and k·k denote sm (TNT ) := β( P , 0)
∂(n∈N Pn (TNT ))
the Euclidean norm. The proposed algorithm is presented in X m−1 (24)
= 2β(R(TNT ) + Pn (TNT ), 0)
Algorithm 1, which is inspired by the decentralized algorithm n∈N
proposed in the work of the optimal EV charging control [3].
The stopping criterion of Algorithm 1 can be based on the Then, it broadcasts the control signal sm (Tk ) to all
number of iteration performed, and/or the convergence of the EVs.
control signal sm within the convergence tolerance. At each 2) Each EV n ∈ N calculates a new schedule Qm n (Tk )
iteration, each EV n ∈ N solves an convex optimization as:
problem with only two variables Pn (Tk ) and F Pn (Tk ). Hence, Qm m
n (Tk ) := arg min (hs (Tk ), Qn (Tk )i
Qn (Tk )
Algorithm 1 requires very low computational cost. In addition, 1
2
+
Qn (Tk ) − Qm−1 (Tk )
) (25)
user information privacy can be preserved since the data 2
n
related to the driving patterns of the EV owner, including the s.t. (16), (17), (18), (19), (20) hold
SOC of the EV’s battery, the plug-in time, and plug-out time,
and reports Qmn (Tk ) to the aggregator.
do not need to be reported in advance to the aggregator.
3) If the stopping criterion is not met, set m ← m + 1
Theorem 1. The schedule Qm converges to the optimal and go to Step 1).
solution for the convex optimization problem (15) – (21) as Return Qn (Tk ) = Qm n (Tk ), ∀n ∈ N .
m → ∞.
The proof of Theorem 1 is similar to that of Theorem 3
in [3]. Therefore, we skip the proof due to the constraint in A. V2G Scheduling Algorithms
space. The forecast-based scheduling and the online scheduling
will be studied.
V. C ASE S TUDY As indicated in Section III-B, the forecast-based or offline
formulation (9) will provide the best possible scheduling
In this section, the performances of the proposed online results only when the forecast profile of the regulation requests
formulation and decentralized algorithm are studied by sim- is accurate. The performance of the forecast-based scheduling
ulation. We first outline a set of scheduling algorithms for with inaccurate forecast will also be tested. The forecast error
the provision of the V2G regulation service, followed by e(t) is introduced to the actual regulation request R(t) as:
a performance metric introduced for the comparison of the R(t) = (1 + e(t))Rf (t), t ∈ T (26)
scheduling algorithms. The simulation setup is then specified.
Finally, the simulation results are presented and discussed.
46
IEEE SmartGridComm 2013 Symposium - Architectures and Models for the Smart Grid
47
IEEE SmartGridComm 2013 Symposium - Architectures and Models for the Smart Grid
48