arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1506.07152eess.SYcs.SY
收藏

迈向无模拟的临界清除时间估计

Toward Simulation-free Estimation of Critical Clearing Time

Massachusetts Institute of Technology(麻省理工学院);Masdar Institute(马斯达尔学院)

Thanh Long Vu, Surour Al Araifi, Mohamed Elmoursi, Konstantin Turitsyn

AI总结:

本文提出无模拟框架,通过凸优化求解获得临界清除时间下界,提升大规模电力系统暂态稳定评估效率。

摘要:

大规模强非线性互联电力系统暂态稳定 contingency 分析是动态安全评估中最具计算挑战性的部分,需要大量资源进行时域模拟。为降低时域模拟计算成本,直接能量方法被广泛开发。然而,这些方法及其他现有方法仍依赖耗时的故障发生动态数值积分。此任务计算困难,因为可能需要扫描数千种故障情景并执行数千次伴随故障发生动态模拟。本文引入一种新颖框架,消除故障发生动态模拟的需要。该无模拟框架基于对故障发生动态的界限,并扩展了最近提出的Lyapunov函数族方法用于结构保持模型的暂态稳定分析。从而通过求解凸优化问题获得临界清除时间(CCT)的下界,而无需依赖任何时域模拟。对多个IEEE测试案例进行了全面分析以验证该新方法。

英文摘要:

Contingency screening for transient stability of large-scale, strongly nonlinear, interconnected power systems is one of the most computationally challenging parts of Dynamic Security Assessment and requires huge resources to perform time-domain simulations-based assessment. To reduce computational cost of time-domain simulations, direct energy methods have been extensively developed. However, these methods, as well as other existing methods, still rely on time-consuming numerical integration of the fault-on dynamics. This task is computationally hard, since possibly thousands of contingencies need to be scanned and thousands of accompanied fault-on dynamics simulations need to be performed and stored on a regular basis. In this paper, we introduce a novel framework to eliminate the need for fault-on dynamics simulations in contingency screening. This simulation-free framework is based on bounding the fault-on dynamics and extending the recently introduced Lyapunov Function Family approach for transient stability analysis of structure-preserving model. In turn, a lower bound of the critical clearing time (CCT) is obtained by solving convex optimization problems without relying on any time-domain simulations. A comprehensive analysis is carried out to validate this novel technique on a number of IEEE test cases.

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

↑