Journal
IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 32, Issue 1, Pages 531-543Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2016.2542678
Keywords
Power flow routers; optimal power flow; convex relaxation; semidefinite programming
Categories
Funding
- Theme-based Research Scheme of the Research Grants Council of Hong Kong [T23-701/14-N]
- University of Hong Kong [201601159009]
Ask authors/readers for more resources
Power flow routing is an emerging control paradigm for the dynamic control of electric power flows. In this paper, we propose a generic model of a power flow router (PFR) and incorporate it into the optimal power flow (OPF) problem. First, a generic PFR architecture is proposed to encapsulate the desired functions of PFRs. Then, the load flow model of PFRs is developed and incorporated into the OPF framework. To pursue global optimality of the non-convex PFR-incorporated OPF (PFR-OPF) problem, we develop a semidefinite programming (SDP) relaxation of PFR-OPF. By introducing the regularization terms that favor a low-rank solution and tuning the penalty coefficients, a rank-1 solution can be obtained and used for recovering an optimal or near-optimal solution of the PFR-OPF and the results are verified in numerical tests. The efficacy of the PFR-OPF framework allows us to investigate the impact of PFR integration. With the system loadability as an example, the numerical results show that remarkable enhancement can be achieved by installing PFRs at certain critical buses of the network.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available