Search arXivSearch

arXiv · 2110.05983

Network-Aware Flexibility Requests for Distribution-Level Flexibility Markets

Abstract

This paper proposes a method to design network-aware flexibility requests for local flexibility markets. These markets are becoming increasingly important for distribution system operators (DSOs) to ensure grid safety while minimizing costs and public opposition to new network investments. Despite extended recent literature on local flexibility markets, little attention has been paid to quantifying the flexibility required at each location, considering physical network constraints (e.g. line and voltage limits). The method introduced uses a chance-constrained optimization model and a LinDistFlow approximation to consider both physical network constraints and uncertainty caused by renewable production or demand fluctuations. Unlike other methods, it avoids sharing sensitive grid data with the market operator. We compare our approach against a stochastic market-clearing mechanism which serves as a benchmark, and we derive analytical conditions for the performance of our method to determine flexibility requests. We show on two case studies that our method outperforms the stochastic market-clearing benchmark in terms of computation time while achieving comparable social welfare and costs for the DSOs. One of the case studies is conducted on an actual German distribution grid, showing that the proposed method can scale well to real-sized networks.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eléa Prat, Irena Dukovska, Lars Herre, Rahul Nellikkath, Malte Thoma, Spyros Chatzivasileiadis. 2023-05-24. Network-Aware Flexibility Requests for Distribution-Level Flexibility Markets. https://doi.org/10.1109/tpwrs.2023.3280366

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

KEEP EXPLORING

Related papers

Genericity of Polyak-Lojasiewicz Inequalities for Entropic Mean-Field Neural ODEs

We address the behavior of idealized deep residual neural networks (ResNets), modeled via an optimal control problem set over continuity (or adjoint transport) equations. The continuity equations describe the statistical evolution of the features in the asymptotic regime where the layers of the network form a continuum. The velocity field is expressed through the network activation function, which is itself viewed as a function of the statistical distribution of the network parameters (weights and biases). From a mathematical standpoint, the control is interpreted in a relaxed sense, taking values in the space of probability measures over the set of parameters. We investigate the optimal behavior of the network when the cost functional arises from a regression problem and includes an additional entropic regularization term on the distribution of the parameters. In this framework, we focus in particular on the existence of stable optimizers --that is, optimizers at which the Hessian of the cost is non-degenerate. We show that, for an open and dense set of initial data, understood here as probability distributions over features and associated labels, there exists a unique stable global minimizer of the control problem. Moreover, we show that such minimizers satisfy a local Polyak--Lojasiewicz inequality, which can lead to exponential convergence of the corresponding gradient descent when the initialization lies sufficiently close to the optimal parameters. This result thus demonstrates the genericity (with respect to the distribution of features and labels) of the Polyak--Lojasiewicz condition in ResNets with a continuum of layers and under entropic penalization.

math.OC

A regret minimization approach to fixed-point iterations

We propose a conversion scheme that turns regret minimizing algorithms into fixed point iterations, with convergence guarantees following from regret bounds. The resulting iterations can be seen as a grand extension of the classical Krasnoselskii--Mann iterations, as the latter are recovered by converting the Online Gradient Descent algorithm. This approach yields new simple iterations for finding fixed points of non-self operators. We also focus on converting algorithms from the AdaGrad family of regret minimizers, and thus obtain fixed point iterations with adaptive guarantees of a new kind. Numerical experiments on various problems demonstrate faster convergence of AdaGrad-based fixed point iterations over Krasnoselskii--Mann iterations.

math.OC

Variational Analysis in Spectral Decomposition Systems

This work is concerned with the variational analysis of functions defined on Euclidean spaces whose values depend solely on certain invariants (``spectrum'') of their arguments, a class we term ``spectral functions.'' Building on our previous work \cite{PartI} on the convex analysis of such functions, we work in the abstract framework of spectral decomposition systems, which covers a wide range of previously studied settings, including eigenvalue decomposition of Hermitian matrices and singular value decomposition of rectangular matrices, and allows the derivation of new results in more general settings such as normal decomposition systems. The main results of this work provide constructive formulae for computing the regular, limiting, and Clarke subdifferentials of a spectral function in terms of the corresponding objects of the associated invariant function. Finally, we obtain a generalization of Lidski\uı's theorem on the spectrum of additive perturbations of Hermitian matrices to arbitrary spectral decomposition systems.

math.OC