Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2110.10551

Hosting Capacity Approach Implications

Narayan Bhusal·Andrija Sadikovic·Mohammed Ben-Idris
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper revisits the generation hosting capacity (HC) calculation approach to account for grid operational flexibility--the ability to reconfigure the system safely. In essence, the generation hosting capacity is determined against the set of limiting factors--voltage, thermal (conductor loading), reverse flow (at the feeder head, station transformer, or substation), and change in the voltage (due to sudden change in generation output)). Not that long ago, California Investor-Owned Utilities (IOUs) added a new criterion that does not allow reverse flow at the supervisory control and data acquisition (SCADA) points that can change the system configuration, aiming to prevent the potential transfer of reverse flow to an adjacent feeder. This new criterion intended to capture operational constraints as part of hosting capacity-known as hosting capacity with operational flexibility (OpFlex). This paper explores the shortfalls of such an approach and proposes performing actual transfer analysis when determining hosting capacity rather than implementing the OpFlex approach. Furthermore, we discuss the need for transition to determining hosting capacity profile (all intervals) rather than a flat line (one, worst performing interval) hosting capacity. A hosting capacity profile would inform the developers of interval-by-interval limits and opportunities, creating new opportunities to reach higher penetration of DERs at a lower cost. With technological and computational advancements, such an approach is neither out of implementation reach nor that computationally expensive. In return, far more DER can be interconnected once programmed not to violate certain generation profiles as part of the interconnection requirement, and utilities would be better informed of their actual operational flexibility, benefiting society overall.

Explore related subjects

eess.SYcs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Narayan Bhusal, Andrija Sadikovic, Mohammed Ben-Idris. 2021-10-20. Hosting Capacity Approach Implications. https://arxiv.org/abs/2110.10551

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

KEEP EXPLORING

Related papers

arXiv2026

Ensuring Stability of Non-Minimal Modes in Input-Output Data-Driven Representation

Many recent data-driven control approaches for linear time-invariant systems are based on output trajectory prediction using input-output data matrices. The system dynamics described by this predictor, which we refer to as the input-output data-driven representation, yields non-unique autoregressive with exogenous inputs (ARX) models having possibly unstable non-minimal modes. In this note, we show that the stability of these non-minimal modes is ensured by a certain choice of ARX model, which coincides with the minimum-norm least-squares predictor using the Moore-Penrose inverse of the data matrix. This stability guarantee holds regardless of the underlying system's stability. Moreover, the stability persists under sufficiently small noise in data when a suitably truncated Moore-Penrose inverse is used. Consequently, the ARX model need not be reduced to the true system order in order to avoid unstable additional modes.

eess.SY↗
arXiv2026

Optimization-Based Formation Flight on Libration Point Orbits

A model predictive control (MPC) framework is developed for station-keeping in spacecraft formation flight along libration point orbits. At each control period, the MPC policy solves a multi-vehicle optimal control problem (MVOCP) that tracks a reference trajectory, while enforcing path constraints on the relative motion of the formation. The control policy makes use of a limited set of control nodes consistent with operational constraints that allow only a small number of maneuver opportunities per revolution. To promote recursive feasibility, path constraints are progressively tightened across the prediction horizon. An isoperimetric reformulation of the constraints is used to prevent inter-sample violations. The resulting MVOCP is a nonconvex program, which is solved via sequential convex programming. The proposed approach is evaluated in a high-fidelity ephemeris model under uncertainties for a formation along the near-rectilinear halo orbit (NRHO), and subject to path constraints on inter-spacecraft separation and relative Sun phase angle. The results demonstrate maintenance of a spacecraft formation that satisfies the path constraints with realistic cumulative propellant consumption.

eess.SY↗
arXiv2026

Certificates Synthesis for A Class of Observational Properties in Stochastic Systems: A Unified Approach

In this paper, we investigate the probabilistic formal verification of stochastic dynamical systems over continuous state spaces. Motivated by problems in state estimation and information-flow security, we introduce the notion of observational properties, which characterize the inferences an external observer can draw from system outputs. These properties are formulated as probabilistic hyperproperties based on HyperLTL over finite traces, yielding a unified framework that subsumes several existing notions studied separately in the literature. We reduce the verification problem to reachability analysis over an augmented structure that integrates the system dynamics with an automaton representation of the specification. Building on this construction, we develop stochastic barrier certificates that provide probabilistic guarantees for property satisfaction while avoiding explicit state-space discretization. The effectiveness of the proposed framework is demonstrated through a case study.

eess.SY↗