Metraipolis › archive › dc_818402ee0bca
Controlled Islanding and Reconnection with Stability Guarantees via Submodular Optimization — arXiv:2609.12335
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12335
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T04:27:55.214Z
- SHA-256 of the archived text
2c46ad491b0042387a424b3fb4532181b68c6ad53da5bd9ed1775e38bb010163- Stable URL of this page
https://metraipolis.com/documento/dc_818402ee0bca
How to cite
Controlled Islanding and Reconnection with Stability Guarantees via Submodular Optimization — arXiv:2609.12335 — arXiv (en), https://arxiv.org/abs/2609.12335 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_818402ee0bca (Metraipolis archive dc_818402ee0bca, sha256 2c46ad491b0042387a424b3fb4532181b68c6ad53da5bd9ed1775e38bb010163)
BibTeX
@misc{dc818402ee0bca,
title = {Controlled Islanding and Reconnection with Stability Guarantees via Submodular Optimization — arXiv:2609.12335},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12335},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_818402ee0bca; sha256 2c46ad491b0042387a424b3fb4532181b68c6ad53da5bd9ed1775e38bb010163},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12335. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In large-scale networked dynamical systems, local faults or disturbances may propagate through the interconnections and compromise the stability of the entire network. Partitioning the network into disjoint subsystems, or islands, limits this propagation by isolating unstable portions of the network from those that remain stable. This paper studies a two-stage controlled islanding and reconnection problem. In the first stage, the network is partitioned into stable and unstable islands. In the second stage, selected stable islands are reconnected to recover connectivity lost during islanding while satisfying stability requirements. We derive Lyapunov-based sufficient conditions for both stages. To address the coupling between the islanding and reconnection decisions, we construct an augmented graph on which the bases of a graphic matroid induce exactly the admissible islanding and reconnection pairs. We further show that the resulting optimization problem admits an equivalent nonincreasing supermodular formulation. Based on this structure, we develop a local-search algorithm with counterexample refinement and establish a performance guarantee for its inner loop with fixed sample sets. Numerical studies on linear networked systems illustrate the proposed procedure, examine its sensitivity to fault locations, and compare the proposed method with a mixed-integer linear programming benchmark in terms of solution quality and computational performance. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-14 in eess.SY). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.12335 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T04:21:20.139Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).