Distributed Optimal Power Flow with Data-Driven Sensitivity Computation
Abstract
On account of the increasing influx of distributed energy resources into modern power grids, it is essential to develop efficient distributed control and optimization algorithms capable of providing suitable solutions with access to local data alone. This paper uses a distributed optimal power flow (OPF) algorithm based on a gradient projection method, which applies to any arbitrary grid topology, to solve the OPF problem. A multi-variable linear regression method learns the network sensitivities with historical operational data. The use of a data-driven approach avoids the requirement of accurate information on line parameters and network topology. Additionally, introduced curtailment cost factors into the objective cost function encourage the usage of renewable power sources. In conclusion, we show that the solution achieved using data-driven sensitivities provides an average optimality gap of 1.8% to the centralized OPF solution with numerical test results on a modified IEEE 69 bus system.
Authors 4
-
Affiliation as printed
Energy Efficiency and Energy Economics TU Dortmund,Institute of Energy Systems,Dortmund,Germany
Institute of Energy Systems, Energy Efficiency and Energy Economics TU Dortmund, Dortmund, Germany
-
Affiliation as printed
Rolls-Royce Power Systems,Friedrichshafen,Germany
Rolls-Royce Power Systems, Friedrichshafen, Germany
-
Affiliation as printed
RWTH Aachen University,Institute for Automation of Complex Power Systems,Aachen,Germany
Institute for Automation of Complex Power Systems, RWTH Aachen University, Aachen, Germany
-
Affiliation as printed
RWTH Aachen University,Institute for Automation of Complex Power Systems,Aachen,Germany
Institute for Automation of Complex Power Systems, RWTH Aachen University, Aachen, Germany
Cited by 5 stored of 5
5 results
No patents citing this paper on Lens.org (checked 2026-10-06).
References 23
-
W2294416312details pending0citations
-
W2099517607details pending0citations
-
W1542343170details pending0citations
-
W1989949508details pending0citations
-
W2072642243details pending0citations
-
W2075200682details pending0citations
-
W2079876304details pending0citations
-
W2086664392details pending0citations
-
W2119334569details pending0citations
-
W2133919892details pending0citations
-
W2134869843details pending0citations
-
W2149185571details pending0citations
-
W2407400284details pending0citations
-
W2477654779details pending0citations
-
W2616333561details pending0citations
-
W2755475186details pending0citations
-
W2808242085details pending0citations
-
W2922251527details pending0citations
-
W2982338210details pending0citations