Fast selection of N-2 contingencies for online security assessment
Name
Turitsyn_Fast selection.pdf
Size
289 KB
Format
Adobe PDF
Checksum (MD5)
29e65861c812d33ecface1f9193b45eb
Author(s)
Kaplunovich, P. A.
Turitsyn, Konstantin
Date Issued
July 2013
Journal
Proceedings of the 2013 IEEE Power & Energy Society General Meeting
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kaplunovich, P. A., and K. S. Turitsyn. “Fast Selection of N-2 Contingencies for Online Security Assessment.” 2013 IEEE Power & Energy Society General Meeting (2013).
Version
Original manuscript
Abstract
We propose a novel algorithm for selection of dangerous N-2 contingencies associated with line or generator failures. The algorithm is based on iterative filtering of the set of all possible double contingencies. It is certified to identify all the dangerous contingencies, and has the complexity comparable to the N-1 contingency screening. Tests performed on realistic model of Polish power grid with about 3000 buses show that only two iterations of algorithm allow one to certify the safety of 99.9% of all double contingencies, leaving only 0.1% of the most dangerous ones for direct analysis.
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/PESMG.2013.6672792
