Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1410.0054

Dynamic Control and Optimization of Distributed Energy Resources in a Microgrid

Trudie Wang·Dan O'Neill·Haresh Kamath
View original source ↗Read source document ↗Export metadata ↓

Abstract

As we transition towards a power grid that is increasingly based on renewable resources like solar and wind, the intelligent control of distributed energy resources (DER) including photovoltaic (PV) arrays, controllable loads, energy storage and plug-in electric vehicles (EVs) will be critical to realizing a power grid that can handle both the variability and unpredictability of renewable energy sources as well as increasing system complexity. Realizing such a decentralized and dynamic infrastructure will require the ability to solve large scale problems in real-time with hundreds of thousands of DERs simultaneously online. Because of the scale of the optimization problem, we use an iterative distributed algorithm previously developed in our group to operate each DER independently and autonomously within this environment. The algorithm is deployed within a framework that allows the microgrid to dynamically adapt to changes in the operating environment. Specifically, we consider a commercial site equipped with on-site PV generation, partially curtailable load, EV charge stations and a battery electric storage (BES) unit. The site operates as a small microgrid that can participate in the wholesale market on the power grid. We report results for simulations using real data that demonstrate the ability of the optimization framework to respond dynamically in real-time to external conditions while maintaining the functional requirements of all DERs.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Trudie Wang, Dan O'Neill, Haresh Kamath. 2014-09-30. Dynamic Control and Optimization of Distributed Energy Resources in a Microgrid. https://arxiv.org/abs/1410.0054

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

KEEP EXPLORING

Related papers

arXiv2026

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC↗
arXiv2026

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC↗
arXiv2026

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC↗