论文标题
强大的AC最佳功率流和强大的凸限制
Robust AC Optimal Power Flow with Robust Convex Restriction
论文作者
论文摘要
电力电网经常会因负载需求和可再生能源而发生不确定的波动,这构成了违反旨在保护系统的操作限制的风险。在本文中,我们考虑了强大的AC OPF问题,该问题可以最大程度地减少发电成本,同时在存在不确定性的情况下需要一定水平的系统安全性。强大的AC OPF问题要求该系统满足指定不确定性集中所有不确定性实现的操作限制。由于非凸,非线性交流电源流程方程,保证鲁棒性尤其具有挑战性,这可能并不总是具有解决方案。在这项工作中,我们将先前开发的凸限制扩展到了稳健的凸限制,这是AC OPF问题的非凸起可行区域的凸内部近似,该区域解释了功率注射的不确定性。然后,我们在算法中使用可靠的凸限制,该算法通过解决一系列凸优化问题来获得AC OPF问题的强大解决方案。我们证明了我们的算法及其控制鲁棒性与使用PGLIB测试用例的运营成本权衡的能力。
Electric power grids regularly experience uncertain fluctuations from load demands and renewables, which poses a risk of violating operational limits designed to safeguard the system. In this paper, we consider the robust AC OPF problem that minimizes the generation cost while requiring a certain level of system security in the presence of uncertainty. The robust AC OPF problem requires that the system satisfy operational limits for all uncertainty realizations within a specified uncertainty set. Guaranteeing robustness is particularly challenging due to the non-convex, nonlinear AC power flow equations, which may not always have a solution. In this work, we extend a previously developed convex restriction to a robust convex restriction, which is a convex inner approximation of the non-convex feasible region of the AC OPF problem that accounts for uncertainty in the power injections. We then use the robust convex restriction in an algorithm that obtains robust solutions to AC OPF problems by solving a sequence of convex optimization problems. We demonstrate our algorithm and its ability to control robustness versus operating cost trade-offs using PGLib test cases.