Decomposed Phase Analysis using Convex Inner Approximations: a Methodology for DER Hosting Capacity in Distribution Systems
This paper uses convex inner approximations (CIA) of the AC power flow to tackle the optimization problem of quantifying a three-phase distribution feeder's capacity to host distributed energy resources (DERs). This is often connoted hosting capacity (HC), but herein we consider separative bounds for each node on positive and negative DER injections, which ensures that injections within these nodal limits satisfy feeder voltage and current limits and across nodes sum up to the feeder HC. The methodology decomposes a three-phase feeder into separate phases and applies CIA-based techniques to each phase. An analysis is developed to determine the technical condition under which this per-phase approach can still guarantee three-phase constraints. New approaches are then presented that modify the per-phase optimization problems to overcome conservativeness inherent to CIA methods and increase HC, including selectively modifying the per-phase impedances and iteratively relaxing per-phase voltage bounds. Discussion is included on trade-offs and feasibility. To validate the methodology simulation-based analysis is conducted with the IEEE 37-node test feeder and a real 534-node unbalanced radial distribution feeder.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Inner-approximate Reachability Computation via Zonotopic Boundary Analysis
Inner-approximate reachability analysis involves calculating subsets of reachable sets, known as inner-approximations. This analysis is crucial in the fields of dynamic systems analysis and control theory as it provides …
Adaptive Sampling Strategies for Stochastic Optimization
In this paper, we propose a stochastic optimization method that adaptively controls the sample size used in the computation of gradient approximations. Unlike other variance reduction techniques that either require addit…
regressionStochastic OptimizationSmall random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction
Recently there has been significant theoretical progress on understanding the convergence and generalization of gradient-based methods on nonconvex losses with overparameterized models. Nevertheless, many aspects of opti…
Semi-Inner-Products for Convex Functionals and Their Use in Image Decomposition
Semi-inner-products in the sense of Lumer are extended to convex functionals. This yields a Hilbert-space like structure to convex functionals in Banach spaces. In particular, a general expression for semi-inner-products…
Convergence of Meta-Learning with Task-Specific Adaptation over Partial Parameters
Although model-agnostic meta-learning (MAML) is a very successful algorithm in meta-learning practice, it can have high computational cost because it updates all model parameters over both the inner loop of task-specific…
Meta-Learning