Search

Summary: In order to accommodate additional plug‐in electric vehicle (PEV) charging loads for existing distribution power grids, the vehicle‐to‐grid (V2G) technology has been regarded as a cost‐effective solution. Nevertheless, it can hardly scale up to large PEVs fleet coordination due to the computational complexity issue. In this paper, a centralized V2G scheme with distributed computing capability engaging internet of smart charging points (ISCP) is proposed. Within ISCP, each smart charging point equips a computing unit and does not upload PEV sensitive information to the energy coordinator, to protect PEV users' privacy. Particularly, the computational complexity can be decreased dramatically by employing distributed computing, viz., by decomposing the overall scheduling problem into many manageable sub‐problems. Moreover, six typical V2G scenarios are analyzed deliberately, and based on that, a load peak‐shaving and valley‐filling scheduling algorithm is built up. The proposed algorithm can be conducted in real‐time to mitigate the uncertainties in arrival time, departure time, and energy demand. Finally, the proposed scheme and its algorithm are verified under the distribution grid of the SUSTech campus (China). Compared with uncoordinated charging, the proposed scheme realizes load peak‐shaving and valley‐filling by 11.98% and 12.68%, respectively. The voltage values are ensured within the limitation range by engaging power flow calculation, in which the minimum voltage values are increasing and the maximum voltage values are decreasing with the expansion of PEV penetration. What is more, the computational complexity of peak‐shaving and valley‐filling strategy is near‐linear, which verifies the proposed scheme can be carried out very efficiently. [ABSTRACT FROM AUTHOR]

Coordinated charging can utilize the properties of electric vehicles (EVs) to obtain various benefits. However, there are two major challenges, viz. the uncertainty of EV charging behaviors and the overlong solving time for the optimal solutions in the charging scheduling problem of large-scale EVs. It is almost infeasible to precisely predict the charging information of EVs due to the uncertainty of their mobility as transportation tools. In order to tackle this issue, the real-time charging scheduling method is employed in this paper. Even so, the computational complexity is crucially important in the real-time scheduling methods since the charging strategies of large-scale EVs must be acquired in a short time. Hence, a high efficient methodology is proposed for EV real-time scheduling based on the definition of capacity margin index and charging priority index. Finally, the simulation results show that the proposed scheduling method has a significant superiority over the uncoordinated charging in the regard of relieving the demand stress on the power system. Moreover, the complexity analysis demonstrates that the proposed method has near-linear complexity so that it can acquire the optimal real-time charging scheme in a rather shorter time than other methods. [ABSTRACT FROM AUTHOR]