Scalable Quickest Line Outage Detection and Localization Via Graph Spectral Analysis

This paper proposes a scalable framework for the real-time detection and localization of power line outages in transmission networks. While localizing outages is pivotal for ensuring grid reliability, forming such decisions faces an inherent combinatorial complexity that grows with the grid size and becomes prohibitive even for moderate grid sizes. Hence, designing outage detection and localization algorithms that are amenable to real-time implementation critically hinges on circumventing the computational complexity. This paper proposes a graph-guided quickest change detection (GG-QCD) approach that leverages the grid topology and performs quickest change detection in the spectral domain of the graph underlying grid's topology. The GG-QCD algorithm's key features are that (i) it uses a one-dimensional metric that tests the data's conformity to the grid topology, and (ii) it decouples the detection and localization processes to avoid testing all the lines at all times. Specifically, a lack of such conformity of the data to the system model will be alarming the potential existence of an outage. Once an outage is deemed to exist, an active graph clustering approach will be used to localize the line in outage. The clustering approach will also be relying on the same one-dimensional conformity metric. Overall, this approach will be performing only one test over time when the system is outage-free. Once an outage is detected, it will require $\mathcal {O}(\log (L))$ additional tests to identify the line in outage. This paper presents the theory for GG-QCD and algorithms for outage detection and localization. To evaluate these algorithms’ efficiency and complexity, they are examined in the standard IEEE 30- and 118-bus systems.