Power Systems Topology and State Estimation by Graph Blind Source Separation
Sivan Grotas, Yair Yakoby, Idan Gera, and Tirza Routtenberg

TL;DR
This paper introduces a novel approach to jointly estimate power system topology and states using graph blind source separation, leveraging maximum likelihood estimation and low-complexity algorithms, with performance close to theoretical bounds.
Contribution
It formulates the topology and state estimation as a graph BSS problem and develops practical low-complexity methods with theoretical performance guarantees.
Findings
ML-BEST achieves near-oracle state estimation performance.
Proposed methods accurately recover topology with low complexity.
Topology estimation MSE approaches the Cramer-Rao bound.
Abstract
In this paper, we consider the problem of blind estimation of states and topology (BEST) in power systems. We use the linearized DC model of real power measurements with unknown voltage phases (i.e. states) and an unknown admittance matrix (i.e. topology) and show that the BEST problem can be formulated as a blind source separation (BSS) problem with a weighted Laplacian mixing matrix. We develop the constrained maximum likelihood (ML) estimator of the Laplacian matrix for this graph BSS (GBSS) problem with Gaussian-distributed states. The ML-BEST is shown to be only a function of the states second-order statistics. Since the topology recovery stage of the ML-BEST approach results in a high-complexity optimization problem, we propose two low-complexity methods to implement it 1) Two- phase topology recovery, which is based on solving the relaxed convex optimization and then finding the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
