Searching for Plausible N-k Contingencies Endangering Voltage Stability

Johannes Tilman Gabriel Weckesser, Thierry Van Cutsem

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

306 Downloads (Pure)

Abstract

This paper presents a novel search algorithm using time-domain simulations to identify plausible N − k contingencies endangering voltage stability. Starting from an initial list of disturbances, progressively more severe contingencies are investigated. After simulation of a N − k contingency, the simulation results are assessed. If the system response is unstable, a plausible harmful contingency sequence has been found. Otherwise, components affected by the contingencies are considered as candidate next event leading to N − (k + 1) contingencies. This implicitly takes into account hidden failures of component protections. The performance of the proposed search algorithm is compared to a brute-force algorithm and demonstrated on the IEEE Nordic test system.
Original languageEnglish
Title of host publicationProceedings of 7th IEEE International Conference on Innovative Smart Grid Technologies
Number of pages6
PublisherIEEE
Publication date2017
Publication statusPublished - 2017
Event7th IEEE International Conference on Innovative Smart Grid Technologies - Corso Duca degli Abruzzi, Torino, Italy
Duration: 26 Sep 201729 Sep 2017

Conference

Conference7th IEEE International Conference on Innovative Smart Grid Technologies
LocationCorso Duca degli Abruzzi
CountryItaly
CityTorino
Period26/09/201729/09/2017

Keywords

  • N-k contingencies
  • Cascading outages
  • Protection hidden failures
  • Voltage instability
  • Time-domain simulations

Fingerprint Dive into the research topics of 'Searching for Plausible N-k Contingencies Endangering Voltage Stability'. Together they form a unique fingerprint.

Cite this