Identifying high risk N-k contingencies for online security assessment

被引：138

作者：

Chen, QM ^{[1
]}

McCalley, JD

机构：

[1] Iowa State Univ, Dept Elect & Comp Engn, Ames, IA 50011 USA

[2] PJM Interconnect, Eagleville, PA 19403 USA

来源：

IEEE TRANSACTIONS ON POWER SYSTEMS | 2005年 / 20卷 / 02期

关键词：

contingency identification; event tree; functional group; high-order contingency; power system; probability order; rare event approximation; security assessment; topology data; transmission;

D O I：

10.1109/TPWRS.2005.846065

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

It is impractical to analyze all of the possible contingencies in a large-scale interconnected power network. Therefore, a standard approach is to analyze only a subset of the contingencies. The normal method of selecting this subset is via use of the so-called N - 1 rule. This paper goes a step further by proposing a new method of forming a contingency list, based on substation configuration obtained from topology processing data and probability analysis of protection system failures. This method is particularly suited for online security assessment. Protection system failures assessed include stuck breakers and failure to operate. The method is described via application to a single substation,. verified using the IEEE-RTS96, and illustrated using topology data from a large utilities EMS.

引用

页码：823 / 834

页数：12