This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Vehicle-to-Grid Fleet Service Provision
considering Nonlinear Battery Behaviors

Joshua Jaworski, Ningkun Zheng, , Matthias Preindl, , Bolun Xu J. Jaworski, N. Zheng, M. Preindl and B. Xu are with Columbia University, NY, USA. Contact: {jjj2146, nz2343, mp3501, bx2177}@columbia.edu.
Abstract

The surging adoption of electric vehicles (EV) calls for accurate and efficient approaches to coordinate with the power grid operation. By being responsive to distribution grid limits and time-varying electricity prices, EV charging stations can minimize their charging costs while aiding grid operation simultaneously. In this study, we investigate the economic benefit of vehicle-to-grid (V2G) using real-time price data from New York State and a real-world charging network dataset. We incorporate nonlinear battery models and price uncertainty into the V2G management design to provide a realistic estimation of cost savings from different V2G options. The proposed control method is computationally tractable when scaling up to real-world applications. We show that our proposed algorithm leads to an average of 35% charging cost savings compared to uncontrolled charging when considering unidirectional charging, and bi-directional V2G enables additional 18%\% cost savings compared to unidirectional smart charging. Our result also shows the importance of using more accurate nonlinear battery models in V2G controllers and evaluating the cost of price uncertainties over V2G.

Index Terms:
Energy storage, stochastic optimal control, electric vehicle charging, vehicle-to-grid.

I Introduction

The International Energy Agency’s (IEA) roadmap to achieve net zero greenhouse gas (GHG) emissions by 2050 calls for an increase in the share of renewable energy in total global power generation and global transport sector electrification from 29% and 2% in 2020 to 90% and 45% in 2050, respectively [1, 2]. However, increasing energy supply intermittency and electric vehicles (EV) charging demand can put significant stress on the grid without adequate management and control, such as peak charging demand during periods of low wind and solar power generation [3]. Smart charging integrates external data, such as distribution grid constraints or time-varying electricity prices, into unidirectional (V1G) or bidirectional (V2G) power transfer management between the grid and the EV charging station (EVCS) [4]. Smart charging and V2G management have emerged as a key strategy to accelerate transportation electrification to support an increasingly renewable-powered grid operation, minimizing EV owners’ charging cost, and leading new business models and job opportunities [3, 5, 6, 7].

As the cost of V2G-compatible chargers continues to decline [8], software development becomes pivotal to efficiently aggregate EVs and optimally control their V2G responses while meeting the designated charging targets. While plenty of works have conducted techno-economic analyses (TEA) of V2G  [9, 10, 11, 12], few have considered complicating factors that practical V2G implementations must address. We group these factors into three categories. The first is battery model nonlinearities, in which the battery voltage, current, efficiency, and degradation depend on the state of charge (SoC). Controlling EV batteries accurately according to their nonlinear characteristics is crucial to strike a balance between ensuring battery security and economic benefits [13]. The second is grid uncertainty, that the distribution grid load and electricity prices are time-varying and uncertain [7]. Uncertainties are often neglected in TEA primarily due to computation difficulties, but practical V2G implementations must consider uncertainties in price-response applications. The last is computational scalability, the V2G management software must manage tens to hundreds of EVs without consuming monstrous computing power. As we will later be shown in our results, while the aggregate benefit of V2G is pivotal for future grids, economic saving for each individual EV is not significant to justify investment in specialized computing hardware.

This paper presents a computation-efficient V2G management framework and a realistic case study integrating the aforementioned complicating factors in practical V2G implementations. Our contributions include:

  • We propose a computation-efficient and scalable V2G management controller which optimizes V2G charging using accurate nonlinear battery models under stochastic electricity prices. Combining a stochastic dynamic programming algorithm with a least-laxity first (LLF) scheduling algorithm [14], our proposed V2G framework minimizes charging costs for EVCS to meet charging targets and distribution grid limits.

  • Using real-world electricity price and EV charging behavior data, our paper provides a first-of-its-kind case study to demonstrate cost savings an EVCS can realistically achieve in various V2G settings.

  • Our case study compares uncontrolled charging, V1G, and V2G with and without nonlinear storage models and price uncertainties. The results quantify the impact of various charging and model options and guide EVCS planning and technology developments.

The remainder of this paper is organized as follows. Section II presents the literature review. Section III describes the system model and formulates the EV charging cost minimization problem. Section IV presents the solution algorithm to the formulated charging problem. Section V includes simulation results and discussion. Section VI concludes the paper.

II Literature Review

Previous literature has proposed multiple heuristic, optimization, or learning-based approaches to conduct smart charging mostly considering linear battery models with constant power rating and efficiency [15, 16]. For example, Liu et al. [17] formulate an EVCS controller as a bi-level program and use a genetic algorithm to minimize charging costs under a time-of-use (ToU) tariff. Similarly, Long et al. [9] use an ordinal optimization approach to minimize EVCS operating cost under a ToU scheme but add aggregated EV demand, maintenance costs, V2G capability, hydrogen storage, and renewable energy generation to the formulation. Additionally, Cao et al. [10] propose a custom actor-critic algorithm to minimize charging costs and peak charging load for a V2G-enabled EVCS, which results in a 24% energy cost savings when compared to uncontrolled charging.

While most prior V2G literature included benchmarks to demonstrate the effectiveness of the proposed algorithm [17, 9, 10], they often assume constant EV battery parameters (power ratings, efficiency) and do not include a penalty term to minimize battery cycling. Lab experiments and real-world data have shown that Li-ion battery power ratings and efficiency strongly depend on SoC, especially in nickel-cobalt-based batteries, which are the most common choice for EVs [18, 19, 20]. In EV smart charging or V2G applications, which aim to provide high charging power with low-cost power conversion hardware. Battery power rating and efficiency are sensitive to the SoC, and the charge or discharge power must be carefully controlled to ensure battery thermal security and reduce degradation rates [21]. A common protocol for EV charging management is the CC–CV (constant current–constant voltage) method [22, 23, 24], that the battery charges with constant current until reaching a high SoC level and then gradually reduces the current to maintain a constant charging voltage to prevent over-voltage damages. Modeling battery characteristics such as CC–CV protocols in V2G management is critical to maximize cost savings and ensure battery security, but it requires representing battery power and efficiencies as functions of SoC instead of using constant values, which introduces significant computation complexities [25, 26, 27, 28, 13].

Some EVCS smart charging algorithms partially accounted for nonlinear charging/discharging characteristics [11, 12, 29, 30], but few were able to model all nonlinear factors in a computation efficient approach. Starting from an EVCS profit maximization problem formulated as mixed-integer linear programming (MILP), Mouli et al. [11] accounts for SoC-dependent power ratings in which the maximum power drops linearly after 80% SoC. Ebrahimi et al. [12] models battery degradation as dependent on both SoC and depth of discharge (DoD), and Schwenk et al. [29] incorporated both nonlinear efficiency and nonlinear degradation terms. Lee et al. [30] implemented an adaptive scheduling algorithm that formulates custom objectives and constraints as a convex program and computes an optimal charging schedule in real-time while considering feeder limits and battery tail capacity reclamation at high SoCs with a data-driven approach. However, the reviewed control solutions do not model all power ratings, efficiencies, and cycling penalties/degradation as nonlinear nor do they provide a method to incorporate different behavior curves. This property will be pivotal for the adaptability of EVCS control algorithms to fast-charging applications and manufacturer-customized EV battery management systems (BMS).

Besides battery models, price uncertainty is another complicating factor that may impact the EVCS cost estimations but was rarely studied in V2G due to computation difficulties. Most literature on smart charging assumes perfect price forecasts or predetermined ToU tariffs [17, 9, 10, 11, 12, 29, 30]. As EV capacity surges, future V2G projects will most likely arbitrage real-time electricity prices that are highly volatile and uncertain, and EVCS must consider price uncertainties. Frendo et al. and Ahmad et al.  [31, 32] use day-ahead prices to forecast the next day’s LMPs, incorporating EVCS controller using MILP formulation. Zhang et al. [33] develop the charging control deep deterministic policy gradient, which models EV charging as a Markov decision process (MDP) and optimizes user satisfaction and charging costs with the output of a long short-term memory (LSTM) network that approximates sequential energy price dynamics. Results from this research demonstrated the significance of modeling price uncertainties, but the computing approach is not scalable to address nonlinear storage models.

As summarized in Table I, the reviewed literature proposes EVCS algorithms that partially account for nonlinear EV battery behavior and price uncertainty. We close this research gap by developing a real-time EVCS V2G control algorithm based on analytical nonlinear stochastic dynamic programming (SDP) and a least-laxity first (LLF) scheduling approach that adds nonlinear EV battery behavior and price uncertainty to the EVCS control formulation while minimizing operating costs and complying with EV charging and battery dynamics such as CC-CV charging profiles, facility power limits, and users’ charging targets. While our proposed method accounts for system non-linearity and uncertainty, we demonstrate that it is scalable and computationally tractable in practical scenarios.

TABLE I: Consideration of price uncertainty and battery parameters nonlinear behavior in smart charging control formulations
Price Uncertainty Nonlinear Power Rating Nonlinear Efficiency Nonlinear Cycling Penalty / Degradation Cost
[17, 9, 10]
[11, 30]
[12]
[29]
[31, 32, 33]
Proposed

III System Model and Formulation

We take the perspective of a public EVCS operator whose electricity cost settles using time-varying wholesale electricity real-time prices. The objective of the EVCS is to minimize the electricity cost under either smart charging (V1G) or V2G operation. The EVCS has enough chargers, all with the same specifications so that no rejection-of-service event occurs during the simulation time frame and complies with LL, the maximum power rating of the charging station, at all time steps.

III-A EV Charging Sessions

We consider a total of KK EVs accessing the EVCS during the considered period, 𝒦={1,..,K}\mathcal{K}=\{1,..,K\} is the set of EVs. EV k𝒦k\in\mathcal{K} arrives on time step AkA_{k} with a starting SoC of SkS_{k}, and departs on time DkD_{k} with a charging target SoC FkF_{k}, with Dk>AkD_{k}>A_{k} and Fk>SkF_{k}>S_{k}. Thus we use 𝒯k={Ak,,Dk}\mathcal{T}_{k}=\{A_{k},\dotsc,D_{k}\} to denote the time frame of the current charging session of EV kk. At every EV arrival, the controller updates the tuple (AkA_{k}, DkD_{k}, FkF_{k}), which is used as input for the proposed solution algorithm. Additionally, the controller has access to every EV SoC at all times. We also assume the EVCS does not have information or can predict the arrival of EVs, but each EV upon arrival will inform the EVCS its departure time and charging target.

III-B Battery Nonlinear Behavior

All EVs are modeled as having the same battery capacity and SoC-dependent charge power rating (Bk(et1,k)B_{k}(e_{t-1,k})), discharge power rating (Pk(et1,k)P_{k}(e_{t-1,k})), single-trip efficiency (ηk(et1,k)\eta_{k}(e_{t-1,k})) and discharge cost penalty (ck(et1,k)c_{k}(e_{t-1,k})) curves. As shown in Figure 1, efficiency, and cycling penalty are modeled as quadratic functions of SoC [18]. The power rating curves resemble a Tesla Model S fast charging curve [34] with custom-defined CC-CV behavior at low and high SoC. The controller has access to a low-resolution version of the battery nonlinear parameter curves to use as an approximation during control policy computations. This resolution gap simulates the challenge of EV battery behavior approximation in online smart charging control.

Refer to caption
Figure 1: Assumed EV battery SoC-dependent parameter curves for all EVs

III-C Price Prediction

The EVCS operator can access the system’s day-ahead price (DAP) information and a DAP-based real-time price (RTP) prediction tool. For this work, RTP is modeled as a 1st-order Markov process with 12 nodes per time step trained with historical RTP-DAP bias price data as in setting DB-Dep in [35]. The proposed solution algorithm uses the resulting prediction to provide a control decision that accounts for future price uncertainty.

III-D Formulation

We start with formulating the EVCS V2G fleet management problem including nonlinear battery models, charging station power limits, and a causality control policy constraint with respect to time-varying electricity price uncertainties.

The objective of the charging station is to minimize the cost of electricity to charge up each EV including a discharge penalty to avoid frequent cycles that accelerate battery degradation
minbt,k,pt,kk𝒦t𝒯kλt(bt,kpt,k)+ck(et1,k)pt,k\displaystyle\min_{b_{t,k},p_{t,k}}\sum_{k\in\mathcal{K}}\sum_{t\in\mathcal{T}_{k}}\lambda_{t}(b_{t,k}-p_{t,k})+c_{k}(e_{t-1,k})p_{t,k} (1a)
in which bt,kb_{t,k} is the charging power of EV kk during time step tt, while pt,kp_{t,k} is the discharge power. λt\lambda_{t} is the time-varying price of electricity. The second term reduces battery degradation by introducing a discharge penalty cost ck(et1,k)c_{k}(e_{t-1,k}) as a function of SoC. While the EVCS operator does not assume EV battery degradation cost, the controller incorporates an EV battery discharge penalty to avoid excessive cycling. Note that bt,kb_{t,k} and pt,kp_{t,k} have been normalized by the chosen simulation time step and have units of energy.

Each EV is subject to the following power and energy constraints (t𝒯kt\in\mathcal{T}_{k})

0bt,kBk(et1,k)\displaystyle 0\leq b_{t,k}\leq B_{k}(e_{t-1,k}) (1b)
0pt,kPk(et1,k)\displaystyle 0\leq p_{t,k}\leq P_{k}(e_{t-1,k}) (1c)
et,ket1,k=pt,k/ηk(et1,k)+bt,kηk(et1,k)\displaystyle e_{t,k}-e_{t-1,k}=-p_{t,k}/\eta_{k}(e_{t-1,k})+b_{t,k}\cdot\eta_{k}(e_{t-1,k}) (1d)
E¯ket,kE¯k\displaystyle\underline{E}_{k}\leq e_{t,k}\leq\overline{E}_{k} (1e)
eAk=Sk,eDkFk\displaystyle e_{A_{k}}=S_{k},\quad e_{D_{k}}\geq F_{k} (1f)

in which et,ke_{t,k} is the SoC of EV kk during time step tt. E¯k\underline{E}_{k} is the EV minimal SoC limit and E¯k\overline{E}_{k} is the EV maximum SoC. (1b) and (1c) model the EV power rating, (1d) models the SoC evolution, (1e) models the upper and lower SoC limits, and (1f) models the starting SoC and SoC charging target.

The total charging and discharge power is subjected to the station power limit

k𝒦pt,k\displaystyle\sum_{k\in\mathcal{K}}p_{t,k} L\displaystyle\leq L (1g)
k𝒦bt,k\displaystyle\sum_{k\in\mathcal{K}}b_{t,k} L\displaystyle\leq L (1h)

The control policy must be causal (non-anticipatory) [36] and only depends on past and current information

{bt,k,pt,k|k𝒦,t𝒯k}Causal Control Policies\displaystyle\{b_{t,k},p_{t,k}|k\in\mathcal{K},t\in\mathcal{T}_{k}\}\in\text{Causal Control Policies} (1i)
Remark 1

Generalization to different charging scenarios. (1) provides a generalized formulation in different charging scenarios. In V2G, both BkB_{k} and PkP_{k} are non-zero, while in single-directional smart charging, or V1G, the EV will not inject power into the grid and thus PkP_{k} is set to zero. In cases when assuming a linear battery model, PkP_{k}, BkB_{k}, ckc_{k} and ηk\eta_{k} are constants, while in nonlinear battery models, these parameters are dependent on the SoC.

IV Solution Method

We take a two-step approach to solving the EVCS control problem (1). First, we formulate the charging session of a single EV as a price arbitrage problem, which satisfies all constraints in (1) except the EVCS power limit constraints (1f) and (1g), and solve it using an analytical SDP method  [35]. Second, we aggregate the control policies from the EVs in an active session at the current time step and prioritize the distribution of control signals according to an LLF approach  [14] to ensure compliance with the EVCS power limit.

IV-A Decomposition to Arbitrage Problems

The core of the proposed control method is a single energy storage price arbitrage problem formulated as an SDP [35].

Remark 2

V2G decomposition. Because we do not assume the EV charging actions would impact market clearing prices, we can decompose (1) into parallel arbitrage problems by relaxing the charging station power limit constraint (1f) and (1g), which are the only coupling factors among all EVs. Each resulting sub-problem becomes an arbitrage problem that maximizes the arbitrage profit (or, equivalently, minimizes the charging session electricity cost) while meeting the final SoC target. We will discuss in later sections how we aggregate results from all EVs to incorporate the EVCS power limits.

To solve the arbitrage sub-problem under the causality policy constraint, we adopt an SDP approach with the following formulation (for simplicity, we omit the EV index kk in the following formulation, but the following formulation is for a single EV):

Qt1(et1|λt)\displaystyle Q_{t-1}(e_{t-1}\,|\,\lambda_{t}) =maxbt,ptλt(ptbt)ck(et1)pt+Vt(et|λt)\displaystyle=\max_{b_{t},p_{t}}\lambda_{t}(p_{t}-b_{t})-c_{k}(e_{t-1})p_{t}+V_{t}(e_{t}\,|\,\lambda_{t}) (2a)
Vt(et|λt)\displaystyle V_{t}(e_{t}\,|\,\lambda_{t}) =𝔼λt+1[Qt(et|λt+1)|λt]\displaystyle=\mathbb{E}_{\lambda_{t+1}}\Big{[}Q_{t}(e_{t}\,|\,\lambda_{t+1})\Big{|}\lambda_{t}\Big{]} (2b)
subject to (1b)–(1e).

We model the time-varying price λt\lambda_{t} as an order-1 Markov process, as described in III-C, in which the price distribution over a time period t+1t+1 depends on the realized price over tt. Qt1(et1|λt)Q_{t-1}(e_{t-1}\,|\,\lambda_{t}) is the maximized current period profit given the SoC at the start of the time period, while Vt(et|λt)V_{t}(e_{t}\,|\,\lambda_{t}) is the expected value function representing the opportunity value of energy stored in the battery at the end of the time period. In the context of an EV charging session, Vt(et|λt)V_{t}(e_{t}\,|\,\lambda_{t}) represents the minimum expected cost of the remainder of the session based on the current SoC, current RTP, and the RTP uncertainty model.

IV-B Solving Nonlinear Battery Models

We extend the solution approach from [35] by incorporating the SoC-dependency of battery behavior parameters into the first-order optimality condition expression as

qt1,i(et1)=\displaystyle q_{t-1,i}(e_{t-1})=
πt,i(ptet1btet1)ck(et1)ptet1ck(et1)et1pt\displaystyle\pi_{t,i}\Big{(}\frac{\partial p_{t}}{\partial e_{t-1}}-\frac{\partial b_{t}}{\partial e_{t-1}}\Big{)}-c_{k}(e_{t-1})\frac{\partial p_{t}}{\partial e_{t-1}}-\frac{\partial c_{k}(e_{t-1})}{\partial e_{t-1}}p_{t}
+vt,i(et)etet1=0\displaystyle+v_{t,i}(e_{t})\frac{\partial e_{t}}{\partial e_{t-1}}=0 (3)

where qt1,i(et1)q_{t-1,i}(e_{t-1}) is the derivative of Qt1(et1|λt)Q_{t-1}(e_{t-1}\,|\,\lambda_{t}), or the storage device’s marginal opportunity value. According to the Karush-Kuhn-Tucker (KKT) conditions and (1d), we obtain the following:

pt/et1=\displaystyle{\partial p_{t}}/{\partial e_{t-1}}= (4a)
{η+(pt/η)(η/e)if (1c) not bindingP/eif (1c) binding\displaystyle\begin{cases}\eta+(p_{t}/\eta){\cdot}({\partial\eta}/{\partial e})\indent\indent&\quad\text{if \eqref{p1_c2} not binding}\\ {\partial P}/{\partial e}&\quad\text{if \eqref{p1_c2} binding}\end{cases}
bt/et1=\displaystyle{\partial b_{t}}/{\partial e_{t-1}}= (4b)
{1/η(bt/η)(η/e)if (1b) not bindingB/eif (1b) binding\displaystyle\begin{cases}-1/\eta-(b_{t}/\eta){\cdot}({\partial\eta}/{\partial e})\indent\indent&\text{if \eqref{p1_c1} not binding}\\ {\partial B}/{\partial e}&\text{if \eqref{p1_c1} binding}\end{cases}
et/et1=\displaystyle{\partial e_{t}}/{\partial e_{t-1}}= (4c)
{0if (1b) or (1c) not binding1(1/η)(P/e)+(1/η)2(η/e)P+η(B/e)+Bη/eif (1b) and (1c) binding\displaystyle\begin{cases}0\qquad\qquad\qquad\qquad\qquad\qquad\text{if \eqref{p1_c1} or \eqref{p1_c2} not binding}\\ 1-(1/\eta){\cdot}({\partial P}/{\partial e})+(1/\eta)^{2}{\cdot}({\partial\eta}/{\partial e})P\\ +\eta{\cdot}({\partial B}/{\partial e})+B{\cdot}{\partial\eta}/{\partial e}\qquad\quad\text{if \eqref{p1_c1} and \eqref{p1_c2} binding}\end{cases}

By replacing the partial derivative expressions given by (4) in (IV-B) for full power rating (binding) and partial (non-binding) charging or discharging cases, we obtain an analytical marginal opportunity value function update expression. Note that the expressions in (4) involve the optimization variables ptp_{t} and btb_{t}. The expressions are solved by approximating ptp_{t} and btb_{t} by the power ratings BB and PP corresponding to the current SoC. The full formulation of this equation is deferred to Appendix -B.

IV-C Arbitrage Policy

We use the developed analytical SDP algorithm to calculate a marginal opportunity value function for each charging session for each EV. At each time step, the control decision ptp_{t} and btb_{t} for each connected EV can be determined by comparing the corresponding marginal opportunity value function and the observed realized RTP λt\lambda_{t}. The value difference between the EV battery’s marginal value and the marginal grid price will trigger a charging, discharging, or idling control signal. The full marginal value function and control policy calculation methods are deferred to Appendix -C and Appendix -B.

Remark 3

Lagrangian relaxation of the final SoC constraint. We apply a Lagrangian relaxation to incorporate the final SoC charging target constraint into the SDP by assuming an arbitrarily large penalty ($1000/MWh) for not achieving the charging target. This enables the marginal value function corresponding to the EV departing time step to act as an inverse activation function, with a linear penalty cost to the battery SoC until reaching the specified charging target. This enforces the battery to charge regardless of the price when approaching the end of the charging session in V1G and V2G cases to meet the charging target.

When applying this control policy with a nonlinear system assumption is that the storage device parameters BB, PP, η\eta, and c used in the elaboration of the control decision are approximations of the real storage device behavior parameters. The control decision will be calculated using a trained model from historical price data and executed in the testing environment. The testing environment will limit the control inputs to a range within the true storage behavior constraints.

IV-D EV Fleet Control Simulation

The EVCS control algorithm incorporates nonlinear battery parameter curve approximations, data provided by the EV users (SoC charging targets and session duration), the marginal value function calculation algorithm, an LLF prioritization step, and the control policy outlined in IV-C. The algorithm is executed in real-time as follows:

  1. 1.

    Set tt+1t\to t+1.

  2. 2.

    Calculate the marginal value function for the EVs that arrive to the EVCS at time tt. For the value function computation, set tt as the starting time, the provided session duration as the time horizon TT and the provided SoC session target as the final SoC efe^{f}. The resulting marginal value function will be used as the basis of the control policy for its corresponding EV for the duration of the current session.

  3. 3.

    Identify all connected EVs. Compute the ratio of time elapsed in the current session to the total session duration for each connected EV. Based on the calculated ratios, sort the EVs in descending order. This step is aligned with an LLF [14] scheduling approach, which prioritizes EVs with the least time to achieve their target.

  4. 4.

    In the order defined by step 3), execute the control policy for each EV as described in IV-C (i.e., comparing the EV marginal value to the grid marginal price). If the facility power limit is reached, set the remaining EVs’ power control signals to zero and go to step 1).

  5. 5.

    Go to step 1) until reaching the target simulation time.

Note that the control signals in step 4) will be truncated by the testing environment if they are outside the range of the actual battery behavior model. The LLF sorting step provides a lightweight solution to aggregate the individual value function results and comply with the facility’s power limit. This enables the modular nature of the algorithm components and prevents exponential computation time growth as the number of EVs in the EVCS increase.

V Case Study

V-A Data and Experiment Design

We test the proposed control algorithm using the 2019 New York Independent System Operator (NYISO) price data. Price uncertainty is modeled using a 1st-order Markov process trained with 2016-2018 NYISO price data. We include prices from four zones to demonstrate performance results in different price patterns: NYC, LONGIL, NORTH, and WEST.

A 101-sample resolution version of the SoC-dependent battery parameter curves shown in Figure 1 is considered the ground truth and used as the testing environment. We assume that the controller has access to a 10-sample resolution version of the same battery nonlinear parameter curves. Although the proposed method can handle different parameter curves for each EV, we assume identical parameter curves in this case study for simplicity. With this resolution gap between the environment and the valuation process, we demonstrate the effectiveness of the proposed algorithm in providing efficient control with a limited amount of data to approximate the battery model.

We consider six scenarios to test the proposed algorithm and establish benchmarks for comparison. The following two scenarios are used as benchmarks:

  1. 1.

    PF (perfect forecast). We perform a deterministic optimization using real-time prices in Julia/Gurobi. The optimization problem setup can be found in Appendix -D. This benchmark scenario represents the lowest possible EVCS operating cost.

  2. 2.

    UC (uncontrolled charging). EVs start charging as soon as they arrive at the EVCS and charge with the maximum allowable power rating at all times until reaching their charging target. Facility power limits are fairly distributed among actively charging EVs. The control logic is implemented in Julia. This is the second benchmark case and represents an EVCS without a control policy or V2G capability.

and the remaining scenarios are solved with the proposed custom algorithm implemented in Julia:

  1. 1.

    NL-V2G. We perform SDP control assuming V2G capability and approximate EV battery and charger behavior with a 10-sample version of the nonlinear parameter curves.

  2. 2.

    NL-V1G. Similar to NL-V2G, but assuming no V2G capability.

  3. 3.

    L-V2G. Similar to NL-V2G, but approximating EV battery and nonlinear charger parameters with constant values. Power ratings are set to the nominal charger capability, one-way charging and discharging efficiencies to 95% and marginal battery degradation cost to $15MWh

  4. 4.

    L-V1G. Similar to L-V2G, but assuming no V2G capability.

The EVCS consists of 21 bi-directional (unless otherwise noted by the scenario being tested) 17.2 kW level-2 chargers and has a 150 kW power limit, leading to an over-subscription ratio of 2.4. We assume 75 users have access to the EVCS and all users own a 100 kWh EV. Users’ energy requested, and arrival and departure times are obtained from the Caltech ACN dataset [37], specifically using the 2019 JPL data with energy requests greater than 5 kWh. Figure 2 shows the distribution of arrival and departure times of the dataset that will be used for the simulation. A starting SoC of 10% is assumed for all arrivals. SDP control is performed in all scenarios using the described 1st-order Markov process price prediction.

Refer to caption
Figure 2: Histogram of EVCS users’ arrival and departure times from the ACN (JPL 2019) Dataset.
Remark 4

Charging target compliance. For a charging session to be successful in any of the scenarios, the control algorithm must achieve a final SoC within 5% of the user’s SoC charging target. We define the charging target compliance performance metric as the ratio between successful and total charging sessions. Note that the user may input a target that is infeasible due to a short session duration. The charging target compliance metric will exclude these infeasible cases.

All computations were performed on a personal laptop with an Intel Core i9-10885H 2.5GHz CPU and 32 GB memory. The benchmark (PF) using MILP is solved using Gurobi [38], while the proposed algorithms and the EVCS simulation are implemented in Julia.

V-B Cost Savings and Charging Target Compliance

Figure 3 shows a sample charging session using both NL-V2G and NL-V1G scenarios. V2G achieves cost reduction by charging during low price periods and capturing additional revenue through energy arbitrage, and V1G reduces EVCS operating costs only through its smart charging capability. Note that embedding the final SoC requirement in the value-to-go function calculation results in successful charging sessions for all the shown cases while minimizing total cost and EV battery cycling during the session.

Refer to caption
(a) V2G
Refer to caption
(b) V1G
Figure 3: Performance of the proposed control policy in a 9-hour charging session in both (a) NL-V2G and (b) NL-V1G scenarios
Refer to caption
Figure 4: EVCS operating cost savings of all scenarios simulated with the proposed method for the uncontrolled case. Perfect Forecast represents the highest possible EVCS operating cost savings under the considered simulation conditions.
Refer to caption
Figure 5: EVCS cumulative operating costs during 2019 for all simulated NYISO zones. Perfect-forecast V2G/V1G, stochastic V2G/V1G and uncontrolled charging scenarios are shown.

Figure 4 shows the EVCS operating cost savings achieved by the proposed algorithm and the PF scenario as a percentage of the uncontrolled charging (UC) scenarios as well as the charging compliance results across the four considered NYISO zones. NL-V2G results in an average operating cost savings of 35% over UC, with savings reaching up to 56% in the WEST zone while maintaining average charging compliance of 95%. The cost savings average drops to 17% across zones if NL-V1G is used. This demonstrates the impact of bi-directional charging capability on EVCS operating costs. Both L-V2G and L-V1G result in increased average cost savings (37% and 18% respectively) compared to NL-V2G and NL-V1G, but at the expense of charging compliance (83% for L-V2G and 73% for L-V1G). L-V2G and L-V1G increased cost savings come from estimating the nonlinear power ratings as constant, which causes mismatches between the control signal and the actual power rating capability at a given time step. This mismatch leads to EVs not achieving their session charging target, which results in lower power purchased from the grid and reduced charging target compliance. Additionally, Figure 5 shows the cumulative costs of the V2G/V1G PF, NL-V2G, NL-V1G, and UC cases for the simulated year.

V-C V2G Energy Equivalent Mileage

Most EVs have a battery warranty based on the production time and the drive mileage. To this end, V2G puts on additional discharges to the battery and may accelerate the expiration of the manufacturer warranty. In this section, we study how much additional energy is discharged in V2G and the equivalent mileage consumption to understand how much stress V2G would put on battery warranties.

Table II compares the total EVCS energy input (charged) and output (discharged) in NL-V2G and NL-V1G scenarios across all NYISO zones. On average, 7.3% of the total energy charged in the NL-V2G scenario is used for discharging to arbitrage electricity prices. From these results, an equivalent mileage value for an EV participating in a V2G EVCS can be estimated by translating the energy output from the station to mileage through an EPA EV range estimate [39]. This value becomes relevant when calculating the impact of V2G on EV warranty, which is regulated to be the first of 8 years or 100,000 mi (15 years or 150,000 mi proposed in California) [40]. As a case study, we use the Tesla Model X EPA estimated range of 348 mi for a full charge (100 kWh) [41]. Subsequently, a fraction of yearly energy output from the NYC EVCS (9.6 MWh), proportional to the number of charging sessions corresponding to a particular EV (139 sessions out of a total of 2967), is equivalent to a mileage value of 1565 mi. This corresponds to a 12% increase in the average mileage driven per year (USDOT average is 13500 mi [42]), which would lead to passing 100,000 mi approximately nine months earlier than the baseline average mileage. Additionally, using the EVCS total energy output, an EPA estimated range of 348 mi and the cost savings achieved by V2G result in an incremental EVCS operating cost savings benefit of $0.125/kWh and $0.036/mi. Using our proposed method to estimate V2G equivalent mileage under different control policies would increase accuracy when performing long-term EVCS TEA studies.

TABLE II: Energy Balances (in MWh) for a 1-year EVCS simulation
Zone NYC NORTH WEST LONGIL
NL-V1G Charged 152.44 153.38 153.40 152.59
NL-V2G Charged 163.85 161.08 177.48 168.65
NL-V2G Discharged 9.63 5.84 20.25 13.84

V-D Computation Times

Table III shows computation times for 1-year simulations of three cases all using nonlinear battery models: 1) PF-MILP: nonlinear V2G optimization with perfect price forecast formulated using MILP and solved using Gurobi; 2) PF-DP: nonlinear V2G optimization with perfect price forecast solved with the proposed algorithm, note that in this case there is no uncertainty, so the proposed algorithm is essentially dynamic programming; 3) NL-V2G: nonlinear V2G optimization solved using the proposed stochastic dynamic programming algorithm. Hence, PF-MILP and PF-DP are deterministic, while SDP is stochastic.

The computation time result shows the computation tractability of the proposed algorithm in both deterministic and stochastic optimization. The comparison between PF-MILP and PF-DP is an apple-to-apple comparison as both algorithms solve a deterministic EVCS problem. PF-DP, the deterministic version of our proposed algorithm yields an average result within 1.5% of the solution times provided by the MILP formulation, while the computation time is around 60x faster. Our proposed SDP-based algorithm achieves a computation time 7.5x faster than the MILP. Note that SDP is solving multi-stage stochastic optimization while the MILP is solving deterministic optimization, while both use nonlinear battery models. Therefore, our proposed algorithm can also be considered a faster, more efficient, and open-source alternative for solving deterministic smart charging control case studies.

TABLE III: Computation times (in seconds) for a 1-year V2G simulation
Zone NYC NORTH WEST LONGIL
PF-MILP 5567 6123 6117 6214
PF-DP 97 93 90 97
NL-V2G 830 825 829 814

VI Conclusion

We proposed and tested an EVCS controller based on a nonlinear analytical stochastic dynamic programming algorithm and least-laxity first scheduling. Using historical prices from New York State, our proposed V2G algorithm achieved 24% to 56% of EVCS operating cost savings compared to uncontrolled charging while maintaining a 95% charging target compliance and accounting for EV battery nonlinear behavior and price uncertainty in real-time. Our study covers smart charging in which EVs are not discharged to the grid. Still, our approach provides on average 17% cost savings by responding to grid price variations compared to uncontrolled charging. We also show the importance of considering nonlinear battery models in V2G optimization, in which the battery power rating and efficiencies are dependent on the SoC, which is critical to ensure the EV meets its charging target while responding to time-varying prices. Finally, the proposed algorithm is open-source and not requiring any thrid party solvers, while the computation time surpasses commercial solvers. Hence, our approach is suitable for real-world implementations and scale-up for large-scale EV fleet management.

In the future, we plan to improve the proposed approach in several directions. The first is to integrate the solution method with data-driven probability price prediction methods. The current solution to the V2G problem using stochastic dynamic programming still requires a Markov process to be trained using historical price data. However, designing the Markov process can be complicated and limited by the quantity of historical price data. Second, our result still shows that V2G is more likely to miss charging targets due to the feeder capacity constraints, we will investigate approaches to manage the charging constraint better and improve charging compliance. Finally, we will test our proposed algorithm using more sophisticated charging scenarios such as using heterogeneous EV fleets and considering local renewable generation and study the connection between driving patterns and zone prices with the control policy performance.

References

  • [1] IEA, “Net zero by 2050,” IEA, 2021. [Online]. Available: https://www.iea.org/reports/net-zero-by-2050
  • [2] B. Bilgin, P. Magne, P. Malysz, Y. Yang, V. Pantelic, M. Preindl, A. Korobkine, W. Jiang, M. Lawford, and A. Emadi, “Making the case for electrified transportation,” IEEE Transactions on Transportation Electrification, vol. 1, pp. 4–17, 2015.
  • [3] P. Jaramillo, S. K. Ribeiro, P. Newman, S. Dhar, O. Diemuodeke, T. Kajino, D. Lee, S. Nugroho, X. Ou, A. H. Strømman, and J. Whitehead, “Transport. in ipcc, 2022: Climate change 2022: Mitigation of climate change. contribution of working group iii to the sixth assessment report of the intergovernmental panel on climate change,” IPCC, 2022.
  • [4] NREL, “Transportation and mobility research: Electric vehicle smart charging at scale,” NREL, 2022. [Online]. Available: https://www.nrel.gov/transportation/managed-electric-vehicle-charging.html
  • [5] M. Nour, S. M. Said, A. Ali, and C. Farkas, “Smart charging of electric vehicles according to electricity price,” in 2019 International Conference on Innovative Trends in Computer Engineering (ITCE), 2019, pp. 432–437.
  • [6] J. K. Szinai, C. J. Sheppard, N. Abhyankar, and A. R. Gopal, “Reduced grid operating costs and renewable energy curtailment with electric vehicle charge management,” Energy Policy, vol. 136, p. 111051, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S030142151930638X
  • [7] O. Sadeghian, A. Oshnoei, B. Mohammadi-ivatloo, V. Vahidinasab, and A. Anvari-Moghaddam, “A comprehensive review on electric vehicles smart charging: Solutions, strategies, technologies, and challenges,” Journal of Energy Storage, vol. 54, p. 105241, 2022. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S2352152X22012403
  • [8] M. Jahnes, L. Zhou, M. Eull, W. Wang, and M. Preindl, “Design of a 22kw transformerless ev charger with v2g capabilities and peak 99.5% efficiency,” IEEE Transactions on Industrial Electronics, 2022.
  • [9] T. Long, Q.-S. Jia, G. Wang, and Y. Yang, “Efficient real-time ev charging scheduling via ordinal optimization,” IEEE Transactions on Smart Grid, vol. 12, no. 5, pp. 4029–4038, 2021.
  • [10] Y. Cao, H. Wang, D. Li, and G. Zhang, “Smart online charging algorithm for electric vehicles via customized actor–critic learning,” IEEE Internet of Things Journal, vol. 9, no. 1, pp. 684–694, 2022.
  • [11] G. R. C. Mouli, M. Kefayati, R. Baldick, and P. Bauer, “Integrated pv charging of ev fleet based on energy prices, v2g, and offer of reserves,” IEEE Transactions on Smart Grid, vol. 10, no. 2, pp. 1313–1325, 2017.
  • [12] M. Ebrahimi, M. Rastegar, M. Mohammadi, A. Palomino, and M. Parvania, “Stochastic charging optimization of v2g-capable pevs: A comprehensive model for battery aging and customer service quality,” IEEE Transactions on Transportation Electrification, vol. 6, no. 3, pp. 1026–1034, 2020.
  • [13] A. Gonzalez-Castellanos, D. Pozo, and A. Bischi, “Detailed li-ion battery characterization model for economic operation,” International Journal of Electrical Power & Energy Systems, vol. 116, p. 105561, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0142061519315765
  • [14] Y. Nakahira, N. Chen, L. Chen, and S. H. Low, “Smoothed least-laxity-first algorithm for ev charging,” in Proceedings of the Eighth International Conference on Future Energy Systems, ser. e-Energy ’17.   New York, NY, USA: Association for Computing Machinery, 2017, p. 242–251. [Online]. Available: https://doi.org/10.1145/3077839.3077864
  • [15] R. Fachrizal, M. Shepero, D. van der Meer, J. Munkhammar, and J. Widén, “Smart charging of electric vehicles considering photovoltaic power production and electricity consumption: A review,” eTransportation, vol. 4, p. 100056, 2020. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S2590116820300138
  • [16] H. M. Abdullah, A. Gastli, and L. Ben-Brahim, “Reinforcement learning based ev charging management systems–a review,” IEEE Access, vol. 9, pp. 41 506–41 531, 2021.
  • [17] J. Liu, G. Lin, S. Huang, Y. Zhou, Y. Li, and C. Rehtanz, “Optimal ev charging scheduling by considering the limited number of chargers,” IEEE Transactions on Transportation Electrification, vol. 7, no. 3, pp. 1112–1122, 2021.
  • [18] X. Wu, W. Wang, and J. Du, “Effect of charge rate on capacity degradation of lifepo4 power battery at low temperature,” International Journal of Energy Research, vol. 44, no. 3, pp. 1775–1788, 2020. [Online]. Available: https://onlinelibrary.wiley.com/doi/abs/10.1002/er.5022
  • [19] R. Zhang, B. Xia, B. Li, L. Cao, Y. Lai, W. Zheng, H. Wang, W. Wang, and M. Wang, “A study on the open circuit voltage and state of charge characterization of high capacity lithium-ion battery under different temperature,” Energies, vol. 11, no. 9, 2018. [Online]. Available: https://www.mdpi.com/1996-1073/11/9/2408
  • [20] Y. Preger, H. M. Barkholtz, A. Fresquez, D. L. Campbell, B. W. Juba, J. Romàn-Kustas, S. R. Ferreira, and B. Chalamala, “Degradation of commercial lithium-ion cells as a function of chemistry and cycling conditions,” Journal of The Electrochemical Society, vol. 167, no. 12, p. 120532, 2020.
  • [21] L. Zhou, M. Jahnes, M. Eull, W. Wang, G. Cen, and M. Preindl, “Robust control design for ride-through/trip of transformerless onboard bidirectional ev charger with variable-frequency critical-soft-switching,” IEEE Transactions on Industry Applications, 2022.
  • [22] B. Tar and A. Fayed, “An overview of the fundamentals of battery chargers,” in 2016 IEEE 59th International Midwest Symposium on Circuits and Systems (MWSCAS), 2016, pp. 1–4.
  • [23] S. Habib, M. M. Khan, F. Abbas, L. Sang, M. U. Shahid, and H. Tang, “A comprehensive study of implemented international standards, technical challenges, impacts and prospects for electric vehicles,” IEEE Access, vol. 6, pp. 13 866–13 890, 2018.
  • [24] M. Eull, L. Zhou, M. Jahnes, and M. Preindl, “Bidirectional non-isolated fast charger integrated in the electric vehicle traction drivetrain,” IEEE Transactions on Transportation Electrification, vol. 8, pp. 180–195, 2021.
  • [25] H. Pandžić and V. Bobanac, “An accurate charging model of battery energy storage,” IEEE Transactions on Power Systems, vol. 34, no. 2, pp. 1416–1426, 2019.
  • [26] M. Farag, M. Fleckenstein, and S. Habibi, “Continuous piecewise-linear, reduced-order electrochemical model for lithium-ion batteries in real-time applications,” Journal of Power Sources, vol. 342, pp. 351–362, 2017. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0378775316317396
  • [27] A. Sakti, K. G. Gallagher, N. Sepulveda, C. Uckun, C. Vergara, F. J. de Sisternes, D. W. Dees, and A. Botterud, “Enhanced representations of lithium-ion batteries in power systems models and their effect on the valuation of energy arbitrage applications,” Journal of Power Sources, vol. 342, pp. 279–291, 2017. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S037877531631758X
  • [28] G. Rancilio, A. Lucas, E. Kotsakis, G. Fulli, M. Merlo, M. Delfanti, and M. Masera, “Modeling a large-scale battery energy storage system for power grid application analysis,” Energies, vol. 12, no. 17, 2019. [Online]. Available: https://www.mdpi.com/1996-1073/12/17/3312
  • [29] K. Schwenk, S. Meisenbacher, B. Briegel, T. Harr, V. Hagenmeyer, and R. Mikut, “Integrating battery aging in the optimization for bidirectional charging of electric vehicles,” IEEE Transactions on Smart Grid, vol. 12, no. 6, pp. 5135–5145, 2021.
  • [30] Z. J. Lee, G. Lee, T. Lee, C. Jin, R. Lee, Z. Low, D. Chang, C. Ortega, and S. H. Low, “Adaptive charging networks: A framework for smart electric vehicle charging,” IEEE Transactions on Smart Grid, vol. 12, no. 5, pp. 4339–4350, 2021.
  • [31] O. Frendo, N. Gaertner, and H. Stuckenschmidt, “Real-time smart charging based on precomputed schedules,” IEEE Transactions on Smart Grid, vol. 10, no. 6, pp. 6921–6932, 2019.
  • [32] F. Ahmad, M. S. Alam, S. M. Shariff, and M. Krishnamurthy, “A cost-efficient approach to ev charging station integrated community microgrid: A case study of indian power market,” IEEE Transactions on Transportation Electrification, vol. 5, no. 1, pp. 200–214, 2019.
  • [33] F. Zhang, Q. Yang, and D. An, “Cddpg: A deep-reinforcement-learning-based approach for electric vehicle charging control,” IEEE Internet of Things Journal, vol. 8, no. 5, pp. 3075–3087, 2021.
  • [34] InsideEVs, “Tesla model s plaid fast charging results,” 2021. [Online]. Available: https://insideevs.com/news/515641/tesla-models-plaid-charging-analysis/
  • [35] N. Zheng, J. J. Jaworski, and B. Xu, “Arbitraging variable efficiency energy storage using analytical stochastic dynamic programming,” IEEE Transactions on Power Systems, pp. 1–1, 2022.
  • [36] A. Shapiro, D. Dentcheva, and A. Ruszczynski, Lectures on stochastic programming: modeling and theory.   SIAM, 2021.
  • [37] Z. J. Lee, T. Li, and S. H. Low, “ACN-Data: Analysis and Applications of an Open EV Charging Dataset,” in Proceedings of the Tenth International Conference on Future Energy Systems, ser. e-Energy ’19, 2019.
  • [38] Gurobi Optimization, LLC, “Gurobi Optimizer Reference Manual,” 2022. [Online]. Available: https://www.gurobi.com
  • [39] EPA, “Fuel economy - all-electric vehicles,” 2022. [Online]. Available: https://www.fueleconomy.gov/feg/evtech.shtml
  • [40] California Air Resources Board, “California code of regulations, section 1962.4: Zero-emission vehicle standards for 2026 and subsequent model year passenger cars and light-duty trucks,” 2021. [Online]. Available: https://ww2.arb.ca.gov/sites/default/files/2021-12/draft%20zero%20emission%20vehicle%20regulation%201962.4%20posted.pdf
  • [41] Tesla, “Tesla model x,” 2022. [Online]. Available: https://www.tesla.com/modelx
  • [42] USDOT Federal Highway Administration, “Average annual miles per driver by age group,” 2022. [Online]. Available: https://www.fhwa.dot.gov/ohim/onh00/bar8.htm
  • [43] B. Xu, M. Korpås, and A. Botterud, “Operational valuation of energy storage under multi-stage price uncertainties,” in 2020 59th IEEE Conference on Decision and Control (CDC), 2020, pp. 55–60.

-A Stochastic Price Arbitrage using Markov Process

We discretize the stochastic real-time price as a first-order Markov Process with N nodes per time step ({πt,i|t𝒯,iN}\{\pi_{t,i}|\,t\in\mathcal{T},\,i\in N\}), and a stage transition probability ρi,j,t\rho_{i,j,t} indicating the probability of transitioning from price node ii at time period tt to price node jj at time period t+1t+1. Thus, we reformulate the stochastic arbitrage problem in (2) using discretized Markov price processes as

Qt1,i(et1)=maxbt,ptπt,i(ptbt)cpt+Vt,i(et)\displaystyle\begin{split}Q_{t-1,i}(e_{t-1})&=\max_{b_{t},p_{t}}\pi_{t,i}\cdot(p_{t}-b_{t})-cp_{t}+V_{t,i}(e_{t})\end{split} (5a)
Vt,i(et)\displaystyle V_{t,i}(e_{t}) =j𝒩ρi,j,tQt,j(et)\displaystyle=\sum_{j\in\mathcal{N}}\rho_{i,j,t}\cdot Q_{t,j}(e_{t}) (5b)
subject to the EV constraints (1b)–(1e).

-B Value Function Computation

Our proposed algorithm is based on the following result that updates qt1,iq_{t-1,i} from vt,iv_{t,i}, where qt1,iq_{t-1,i} is the derivative of Qt1,iQ_{t-1,i} and vt,iv_{t,i} is the derivative of Vt,iV_{t,i} [43]

qt1,i(e)=\displaystyle q_{t-1,i}(e)= (6)
{[1+ηB/e+Bη/e]vt,i(e+Bη)πB/eif πt,ivt,i(e+Bη)ηπt,i[1/η+(B/η)(η/e)]if vt,i(e+Bη)η<πt,ivt,i(e)ηvt,i(e)if vt,i(e)η<πt,i[vt,i(e)/η+c]+(πt,ic)[η+(P/η)(η/e)]Pc/eif [vt,i(e)/η+c]+<πt,i[vt,i(eP/η)/η+c]+[1(1/η)(P/e)+P(1/η)2(η/e)]vt,i(eP/η)+(πt,ic)P/ePc/eif πt,i>[vt,i(eP/η)/η+c]+\displaystyle\begin{cases}[1+\eta{\cdot}{\partial B}/{\partial e}+B{\cdot}{\partial\eta}/{\partial e}]{\cdot}v_{t,i}(e+B\eta)-\pi{\cdot}{\partial B}/{\partial e}&\\ \indent\indent\text{if $\pi_{t,i}\leq v_{t,i}(e+B\eta){\cdot}\eta$}\\ \pi_{t,i}{\cdot}[1/\eta+(B/\eta){\cdot}({\partial\eta}/{\partial e})]&\\ \indent\indent\text{if $v_{t,i}(e+B\eta){\cdot}\eta<\pi_{t,i}\leq v_{t,i}(e){\cdot}\eta$}\\ v_{t,i}(e)&\\ \indent\indent\text{if $v_{t,i}(e){\cdot}\eta<\pi_{t,i}\leq[v_{t,i}(e)/\eta+c]^{+}$}\\ (\pi_{t,i}-c){\cdot}[\eta+(P/\eta){\cdot}({\partial\eta}/{\partial e})]-P{\cdot}{\partial c}/{\partial e}&\\ \indent\indent\text{if $[v_{t,i}(e)/\eta+c]^{+}<\pi_{t,i}$}\text{$\leq[v_{t,i}(e-P/\eta)/\eta+c]^{+}$}\\ [1-(1/\eta){\cdot}({\partial P}/{\partial e})+{P{\cdot}(1/\eta)}^{2}{\cdot}({\partial\eta}/{\partial e})]{\cdot}v_{t,i}(e-P/\eta)\\ +(\pi_{t,i}-c){\cdot}{\partial P}/{\partial e}-P{\partial c}/{\partial e}&\\ \indent\indent\text{if $\pi_{t,i}>[v_{t,i}(e-P/\eta)/\eta+c]^{+}$}\end{cases}

Note that η\eta, B, P and c depend on the starting SoC e as formulated in (2). The function form of these nonlinear parameters in (6) is omitted to simplify the mathematical representation.

We restate the solution algorithm to compute the value function from [35] which enforces a final SoC value higher than a given threshold efe^{f}. In this algorithm implementation we discretize vt,iv_{t,i} into a set of \mathcal{M} segments with value and SoC pairs

v^t,i={νt,i,m|m}\displaystyle\hat{v}_{t,i}=\{\nu_{t,i,m}|m\in\mathcal{M}\} (7)

associated with equally spaced SoC segments et,me_{t,m}. In our implementation, we discretized the SoC into 1000 segments. The valuation algorithm is listed as following

  1. 1.

    Set TtT\to t to start from the last time period; initialize the final value-to-go function segments νT,m\nu_{T,m} to zeros for eT,m>efe_{T,m}>e^{f} and to a very high value (we use $1000/MWh) for eT,mefe_{T,m}\leq e^{f}. Note that the final value function does not depends on price nodes.

  2. 2.

    Go to the earlier time step by setting t1tt-1\to t.

  3. 3.

    During period tt, go through each price node for i𝒩i\in\mathcal{N} and value function segment mm\in\mathcal{M}. Update the charge and discharge efficiency corresponding to the SoC segment, compute (1) and store qt1,i(e)q_{t-1,i}(e); note that here qt1,i(et1,m)q_{t-1,i}(e_{t-1,m}) is also discretized with the same granularity as the value function.

  4. 4.

    Calculate the value function of the previous time step as

    νt1,i,m=j𝒩ρi,j,tqt1,j(et,m)\displaystyle\nu_{t-1,i,m}=\textstyle\sum_{j\in\mathcal{N}}\rho_{i,j,t}q_{t-1,j}(e_{t,m}) (8)

    which is the derivative of (5b).

  5. 5.

    Go to step 2) until reaching the first time step.

-C Control Policy for Single Storage Device

We restate the control policy from [35]. After the value function computation step, control can be executed by responding to realized market prices and looking for the closest price node πt,i\pi_{t,i} such that π¯t,iλt<π¯t,i\underline{\pi}_{t,i}\leq\lambda_{t}<\overline{\pi}_{t,i}, then the storage control decision is updated as

pt\displaystyle p_{t} =min{p^t,et1η}\displaystyle=\min\{\hat{p}_{t},e_{t-1}\eta\} (9a)
bt\displaystyle b_{t} =min{b^t,(Eet1)/η}\displaystyle=\min\{\hat{b}_{t},(E-e_{t-1})/\eta\} (9b)
where p^t\hat{p}_{t} and b^t\hat{b}_{t} are calculated as
{p^t,b^t}=\displaystyle\{\hat{p}_{t},\hat{b}_{t}\}=
{{0,B}if λtvt,i(e+Bη)η{0,α}if vt,i(e+Bη)η<λtvt,i(e)η{0,0}if vt,i(e)η<λt[vt,i(e)/η+c]+{β,0}if [vt,i(e)/η+c]+<λt[vt,i(eP/η)/η+c]+{P,0}if λt>[vt,i(eP/η)/η+c]+\displaystyle\begin{cases}\{0,B\}&\text{if $\lambda_{t}\leq v_{t,i}(e+B\eta)\eta$}\\ \{0,\alpha\}&\text{if $v_{t,i}(e+B\eta)\eta<\lambda_{t}\leq v_{t,i}(e)\eta$}\\ \{0,0\}&\text{if $v_{t,i}(e)\eta<\lambda_{t}\leq[v_{t,i}(e)/\eta+c]^{+}$}\\ \{\beta,0\}&\text{if $[v_{t,i}(e)/\eta+c]^{+}<\lambda_{t}$}\\ &\quad\text{$\leq[v_{t,i}(e-P/\eta)/\eta+c]^{+}$}\\ \{P,0\}&\text{if $\lambda_{t}>[v_{t,i}(e-P/\eta)/\eta+c]^{+}$}\end{cases} (9c)
in which α\alpha and β\beta are given as follows
α\displaystyle\alpha =(vt,i1(λt/η)et1)/η\displaystyle=(v^{-1}_{t,i}(\lambda_{t}/\eta)-e_{t-1})/\eta (9d)
β\displaystyle\beta =(et1vt,i1((λtc)η))/η\displaystyle=(e_{t-1}-v^{-1}_{t,i}((\lambda_{t}-c)\eta))/\eta (9e)
where vt,i1v^{-1}_{t,i} is the inverse function of vt,iv_{t,i}.

(9a) and (9b) enforce the battery SoC constraints over the discharge p^t\hat{p}_{t} and charge b^t\hat{b}_{t} decisions. (9c) calculates control decisions and following the same principle as to (2) but use the observed price λt\lambda_{t} instead of the price nodes πt,i\pi_{t,i}. The control policy uses the approximated values of B, P, η\eta and c (all 4 could be nonlinear) corresponding to the current SoC.

-D MILP Formulation

We start by showing below the multi-period arbitrage formulation, which is equivalent to our proposed stochastic dynamic programming formulation if assuming a deterministic price process πt\pi_{t} and also add a penalty function CendC_{end} and a weighing parameter α\alpha to represent the cost associated with missing a final SoC target (the choice of α\alpha must achieve a comparable charging compliance target performance as the deterministic dynamic programming solution):

maxpt,btαCend+tTπt(ptbt)cpt s.t.(1c),(1e),(1f)\displaystyle\max_{p_{t},b_{t}}\quad-\alpha C_{end}+\sum^{T}_{t}\pi_{t}{\cdot}(p_{t}-b_{t})-cp_{t}\textbf{ s.t.}\quad\text{(1c),(1e),(1f)}

We modify this model to a MILP model for the variable power rating, discharge penalty and efficiency benchmark calculation with ten SoC-efficiency segment pairs as

maxpk,t,bk,tαCend+tTkKπt(pk,tbk,t)ckpk,t\displaystyle\max_{p_{k,t},b_{k,t}}\quad-\alpha C_{end}+\sum^{T}_{t}\sum_{k}^{K}\pi_{t}{\cdot}(p_{k,t}-b_{k,t})-c_{k}p_{k,t} (11a)
s.t.0kKbk,t/Bk1, 0kKpk,t/Pk1\displaystyle\textbf{s.t.}\quad 0\leq\sum_{k}^{K}b_{k,t}/B_{k}\leq 1,\;0\leq\sum_{k}^{K}p_{k,t}/P_{k}\leq 1 (11b)
ek,tek,t1=pk,t/ηk+bk,tηk\displaystyle e_{k,t}-e_{k,t-1}=-p_{k,t}/\eta_{k}+b_{k,t}\eta_{k} (11c)
E1u1,te1,tE1\displaystyle E_{1}u_{1,t}\leq e_{1,t}\leq E_{1} (11d)
Ekuk,tek,tEkuk1,t,k{2,,K1}\displaystyle E_{k}u_{k,t}\leq e_{k,t}\leq E_{k}u_{k-1,t},\quad\forall k\in\{2,...,K-1\} (11e)
0eK,tEKuK1,t\displaystyle 0\leq e_{K,t}\leq E_{K}u_{K-1,t} (11f)
Cend=(kKek,Tef)2\displaystyle C_{end}=(\sum_{k}^{K}e_{k,T}-e^{f})^{2} (11g)

where kk is the index of the nonlinear power rating, efficiency and cycling penalty approximation segments (10 segments in this case). (11a) is the objective function which sums up all segments. (11b) and (11c) are the power rating constraints and energy storage evolution constraints implement on all segments. (11d)-(11f) model the piece-wise linear approximation to the battery nonlinear parameter curves with binary variables uk,tu_{k,t}, which enforce the lower SoC segment must be full before upper SoC segments can take on non-zero values. For this paper’s simulations, an α\alpha value of 1000000 is used.

In the EVCS context, this optimization step fits in step 2) of the solution algorithm proposed in 4.3 (it replaces the value function calculation step). Every time an EV arrives at the EVCS, the MILP will provide an optimal schedule for the EV to follow for the remainder of the session. If the EV is deviated from the provided optimal schedule due to a low priority assigned during the LLF scheduling step, a new optimal schedule for the remainder of the session will be computed.