Optimal decentralized protocol for electric vehicle charging
Optimal decentralized protocol for electric vehicle charging
复制标题
DOI：
10.1109/cdc.2011.6161220
复制
发表时间：
2011-12
影响因子：
6.6
通讯作者：
Lingwen Gan;U. Topcu;S. Low
中科院分区：
文献类型：
--
作者：
Lingwen Gan;U. Topcu;S. Low
提出了一种电动汽车充电优化调度的分散式算法。该算法利用电动汽车负荷的弹性来填充电力负荷分布中的凹陷。我们首先将电动汽车充电调度问题描述为一个最优控制问题，其目标是引入一个广义的谷填充概念，并研究最优充电曲线的性质。然后，我们给出了一个迭代求解最优控制问题的分散算法。在每次迭代中，电动汽车根据公用事业公司广播的控制信号更新其充电配置文件，公用事业公司更改控制信号以指导其更新。无论电动汽车的规格(例如，最大充电速率和截止日期)如何，该算法都收敛到最优充电配置文件(尽可能地平坦)，即使电动汽车不一定在每次迭代中更新它们的充电配置文件，并且在更新时使用可能过时的控制信号。此外，该算法只需要每辆电动汽车解决其局部问题，因此其实现需要很低的计算能力。我们还将算法扩展到跟踪给定的负载分布和实时实现。
We propose a decentralized algorithm to optimally schedule electric vehicle (EV) charging. The algorithm exploits the elasticity of electric vehicle loads to fill the valleys in electric load profiles. We first formulate the EV charging scheduling problem as an optimal control problem, whose objective is to impose a generalized notion of valley-filling, and study properties of optimal charging profiles. We then give a decentralized algorithm to iteratively solve the optimal control problem. In each iteration, EVs update their charging profiles according to the control signal broadcast by the utility company, and the utility company alters the control signal to guide their updates. The algorithm converges to optimal charging profiles (that are as “flat” as they can possibly be) irrespective of the specifications (e.g., maximum charging rate and deadline) of EVs, even if EVs do not necessarily update their charging profiles in every iteration, and use potentially outdated control signal when they update. Moreover, the algorithm only requires each EV solving its local problem, hence its implementation requires low computation capability. We also extend the algorithm to track a given load profile and to real-time implementation.