Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Critical Clearing Time Estimates of Power Grid Faults via a Set-Based Method (2211.15198v1)

Published 28 Nov 2022 in eess.SY, cs.SY, and math.OC

Abstract: This paper is concerned with estimating critical clearing times in the transient stability problem of power grids without extensive time-domain simulations. We consider a highdimensional post-fault system (the grid after the fault is cleared) which we decouple into many smaller subsystems. Then, for each subsystem, we find the so-called safety sets and simulate the faulted system once to deduce the so-called safe and unsafe critical clearing times, which specify the intervals of time over which the fault may remain active before safety is compromised. We demonstrate the approach with a numerical example involving the IEEE 14 bus system.

Summary

We haven't generated a summary for this paper yet.