Distributed Online Feedback Optimization for Real-time Distribution System Voltage Regulation
We investigate the real-time voltage regulation problem in distribution systems employing online feedback optimization (OFO) with short-range communication between physical neighbours. OFO does not need an accurate grid model nor estimated consumption of non-controllable loads, affords fast calculations, and demonstrates robustness to uncertainties and disturbances, which render it particularly suitable for real-time distribution system applications. However, many OFO controllers require centralized communication, making them susceptible to single-point failures. This paper proposes a distributed OFO design based on a nested feedback optimization strategy and analyzes its convergence. Numerical study results demonstrate that the proposed design achieves effective voltage regulation and outperforms other distributed and local approaches.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Providing Curative Distribution Grid Flexibility Using Online Feedback Optimization
Distribution grid flexibility is discussed as a possible measure in curative system operation, yielding a need for an efficient and robust coordination mechanism for the joint flexibility provision by individual units to…
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
Learning at the edges has become increasingly important as large quantities of data are continually generated locally. Among others, this paradigm requires algorithms that are simple (so that they can be executed by loca…
Policy Gradient with Self-Attention for Model-Free Distributed Nonlinear Multi-Agent Games
Multi-agent games in dynamic nonlinear settings are challenging due to the time-varying interactions among the agents and the non-stationarity of the (potential) Nash equilibria. In this paper we consider model-free game…
Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
This paper considers the distributed online bandit optimization problem with nonconvex loss functions over a time-varying digraph. This problem can be viewed as a repeated game between a group of online players and an ad…
Federated Online and Bandit Convex Optimization
We study the problems of distributed online and bandit convex optimization against an adaptive adversary. We aim to minimize the average regret on $M$ machines working in parallel over $T$ rounds with $R$ intermittent co…