TY - GEN
T1 - Estimating distribution grid topologies
T2 - 19th Power Systems Computation Conference, PSCC 2016
AU - Deka, Deepjyoti
AU - Backhaus, Scott
AU - Chertkov, Michael
N1 - Publisher Copyright:
© 2016 Power Systems Computation Conference.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - Distribution grids represent the final tier in electric networks consisting of medium and low voltage lines that connect the distribution substations to the end-users/loads. Traditionally, distribution networks have been operated in a radial topology that may be changed from time to time. Due to absence of a significant number of real-time line monitoring devices in the distribution grid, estimation of the topology/structure is a problem critical for its observability and control. This paper develops a novel graphical learning based approach to estimate the radial operational grid structure using voltage measurements collected from the grid loads. The learning algorithm is based on conditional independence tests for continuous variables over chordal graphs and has wide applicability. It is proven that the scheme can be used for several power flow laws (DC or AC approximations) and more importantly is independent of the specific probability distribution controlling individual bus's power usage. The complexity of the algorithm is discussed and its performance is demonstrated by simulations on distribution test cases.
AB - Distribution grids represent the final tier in electric networks consisting of medium and low voltage lines that connect the distribution substations to the end-users/loads. Traditionally, distribution networks have been operated in a radial topology that may be changed from time to time. Due to absence of a significant number of real-time line monitoring devices in the distribution grid, estimation of the topology/structure is a problem critical for its observability and control. This paper develops a novel graphical learning based approach to estimate the radial operational grid structure using voltage measurements collected from the grid loads. The learning algorithm is based on conditional independence tests for continuous variables over chordal graphs and has wide applicability. It is proven that the scheme can be used for several power flow laws (DC or AC approximations) and more importantly is independent of the specific probability distribution controlling individual bus's power usage. The complexity of the algorithm is discussed and its performance is demonstrated by simulations on distribution test cases.
KW - Computational Complexity
KW - Conditional Independence
KW - Distribution Networks
KW - Graphical Models
KW - Power Flows
UR - http://www.scopus.com/inward/record.url?scp=84986593807&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84986593807&partnerID=8YFLogxK
U2 - 10.1109/PSCC.2016.7541005
DO - 10.1109/PSCC.2016.7541005
M3 - Conference contribution
AN - SCOPUS:84986593807
T3 - 19th Power Systems Computation Conference, PSCC 2016
BT - 19th Power Systems Computation Conference, PSCC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 20 June 2016 through 24 June 2016
ER -