Distributed Optimal Power Flow Using Feasible Point Pursuit

Conference · Mon Mar 12 04:00:00 EDT 2018

DOI:https://doi.org/10.1109/CAMSAP.2017.8313064· OSTI ID:1466552

Dall-Anese, Emiliano ^[1]; Zamzam, Ahmed S. ^[2]; Fu, Xiao ^[2]; Sidiropoulos, Nicholas D. ^[2]

---

1. National Renewable Energy Laboratory (NREL), Golden, CO (United States)
2. University of Minnesota

The AC Optimal Power Flow (OPF) is a core optimization task in the domain of power system operations and control. It is known to be nonconvex (and, in fact, NP-hard). In general operational scenarios, identifying feasible (let alone optimal) power-flow solutions remains hard. This paper leverages the recently proposed Feasible Point Pursuit algorithm for solving the OPF problem to devise a fully distributed procedure that can identify AC OPF solutions. The paper considers a multi-area setting and develops an algorithm where all the computations are done locally withing each area, and then the local controllers have to communicate to only their neighbors a small amount of information pertaining to the boundary buses. The merits of the proposed approach are illustrated through an example of a challenging transmission network.

• Research Organization: National Renewable Energy Laboratory (NREL), Golden, CO (United States)
• Sponsoring Organization: USDOE Advanced Research Projects Agency - Energy (ARPA-E)
• DOE Contract Number: AC36-08GO28308
• OSTI ID: 1466552
• Report Number(s): NREL/CP-5D00-68658
• Country of Publication: United States
• Language: English

Related Subjects

24 POWER TRANSMISSION AND DISTRIBUTION
distributed optimization
feasible point pursuit
optimal power flow
successive convex approximation