Robust AC Optimal Power Flow With Robust Convex Restriction
Robust AC Optimal Power Flow With Robust Convex Restriction
复制标题
DOI：
10.1109/tpwrs.2021.3075925
复制
发表时间：
2020-05
影响因子：
6.6
通讯作者：
Dongchan Lee;K. Turitsyn;D. Molzahn;Line A. Roald
中科院分区：
文献类型：
--
作者：
Dongchan Lee;K. Turitsyn;D. Molzahn;Line A. Roald
电网经常经历来自负荷需求和可再生能源的不确定波动，这构成了违反旨在保护系统的操作限制的风险。在本文中，我们考虑的鲁棒AC最优潮流问题，最大限度地减少发电成本，同时需要一定程度的系统安全存在的不确定性。鲁棒交流最优潮流问题要求系统在给定的不确定性集合内满足所有不确定性实现的运行极限。由于非凸、非线性AC潮流方程可能并不总是有解，因此保证鲁棒性特别具有挑战性。在这项工作中，我们将以前开发的凸约束扩展到鲁棒凸约束，这是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.