Result: Constrained spectral clustering based controlled islanding

Title:
Constrained spectral clustering based controlled islanding
Source:
Electrical power & energy systems. 63:687-694
Publisher Information:
Oxford: Elsevier, 2014.
Publication Year:
2014
Physical Description:
print, 20 ref
Original Material:
INIST-CNRS
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Key Laboratory of Power System Intelligent Dispatch and Control, Shandong University, Ministry of Education, Jinan 250061, China
The School of Electrical and Electronic Engineering, The University of Manchester, Manchester M13 9PL, United Kingdom
ISSN:
0142-0615
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Electrical engineering. Electroenergetics
Accession Number:
edscal.28711462
Database:
PASCAL Archive

Further Information

Controlled islanding, which splits the whole power system into islands, is an effective way of limiting blackouts during severe disturbances. Calculating islanding solutions in real time is difficult because of the combinatorial explosion of the solution space occurs for large power system. This paper proposes a computationally efficient controlled islanding algorithm that uses constrained spectral clustering. An undirected edge-weighted graph is constructed based on absolute values of active power flow and constraints related to transmission line availability and coherent generator groups are included by modifying the edge weights of the graph and using a subspace projection. Spectral clustering is then applied to the constrained solution subspace to find the islanding solution. To improve the clustering quality, a pre-processing procedure is used to detect and eliminate outliers in the eigenvectors of the graph before clustering. A robust k-medoids algorithm, which is less sensitive to outliers than the traditional k-means algorithm, is then used for clustering. Simulation results show that the proposed algorithm is computationally efficient when solving a controlled islanding problem in real-time.