当前位置: X-MOL 学术Isa Trans. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An analysis of delay-constrained consensus-based optimal algorithms in virtual power plants
ISA Transactions ( IF 7.3 ) Pub Date : 2021-06-28 , DOI: 10.1016/j.isatra.2021.06.035
Chengrong Lin 1 , Bo Hu 1 , Changzheng Shao 1 , Tao Niu 1 , Qian Cheng 1 , Chunyan Li 1 , Kaigui Xie 1
Affiliation  

In virtual power plants (VPPs), consensus-based distributed optimal dispatch algorithms aim to collectively minimize the operating cost. As ubiquitous latency on communication networks may lead to divergence, convergence to a nonoptimal solution, or a longer convergence time, mitigating the impacts of arbitrarily large but bounded time-varying delays is significant both in theory and in practice. To modify a typical consensus-based optimal dispatch algorithm under time-varying delays, this paper designs new update rules and introduces a reduction approach to evaluate the performance of the algorithm. The results reveal that the modified algorithm can always converge to the optimal solution with a tactical initial setup in a distributed manner if the undirected interaction topology is connected and the gain parameter is sufficiently small. The analytical expression of the gain is also given. Furthermore, we show that the convergence time is determined by the maximum time delays, the number of generators, and the convergence accuracy. Several numerical simulation studies validate our theory.



中文翻译:

基于延迟约束共识的虚拟电厂优化算法分析

在虚拟电厂 (VPP) 中,基于共识的分布式优化调度算法旨在共同最小化运营成本。由于通信网络上普遍存在的延迟可能导致发散、收敛到非最优解或更长的收敛时间,因此减轻任意大但有界的时变延迟的影响在理论上和实践中都具有重要意义。为了在时变延迟下修改典型的基于共识的最优调度算法,本文设计了新的更新规则并引入了一种简化方法来评估算法的性能。结果表明,如果无向交互拓扑连通且增益参数足够小,改进后的算法总能以分布式方式收敛到具有战术初始设置的最优解。还给出了增益的解析表达式。此外,我们表明收敛时间由最大时间延迟、生成器数量和收敛精度决定。几项数值模拟研究验证了我们的理论。

更新日期:2021-06-28
down
wechat
bug