A temporal-spatial charging coordination scheme incorporating probability of EV charging availability

The charging coordination of electric vehicle (EV) fleets in both temporal domain and spatial domain has attracted growing attention in recent years. Meanwhile, the uncertainties in EV arrival time and total available charging power from charging stations make the coordination problem highly dynamic and challenging. This paper develops a new temporal-spatial EV charging coordination scheme that jointly considers the above two major uncertainties. Firstly, EV charging scheduling (i.e., temporal coordination) is treated as a generalized Nash equilibrium game, in which each EV (including an upcoming EV) prefers to meet its own charging demand with minimized charging cost. The probability of EV charging availability is especially proposed to incorporate the charging demands of the upcoming EVs into the coordination scheme. In order to provide flexibility and private information protection, a distributed receding horizon optimization-based solution is developed, through which the Lagrange multipliers to reach the social equilibrium are determined via an iterative manner. The charging station selection is then recommended that minimizes the objective function over the entire optimization horizon. Finally, simulations under both small-scale and large-scale scenarios effectively demonstrate improved service quality of the EV charging, both in temporal and spatial domains, and avoidance of overload in charging stations. Results in a 150-EV scenario show that, averagely, the proposed method reduces battery SoC mismatch by 43% and increases degree of consistency by 5.9%.

Automated summary

This paper proposes a new temporal-spatial EV charging coordination scheme that considers the uncertainties in EV arrival time and total available charging power. Through the use of a generalized Nash equilibrium game and a distributed receding horizon optimization-based solution, the proposed method improves service quality of EV charging.