Sciweavers

Share
JSAC
2016

An Online Gradient Algorithm for Optimal Power Flow on Radial Networks

3 years 6 months ago
An Online Gradient Algorithm for Optimal Power Flow on Radial Networks
—We propose an online algorithm for solving optimal power flow (OPF) problems on radial networks where the controllable devices continuously interact with the network that implicitly computes a power flow solution given a control action. Collectively the controllable devices and the network implement a gradient projection algorithm for the OPF problem in real time. The key design feature that enables this approach is that the intermediate iterates of our algorithm always satisfy power flow equations and operational constraints. We prove that the proposed algorithm converges to the set of local optima and provide sufficient conditions under which it converges to a global optimum. We derive an upper bound on the suboptimality gap of any local optimum. This bound suggests that any local minimum is almost as good as any strictly feasible point. We explain how to greatly reduce the gradient computation in each iteration by using approximate gradient derived from linearized power flow...
Lingwen Gan, Steven H. Low
Added 07 Apr 2016
Updated 07 Apr 2016
Type Journal
Year 2016
Where JSAC
Authors Lingwen Gan, Steven H. Low
Comments (0)
books