Searching for Plausible N-k Contingencies Endangering Voltage Stability

Johannes Tilman Gabriel Weckesser (Guest lecturer)

Activity: Talks and presentationsConference presentations

Description

Presentation of 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.
Period27 Sep 2017
Event title2017 IEEE PES Innovative Smart Grid Technologies Conference Europe
Event typeConference
LocationTorino, Italy
Degree of RecognitionInternational

Keywords

  • N-k contingencies
  • cascading outages
  • protection hidden failures
  • voltage instability
  • time-domain simulation