Abstract

This letter studies a topology identification problem for an electric distribution grid using sign patterns of the inverse covariance matrix of bus voltage magnitudes and angles, while accounting for hidden buses. Assuming the grid topology is sparse and the number of hidden buses are fewer than those of the observed buses, we express the observed voltages inverse covariance matrix as the sum of three structured matrices: sparse matrix, low-rank matrix with sparse factors, and low-rank matrix. Using the sign patterns of the first two of these matrices, we develop an algorithm to identify the topology of a distribution grid with a minimum cycle length greater than three. To estimate the structured matrices from the empirical inverse covariance matrix, we formulate a novel convex optimization problem with appropriate sparsity and structured norm constraints and solve it using an alternating minimization method. We validate the proposed algorithm's performance on a modified IEEE 33 bus system.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.