Toward Simulation-Free Estimation of Critical Clearing Time

Thanh Long Vu, Surour M. Al Araifi, Mohamed S. El Moursi, Konstantin Turitsyn

Research output: Contribution to journalArticlepeer-review

33 Scopus citations

Abstract

Contingency screening for transient stability of large-scale, strongly nonlinear, interconnected power systems is one of the most computationally challenging parts of Dynamic Security Assessment and requires huge resources to perform time-domain simulations-based assessment. To reduce computational cost of time-domain simulations, direct energy methods have been extensively developed. However, these methods, as well as other existing methods, still rely on time-consuming numerical integration of the fault-on dynamics. This task is computationally hard, since possibly thousands of contingencies need to be scanned and thousands of accompanied fault-on dynamics simulations need to be performed and stored on a regular basis. In this paper, we introduce a novel framework to eliminate the need for fault-on dynamics simulations in contingency screening. This simulation-free framework is based on bounding the fault-on dynamics and extending the recently introduced Lyapunov Function Family approach for transient stability analysis of structure-preserving model. In turn, a lower bound of the critical clearing time is obtained by solving convex optimization problems without relying on any time-domain simulations. A comprehensive analysis is carried out to validate this novel technique on a number of IEEE test cases.

Original languageBritish English
Article number7420757
Pages (from-to)4722-4731
Number of pages10
JournalIEEE Transactions on Power Systems
Volume31
Issue number6
DOIs
StatePublished - Nov 2016

Keywords

  • Critical clearing time
  • simulation-free
  • synchronization
  • transient stability

Fingerprint

Dive into the research topics of 'Toward Simulation-Free Estimation of Critical Clearing Time'. Together they form a unique fingerprint.

Cite this