Controlled islanding of power networks based on graph reduction and spectral clustering
I. Tyuryukanov (TU Delft - Intelligent Electrical Power Grids)
Jairo Quirós-Tortós (University of Costa Rica)
M. Naglic (TU Delft - Intelligent Electrical Power Grids)
M Popov (TU Delft - Intelligent Electrical Power Grids)
Mart A.M.M. van der Meijden (TU Delft - Intelligent Electrical Power Grids, TenneT TSO B.V.)
V Terzija (The University of Manchester)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
Intentional controlled islanding aims to split the power system into self-sustainable islands after a severe disturbance, but prior the uncontrolled network separation. Given its nature (i.e. last resort for blackout prevention), this emergency control technique must be adopted as quickly as possible. This paper proposes a computationally efficient method based on graph reduction and spectral clustering. The paper contributes by describing important details of the graph reduction process in the context of controlled islanding and by the formalisation of this process. Furthermore, it demonstrates how to adopt embedded graphs to enhance the Multiway Spectral Clustering graph partitioning. Finally, it is shown how to explicitly incorporate important cannot-link constrains between coherent generator groups into the islanding problem. The proposed method is detailed using the IEEE 39-bus test case. To evaluate the algorithm performance, the method is applied to realistically-sized PEGASE test networks