Core Concepts
Identifying the full admittance matrix from its Kron reduction using a structured algorithm.
Abstract
The content discusses the identification of the admittance matrix of a three-phase radial network from voltage and current measurements. It outlines an algorithm to reverse Kron reduction, focusing on maximal cliques and subtrees in the graph structure. The process involves identifying interior and boundary measured nodes to reconstruct the full admittance matrix.
- Introduction to the network identification problem.
- Graph structures of Y and its Kron reduction ¯Y.
- Overall identification algorithm with five steps.
- Step 1: Identification of Y11,11, Y11,12, and Y11,21.
- Step 2: Maximal-clique decomposition of Y.
- Step 3: Identification of all maximal cliques in isolation.
- Step 4: Combining maximal cliques.
- Step 5: Putting back internal measured nodes.
Stats
Given the Kron-reduced admittance matrix ¯Y, partition M into interior measured nodes and boundary measured nodes.
Define the structure of the full admittance matrix Y with Y22 being invertible.
Quotes
"We consider the problem of identifying the admittance matrix of a three-phase radial network from voltage and current measurements."