Plug-in Electric Vehicles (PEVs) are a rapidly developing technology that can reduce greenhouse gas emissions and change the way vehicles obtain power. PEV charging stations will most likely be available at home and at work, and occasionally be publicly available, offering flexible charging options. Ideally, each vehicle will charge during periods when electricity prices are relatively low, to minimize the cost to the consumer and maximize societ al benefits. A Demand Response (DR) service for a fleet of PEVs could yield such charging schedules by regulating consumer electricity use during certain time periods, in order to meet an obligation to the market. We construct an automated DR mechanism for a fleet of PEVs that facilitates vehicle charging to ensure the demands of the vehicles and the market are met. Our dynamic algorithm depends only on the knowledge of a few hundred driving behaviors from a previous similar day, and uses a simple adjusted pricing scheme to instantly assign feasible and satisfactory charging schedules to thousands of vehicles in a fleet as they plug-in. The charging schedules generated using our adjusted pricing scheme can ensure that a new demand peak is not created and can reduce the consumer cost by over 30 when compared to standard charging, which may also increase peak demand by 3.5 . In this paper, we present our formulation, algorithm and results.
in @cite_7 use dynamic programming to assign charging schedules that provide frequency regulation. Similarly, in the work by @cite_18 an algorithm is constructed that makes dynamic decisions for lowest-cost charging schedules of PEVs. Neither of these works considers an obligation to the market that needs to be met, and the demand of each vehicle is considered individually (i.e., not as part of a fleet); both suggested algorithms would result in an increased peak demand. In @cite_5 , establish a decentralized algorithm that determines an equilibrium price so that the total amount of charging done in the fleet fills the overnight demand valley.' This algorithm takes into account all vehicles in the fleet, but is not dynamic (i.e., it is solves an offline problem) and assumes only a few types of driving behaviors exist. A dynamic (or online) algorithm does not require that all vehicles are connected to the grid at the same time to exactly report their future driving schedules, and makes decisions for each vehicle without solving a problem that depends on knowing the demands of the entire fleet.
@cite_5 @cite_18 @cite_7
1964861297 1987809617 2024974439
The integration of Electric Vehicles (EVs) into the power grid is a challenging task. From the control perspective, one of the main challenges is the definition of a comprehensive control structure that is scalable to large EV numbers. This paper makes two key contributions: (i) It defines the EV ADMM framework for decentralized EV charging control. (ii) It evaluates EV ADMM using actual data and various EV fleet control problems. EV ADMM is a decentralized optimization algorithm based on the Alternating Direction Method of Multipliers (ADMM). It separates the centralized optimal fleet charging problem into individual optimization problems for the EVs plus one aggregator problem that optimizes fleet goals. Since the individual problems are coupled, they are solved consistently by passing incentive signals between them. The framework can be parameterized to trade-off the importance of fleet goals versus individual EV goals, such that aspects like battery lifetime can be considered. We show how EV ADMM can be applied to control an EV fleet to achieve goals such as demand valley filling and minimal-cost charging. Due to its flexibility and scalability, EV ADMM offers a practicable solution for optimal EV fleet control. Plug-in electric vehicles (PEVs) can be considered flexible loads, as the time when they are charged can be shifted to a certain extent without impacting the drivers' mobility. An aggregator coordinating these flexible resources aims to minimize the costs of charging, subject to individual PEV constraints, imposed by battery and charging infrastructure characteristics, as well as driving patterns. Since driving behavior cannot be perfectly forecasted, this problem is stochastic. In this paper, we propose a decentralized control algorithm to coordinate charging, based on the Alternating Direction Method of Multipliers (ADMM). In this setup, the aggregator and PEVs find the global solution by individually solving local optimization problems. The solution is found iteratively, whereby information between the PEVs and the aggregator is exchanged at each iteration. When the objective function of the charging optimization problem and the PEV constraints are convex, the algorithm converges to the global optimum. To take driving behavior uncertainty into account, the scheme considers several scenarios of driving patterns for each vehicle. A receding time horizon optimization is used, whereby at each new stage the representation of the fleet is updated with new scenarios consistent with the current observations. The local optimization problems, which can be solved very fast, could be solved in parallel for each PEV and scenario using decentralized computing, making the approach suitable for large-scale problems. A numerical example shows how this method can be applied to flatten the system load. Constrained charging control of large populations of Plug-in Electric Vehicles (PEVs) is addressed using mean field game theory. We consider PEVs as heterogeneous agents, with different charging constraints (plug-in times and deadlines). The agents minimize their own charging cost, but are weakly coupled by the common electricity price. We propose an iterative algorithm that, in the case of an infinite population, converges to the Nash equilibrium associated with a related decentralized optimization problem. In this way we approximate the centralized optimal solution, which in the unconstrained case fills the overnight power demand valley, via a decentralized procedure. The benefits of the proposed formulation in terms of convergence behavior and overall charging cost are illustrated through numerical simulations. The paper develops and illustrates a novel decentralized charging control algorithm for large populations of plug-in electric vehicles (PEVs). The proposed algorithm is an application of the so-called Nash certainty equivalence principle (or mean-field games.) The control scheme seeks to achieve social optimality by establishing a PEV charging schedule that fills the overnight demand valley. The paper discusses implementation issues and computational complexity, and illustrates concepts with various numerical examples.