论文标题
交替的当前模型中的最佳功率流追求
Optimal Power Flow Pursuit in the Alternating Current Model
论文作者
论文摘要
功率系统中的传输约束问题可以作为多项式优化问题施放，其系数随着时间而变化。我们考虑其中的并发症，并提出了几种方法。以交替电流最佳功率流（ACOPF）为例，我们详细说明了其中一种方法。对于随时间变化的ACOPF，我们为使用最新数据与当前算法产生的当前近似最佳成本的放松成本之间的差异提供了上限。该结合是实例属性的函数，并且随时间推移系数的变化速率。此外，我们还将浮点操作的数量限制为在两个后续更新之间执行，以确保有限的错误。
Transmission-constrained problems in power systems can be cast as polynomial optimization problems whose coefficients vary over time. We consider the complications therein and suggest several approaches. On the example of the alternating-current optimal power flows (ACOPFs), we illustrate one of the approaches in detail. For the time-varying ACOPF, we provide an upper bound for the difference between the optimal cost for a relaxation using the most recent data and the current approximate optimal cost generated by our algorithm. This bound is a function of the properties of the instance and the rate of change of the coefficients over time. Moreover, we also bound the number of floating-point operations to perform between two subsequent updates to ensure a bounded error.
