Optimal Decentralized Protocols for Electric Vehicle Charging

We propose decentralized algorithms for optimally scheduling electric vehicle charging. The algorithms exploit the elasticity and controllability of electric vehicle related loads in order to fill the valleys in electric demand profile. We formulate a global optimization problem whose objective is to impose a generalized notion of valley-filling, study properties of the optimal charging profiles, and give decentralized offline and online algorithms to solve the problem. In each iteration of the proposed algorithms, electric vehicles choose their own charging profiles for the rest horizon according to the price profile broadcast by the utility, and the utility updates the price profile to guide their behavior. The offline algorithms are guaranteed to converge to optimal charging profiles irrespective of the specifications (e.g., maximum charging rate and deadline) of electric vehicles at the expense of a restrictive assumption that all electric vehicles are available for negotiation at the beginning of the planning horizon. The online algorithms relax this assumption by using a scalar prediction of future total charging demand at each time instance and yield near optimal charging profiles. The proposed algorithms need no coordination among the electric vehicles, hence their implementation requires low communication and computation capability. Simulation results are provided to support these results

Constrained coordinated distributed control of smart grid with asynchronous information exchange

Smart grid constrained optimal control is a complex issue due to the constant growth of grid complexity and the large volume of data available as input to smart device control. In this context, traditional centralized control paradigms may suffer in terms of the timeliness of optimization results due to the volume of data to be processed and the delayed asynchronous nature of the data transmission. To address these limits of centralized control, this paper presents a coordinated, distributed algorithm based on distributed, local controllers and a central coordinator for exchanging summarized global state information. The proposed model for exchanging global state information is resistant to fluctuations caused by the inherent interdependence between local controllers, and is robust to delays in information exchange. In addition, the algorithm features iterative refinement of local state estimations that is able to improve local controller ability to operate within network constraints. Application of the proposed coordinated, distributed algorithm through simulation shows its effectiveness in optimizing a global goal within a complex distribution system operating under constraints, while ensuring network operation stability under varying levels of information exchange delay, and with a range of network sizes

Control of MTDC Transmission Systems under Local Information

High-voltage direct current (HVDC) is a commonly used technology for long-distance electric power transmission, mainly due to its low resistive losses. In this paper a distributed controller for multi-terminal high-voltage direct current (MTDC) transmission systems is considered. Sufficient conditions for when the proposed controller renders the closed-loop system asymptotically stable are provided. Provided that the closed loop system is asymptotically stable, it is shown that in steady-state a weighted average of the deviations from the nominal voltages is zero. Furthermore, a quadratic cost of the current injections is minimized asymptotically