Documents

  • 27275087

    Accepted author manuscript, 921 KB, PDF-document

DOI

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
Original languageEnglish
Title of host publicationProceedings - Mediterranean Conference on Power Generation, Transmission, Distribution and Energy Conversion (MedPower 2016)
PublisherIET
Pages1-6
Number of pages6
ISBN (Electronic)978-1-78561-406-4
DOIs
Publication statusPublished - 2017
EventMedPower 2016: 10th Mediterranean Conference on Power Generation, Transmission, Distribution and Energy Conversion - Belgrade, Serbia
Duration: 6 Nov 20169 Nov 2016
Conference number: 10
http://www.medpower2016.com

Conference

ConferenceMedPower 2016
CountrySerbia
CityBelgrade
Period6/11/169/11/16
Internet address

    Research areas

  • wide-area protection and control, Controlled islanding, emergency control, spectral clustering

ID: 27275087