期刊
IEEE TRANSACTIONS ON POWER SYSTEMS
卷 32, 期 1, 页码 531-543出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2016.2542678
关键词
Power flow routers; optimal power flow; convex relaxation; semidefinite programming
资金
- Theme-based Research Scheme of the Research Grants Council of Hong Kong [T23-701/14-N]
- University of Hong Kong [201601159009]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据