Distributed Optimal Power Flow Algorithms Over Time-Varying Communication Networks
arXiv:1904.11559
Abstract
In this paper, we consider the problem of optimally coordinating the response of a group of distributed energy resources (DERs) in distribution systems by solving the so-called optimal power flow (OPF) problem. The OPF problem is concerned with determining an optimal operating point, at which some cost function, e.g., generation cost or power losses, is minimized, and operational constraints are satisfied. To solve the OPF problem, we propose distributed algorithms that are able to operate over time-varying communication networks and have geometric convergence rate. We solve the second-order cone program (SOCP) relaxation of the OPF problem for radial distribution systems, which is formulated using the so-called DistFlow model. Theoretical results are further supported by the numerical simulations.
References in corpus (5)
- Distributed Optimal Power Flow for Smart Microgrids
- Optimal Distributed Control of Reactive Power via the Alternating Direction Method of Multipliers
- Distributed Optimal Power Flow Algorithm for Balanced Radial Distribution Networks
- Local Control of Reactive Power by Distributed Photovoltaic Generators
- Asynchronous ADMM for Distributed Non-Convex Optimization in Power Systems