arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.01653eess.SYcs.LGcs.SY
收藏

学习用拉格朗日法求解AC最优潮流

Learning to Solve the AC Optimal Power Flow via a Lagrangian Approach

Department of Electrical and Computer Engineering University of Washington(华盛顿大学电气与计算机工程系)

Ling Zhang, Baosen Zhang

摘要:

利用深度神经网络预测交流最优潮流(ACOPF)问题的解一直是一个活跃的研究方向。然而,由于ACOPF是非凸的,它是很难构建一个良好的数据集,包含大多数全局最优解。为了克服训练数据可能包含次优解的挑战,我们提出了一种基于拉格朗日的方法。首先,我们使用神经网络来学习ACOPF问题的对偶变量。然后,我们使用第二个神经网络来预测从预测的对偶变量的部分拉格朗日的解决方案。由于部分拉格朗日函数具有更好的优化效果,因此我们使用神经网络的预测解作为ACOPF问题的热启动。使用标准和修改的IEEE 22总线,39总线和118总线网络,我们表明,我们的方法是能够获得全局最优的成本,即使训练数据主要是由次优的解决方案。

英文摘要:

Using deep neural networks to predict the solutions of AC optimal power flow (ACOPF) problems has been an active direction of research. However, because the ACOPF is nonconvex, it is difficult to construct a good data set that contains mostly globally optimal solutions. To overcome the challenge that the training data may contain suboptimal solutions, we propose a Lagrangian-based approach. First, we use a neural network to learn the dual variables of the ACOPF problem. Then we use a second neural network to predict solutions of the partial Lagrangian from the predicted dual variables. Since the partial Lagrangian has a much better optimization landscape, we use the predicted solutions from the neural network as a warm start for the ACOPF problem. Using standard and modified IEEE 22-bus, 39-bus, and 118-bus networks, we show that our approach is able to obtain the globally optimal cost even when the training data is mostly comprised of suboptimal solutions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑