Search arXivSearch

arXiv · 2009.14458

DER Information Unaware Coordination via Day-ahead Dynamic Power Bounds

Abstract

Reliability and voltage quality in distribution networks have been achieved via a combination of transformer power rating satisfaction and voltage management asset control. To maintain reliable operation under this paradigm, however, future grids with deep DER penetrations would require costly equipment upgrades. These upgrades can be mitigated via judicious coordination of DER operation. Earlier work has assumed a hierarchical control architecture in which a global controller (GC) uses detailed power injection and DER data and knowledge of DER owners' objectives to determine setpoints that local controllers should follow in order to achieve reliable and cost effective grid operation. Having such data and assuming knowledge of DER owners' objectives, however, are often not desirable or possible. In an earlier work, a 2-layer DER coordination architecture was shown to achieve close to optimal performance despite infrequent communication to a global controller. Motivated by this work, this paper proposes a day-ahead coordination scheme that uses forecasted power profile ranges to generate day-ahead dynamic power rating bounds at each transformer. Novel features of this scheme include: (i) the GC knows only past node power injection data and does not impose or know DER owner objectives, (ii) we use bounds that ensure reliable operation to guide the local controllers rather than setpoint tracking, and (iii) we consider electric vehicle (EV) charging in addition to storage. Simulations using the IEEE 123-bus network show that with 50% solar, 50% EVs and 10% storage penetrations, the uncoordinated approach incurs rating violations at nearly all 86 transformers and results in 10 times higher voltage deviation, while our approach incurs only 12 rating violations and maintains almost the same voltage deviations as before the addition of solar and EVs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Navidi, Chloe Leblanc, Abbas El Gamal, Ram Rajagopal. 2020-09-30. DER Information Unaware Coordination via Day-ahead Dynamic Power Bounds. https://arxiv.org/abs/2009.14458

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

KEEP EXPLORING

Related papers

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

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

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