loading page

Clustering-Based Partitioning of the Network Nodes Using Dynamic Responses and Global Distances
  • +1
  • Lorenzo Solida,
  • Pietro Colella,
  • Vincenzo Trovato,
  • Gianfranco Chicco
Lorenzo Solida
Pietro Colella
Vincenzo Trovato
Gianfranco Chicco

Corresponding Author:[email protected]

Author Profile

Abstract

This paper highlights the use of clustering algorithms to group power system nodes based on the dynamic responses to large disturbance events. An overall framework of analysis is presented. Starting from the choice of the events to analyze, the features used as inputs to the clustering procedure are defined, and the appropriate clustering algorithm is chosen. The features include parameters taken from the dynamic response and distance matrices calculated from the electrical distance, the Euclidean distance, and the Hausdorff and Wasserstein global distances. A statistically significant analysis is presented to select the number of clusters and compare the results obtained from clustering algorithms that depend on random choices in their solution process. The calculations are carried out on the dynamic model of the Great Britain 36-bus electricity transmission network. The most significant results of this study have been obtained by executing the spectral clustering algorithm with inputs from the Wasserstein distance matrix.
31 May 2024Submitted to TechRxiv
07 Jun 2024Published in TechRxiv