Distributed Control of Charging for Electric Vehicle Fleets Under Dynamic Transformer Ratings

Due to their large power draws and increasing adoption rates, electric vehicles (EVs) will become a significant challenge for electric distribution grids. However, with proper charging control strategies, the challenge can be mitigated without the need for expensive grid reinforcements. This article presents and analyzes new distributed charging control methods to coordinate EV charging under nonlinear transformer temperature ratings. Specifically, we assess the tradeoffs between required data communications, computational efficiency, and optimality guarantees for different control strategies based on a convex relaxation of the underlying nonlinear transformer temperature dynamics. Classical distributed control methods, such as those based on dual decomposition and alternating direction method of multipliers (ADMM), are compared against the new augmented Lagrangian-based alternating direction inexact Newton (ALADIN) method and a novel low-information, look-ahead version of packetized energy management (PEM). These algorithms are implemented and analyzed for two case studies on residential and commercial EV fleets with fixed and variable populations. The latter motivates a novel EV hub charging model that captures arrivals and departures. Simulation results validate the new methods and provide insights into key tradeoffs

Distributed Online Modified Greedy Algorithm for Networked Storage Operation under Uncertainty

The integration of intermittent and stochastic renewable energy resources requires increased flexibility in the operation of the electric grid. Storage, broadly speaking, provides the flexibility of shifting energy over time; network, on the other hand, provides the flexibility of shifting energy over geographical locations. The optimal control of storage networks in stochastic environments is an important open problem. The key challenge is that, even in small networks, the corresponding constrained stochastic control problems on continuous spaces suffer from curses of dimensionality, and are intractable in general settings. For large networks, no efficient algorithm is known to give optimal or provably near-optimal performance for this problem. This paper provides an efficient algorithm to solve this problem with performance guarantees. We study the operation of storage networks, i.e., a storage system interconnected via a power network. An online algorithm, termed Online Modified Greedy algorithm, is developed for the corresponding constrained stochastic control problem. A sub-optimality bound for the algorithm is derived, and a semidefinite program is constructed to minimize the bound. In many cases, the bound approaches zero so that the algorithm is near-optimal. A task-based distributed implementation of the online algorithm relying only on local information and neighbor communication is then developed based on the alternating direction method of multipliers. Numerical examples verify the established theoretical performance bounds, and demonstrate the scalability of the algorithm.Comment: arXiv admin note: text overlap with arXiv:1405.778