Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.03149

A Stochastic-Robust Approach for Resilient Microgrid Investment Planning Under Static and Transient Islanding Security Constraints

Agnes Marjorie Nakiganda·Shahab Dehghan·Uros Markovic·Gabriela Hug·Petros Aristidou
View original source ↗Read source document ↗Export metadata ↓

Abstract

When planning the investment in Microgrids (MGs), usually static security constraints are included to ensure their resilience and ability to operate in islanded mode. However, unscheduled islanding events may trigger cascading disconnections of Distributed Energy Resources (DERs) inside the MG due to the transient response, leading to a partial or full loss of load. In this paper, a min-max-min, hybrid, stochastic-robust investment planning model is proposed to obtain a resilient MG considering both High-Impact-Low-Frequency (HILF) and Low-Impact-High-Frequency (LIHF) uncertainties. The HILF uncertainty pertains to the unscheduled islanding of the MG after a disastrous event, and the LIHF uncertainty relates to correlated loads and DER generation, characterized by a set of scenarios. The MG resilience under both types of uncertainty is ensured by incorporating static and transient islanding constraints into the proposed investment model. The inclusion of transient response constraints leads to a min-max-min problem with a non-linear dynamic frequency response model that cannot be solved directly by available optimization tools. Thus, in this paper, a three-stage solution approach is proposed to find the optimal investment plan. The performance of the proposed algorithm is tested on the CIGRE 18-node distribution network.

Explore related subjects

math.OCcs.SYeess.SY

Keep this discovery

BibTeXRIS

Agnes Marjorie Nakiganda, Shahab Dehghan, Uros Markovic, Gabriela Hug, Petros Aristidou. 2020-07-07. A Stochastic-Robust Approach for Resilient Microgrid Investment Planning Under Static and Transient Islanding Security Constraints. https://arxiv.org/abs/2007.03149

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC↗
arXiv2026

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC↗
arXiv2026

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC↗