.png){kind=icon}
.png){kind=icon}
Return
Optimization Dynamics: A Bus-Level Distributed Approach for Optimal Power Flows
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2018.2864140.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a continuous-time optimization dynamics approach in this paper to solve the nonconvex optimal power flow (OPF) problem. The proposed approach naturally uses the distributed power flow structure for computation. Specifically, each bus in the power network plays as an individual computing agent, which only uses local information to update its own voltage variables as well as Lagrange multipliers. Therefore, the proposed approach is completely distributed at the bus level. Under mild conditions, we first prove the local existence of a unique, continuous solution (with respect to the initial condition) to our optimization dynamics. Next, we show that every trajectory starting from a local neighborhood converges to a pair of primal and dual optima (saddle point) for the associated OPF problem. Simulations based on the IEEE benchmark systems are provided to verify the effectiveness of the proposed approach.
Keywords:
Bus-level distributed computation
continuous-time optimization dynamics
non-convex optimization
optimal power flow (OPF)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K