Fast selection of N-2 contingencies for online security assessment

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 com...

Full description

Bibliographic Details
Main Authors: Kaplunovich, P. A., Turitsyn, Konstantin
Other Authors: Massachusetts Institute of Technology. Department of Mechanical Engineering
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers (IEEE) 2015
Online Access:http://hdl.handle.net/1721.1/97729
https://orcid.org/0000-0002-7997-8962
_version_ 1811073190953222144
author Kaplunovich, P. A.
Turitsyn, Konstantin
author2 Massachusetts Institute of Technology. Department of Mechanical Engineering
author_facet Massachusetts Institute of Technology. Department of Mechanical Engineering
Kaplunovich, P. A.
Turitsyn, Konstantin
author_sort Kaplunovich, P. A.
collection MIT
description 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.
first_indexed 2024-09-23T09:29:47Z
format Article
id mit-1721.1/97729
institution Massachusetts Institute of Technology
language en_US
last_indexed 2024-09-23T09:29:47Z
publishDate 2015
publisher Institute of Electrical and Electronics Engineers (IEEE)
record_format dspace
spelling mit-1721.1/977292022-09-26T11:45:49Z Fast selection of N-2 contingencies for online security assessment Kaplunovich, P. A. Turitsyn, Konstantin Massachusetts Institute of Technology. Department of Mechanical Engineering Kaplunovich, P. A. Turitsyn, Konstantin 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. National Science Foundation (U.S.) MIT Skoltech Initiative 2015-07-13T18:25:38Z 2015-07-13T18:25:38Z 2013-07 Article http://purl.org/eprint/type/ConferencePaper 978-1-4799-1303-9 1944-9925 http://hdl.handle.net/1721.1/97729 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). https://orcid.org/0000-0002-7997-8962 en_US http://dx.doi.org/10.1109/PESMG.2013.6672792 Proceedings of the 2013 IEEE Power & Energy Society General Meeting Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv
spellingShingle Kaplunovich, P. A.
Turitsyn, Konstantin
Fast selection of N-2 contingencies for online security assessment
title Fast selection of N-2 contingencies for online security assessment
title_full Fast selection of N-2 contingencies for online security assessment
title_fullStr Fast selection of N-2 contingencies for online security assessment
title_full_unstemmed Fast selection of N-2 contingencies for online security assessment
title_short Fast selection of N-2 contingencies for online security assessment
title_sort fast selection of n 2 contingencies for online security assessment
url http://hdl.handle.net/1721.1/97729
https://orcid.org/0000-0002-7997-8962
work_keys_str_mv AT kaplunovichpa fastselectionofn2contingenciesforonlinesecurityassessment
AT turitsynkonstantin fastselectionofn2contingenciesforonlinesecurityassessment