The DOI matches its Crossref record.
Two-Step Spectral Clustering Controlled Islanding Algorithm
Open accessAbstract
Controlled islanding is an active and effective way of avoiding catastrophic wide area blackouts. It is usually considered as a constrained combinatorial optimization problem. However, the combinatorial explosion of the solution space that occurs for large power systems increases the complexity of solving it. This paper proposes a two-step controlled islanding algorithm that uses spectral clustering to find a suitable islanding solution for preventing the initiation of wide area blackouts by un-damped electromechanical oscillations. The objective function used in this controlled islanding algorithm is the minimal power-flow disruption. The sole constraint applied to this solution is related to generator coherency. In the first step of the algorithm, the generator nodes are grouped using normalized spectral clustering, based on their dynamic models, to produce groups of coherent generators. In the second step of the algorithm, the islanding solution that provides the minimum power-flow disruption while satisfying the constraint of coherent generator groups is determined by grouping all nodes using constrained spectral clustering. Simulation results, obtained using the IEEE 9-, 39-, and 118-bus test systems, show that the proposed algorithm is computationally efficient when solving the controlled islanding problem, particularly in the case of a large power system.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Hierarchical Spectral Clustering of Power Grids
Sanchez-Garcia, R. J., Fennelly, M., Norris, S., Wright, N., Niblo, G., Brodzki, J., & Bialek, J. W. (2014) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2306756 · Cited by 262
Metadata
- Authors
- Ding, L., Gonzalez-Longatt, F. M., Wall, P., & Terzija, V.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2013-02
- Volume
- 28
- Issue
- 1
- Pages
- 75-84
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2178319414
- Cited by
- 283
- References
- 0
- FWCI
- 8.14
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Two-Step Spectral Clustering Controlled Islanding Algorithm. https://app.cochat.ai/papers/10.1109/tpwrs.2012.2197640
- The paper
- Ding, L., Gonzalez-Longatt, F. M., Wall, P., & Terzija, V. (2013). Two-Step Spectral Clustering Controlled Islanding Algorithm. IEEE Transactions on Power Systems. https://doi.org/10.1109/tpwrs.2012.2197640
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.