arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1910.09658eess.SYcs.SY
收藏

基于图神经网络的最优潮流

Optimal Power Flow Using Graph Neural Networks

Damian Owerko, Fernando Gama, Alejandro Ribeiro

摘要:

最优潮流是电力系统中最重要的优化问题之一。在其最简单的形式中,OPF试图找到电网内的发电机必须产生的最佳功率,以满足给定的需求。最优性是相对于每个发电机产生这种电力的成本来衡量的。由于发电的正弦性质,OPF问题是非凸的,因此难以求解。使用小角度近似会导致称为DC OPF的凸问题,但当电网负载很重时,这种近似不再有效。许多近似的解决方案已经提出,但这些都没有规模的大型电力网络。在本文中,我们提出使用图神经网络(这是本地化的,可扩展的参数化网络数据)训练下的模仿学习框架,以近似给定的最优解。虽然最优解的成本很高,但它只需要针对训练集中的网络状态进行计算。在测试期间,GNN充分学习如何计算OPF解决方案。在IEEE-30和IEEE-118测试用例上进行了数值实验。

英文摘要:

Optimal power flow (OPF) is one of the most important optimization problems in the energy industry. In its simplest form, OPF attempts to find the optimal power that the generators within the grid have to produce to satisfy a given demand. Optimality is measured with respect to the cost that each generator incurs in producing this power. The OPF problem is non-convex due to the sinusoidal nature of electrical generation and thus is difficult to solve. Using small angle approximations leads to a convex problem known as DC OPF, but this approximation is no longer valid when power grids are heavily loaded. Many approximate solutions have been since put forward, but these do not scale to large power networks. In this paper, we propose using graph neural networks (which are localized, scalable parametrizations of network data) trained under the imitation learning framework to approximate a given optimal solution. While the optimal solution is costly, it is only required to be computed for network states in the training set. During test time, the GNN adequately learns how to compute the OPF solution. Numerical experiments are run on the IEEE-30 and IEEE-118 test cases.

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

↑