arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.04153math.OC
收藏

AC最优潮流中的联合机会约束:通过学习改进界

Joint Chance Constraints in AC Optimal Power Flow: Improving Bounds through Learning

Kyri Baker, Andrey Bernstein

摘要:

本文认为,配电系统的分布式,可再生能源发电的渗透率高,并解决了将相关的不确定性,这些网络的最优运行的问题。联合机会约束以给定的概率同时满足多个约束条件,是一种将不确定性纳入约束条件集的方法,从而得到机会约束最优潮流问题。本文从将联合约束转换为保守的确定性约束的基于计算量大的场景的方法或近似出发,开发了一种可扩展的、数据驱动的方法,该方法可以学习电网中的运行趋势,消除零概率事件(例如,无效约束),并且精确且有效地迭代地近似联合机会约束上的边界。特别是,所提出的框架改进了基于联合约束(或布尔不等式)的经典方法,通过生成一组保守得多的单一机会约束,也保证了原始联合约束的满足。建议的框架进行了评估,数值使用IEEE 37节点测试馈线,专注于配电网的电压调节问题。

英文摘要:

This paper considers distribution systems with a high penetration of distributed, renewable generation and addresses the problem of incorporating the associated uncertainty into the optimal operation of these networks. Joint chance constraints, which satisfy multiple constraints simultaneously with a prescribed probability, are one way to incorporate uncertainty across sets of constraints, leading to a chance-constrained optimal power flow problem. Departing from the computationally-heavy scenario-based approaches or approximations that transform the joint constraint into conservative deterministic constraints, this paper develops a scalable, data-driven approach which learns operational trends in a power network, eliminates zero-probability events (e.g., inactive constraints), and accurately and efficiently approximates bounds on the joint chance constraint iteratively. In particular, the proposed framework improves upon the classic methods based on the union bound (or Boole's inequality) by generating a much less conservative set of single chance constraints that also guarantees the satisfaction of the original joint constraint. The proposed framework is evaluated numerically using the IEEE 37-node test feeder, focusing on the problem of voltage regulation in distribution grids.

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

↑