A graph-theoretic algorithm for disturbance localization in large power grids using residue estimation

In this paper we consider the problem of localizing unknown disturbances in large power systems using a measurement-based graph theoretic method. We first show that the aggregate electro-mechanical model of the power system, under certain assumptions, can be analyzed analogously to a generic n^th-order asymmetric networked dynamic system. Considering that the network exhibits a clustering structure leading to slow and fast eigenvalues, we propose an input localization method based on the properties of the weak nodal domains corresponding to the first p dominant slow eigenvalues. In particular, we prove that for systems defined over p-area complete graphs the input localization is unique. We provide simulation results to illustrate our algorithm.