Title :
EV charging load scheduling with high wind power penetration: A robust shortest path approach
Author :
Qilong Huang ; Qing-Shan Jia ; Xiaohong Guan
Author_Institution :
Dept. of Autom., Tsinghua Univ., Beijing, China
Abstract :
Load scheduling is an effective way to improve the wind power penetration. Electric vehicle (EV) is an important type of the controllable load for its elasticity of charging time. However, the charging load of the EVs is random by nature and the accurate probability distributions of the wind power and EV parking event are hard to achieve. Therefore, in this paper, we consider scheduling EV charging load to improve the wind power penetration and reduce the charging cost. We make the following contributions. First, the EV load scheduling problem is formulated as the robust shortest path Markov Decision Process (MDP) to obtain a robust charging policy. The charging policy can reduce the charging cost even under the worst-case scenario of the wind power and EV parking event. Second, a Simulation-based Policy Improvement (SBPI) algorithm is developed to solve this robust shortest path problem. The robustness and the reduced charging cost are demonstrated through numerical results.
Keywords :
Markov processes; battery powered vehicles; load dispatching; power generation scheduling; power system economics; secondary cells; wind power plants; Markov decision process; charging cost; electric vehicle charging; high wind power penetration; load scheduling; probability distributions; robust charging policy; robust shortest path method; simulation based policy improvement algorithm; Load modeling; Mathematical model; Probability distribution; Random variables; Robustness; Vehicles; Wind power generation; Smart grid; electrical vehicles; robust shortest path; wind power;
Conference_Titel :
American Control Conference (ACC), 2015
Conference_Location :
Chicago, IL
Print_ISBN :
978-1-4799-8685-9
DOI :
10.1109/ACC.2015.7171153