计算机科学
网格
钥匙(锁)
计算复杂性理论
计算机安全模型
传输(电信)
智能电网
构造(python库)
网络安全
电力系统
分布式计算
计算机安全
功率(物理)
计算机网络
算法
数学
工程类
电信
量子力学
电气工程
物理
几何学
作者
Yan Yang,Xiaohong Guan,Qiaozhu Zhai
标识
DOI:10.1109/pesgm.2017.8274108
摘要
The challenge of grid security assessment with N-k contingencies lies in a huge amount of transmission security constraints and even for the modest values of N and k, the computational complexity would be very high. A new method for fast grid security assessment is presented in this paper for DC grid. The key idea is to construct a small number of representative constraints to equivalently represent the huge number of original security constraints. It is proved that applying the representative constraints is sufficient to assess grid security as the original security constraints do. An important feature of the new method is that the representative constraints need to be constructed only once offline. They are only related to the parameters of transmission network and do not change with power injections. Numerical testing is performed for IEEE-RTS 24-bus system, IEEE 118-bus system, and the Polish 2383-bus system. The number of representative constraints to be assessed is only 1.1%, 0.32%, and 0.27% of that of the original constraints, respectively, and the computational time of security assessment is greatly reduced.
科研通智能强力驱动
Strongly Powered by AbleSci AI