File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TPWRS.2016.2542678
- Scopus: eid_2-s2.0-84961783284
- WOS: WOS:000391741100049
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Optimal Power Flow with Power Flow Routers
Title | Optimal Power Flow with Power Flow Routers |
---|---|
Authors | |
Keywords | convex relaxation optimal power flow Power flow routers semidefinite programming |
Issue Date | 2017 |
Publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=59 |
Citation | IEEE Transactions on Power Systems, 2017, v. 32 n. 1, p. 531-543 How to Cite? |
Abstract | 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. |
Persistent Identifier | http://hdl.handle.net/10722/227297 |
ISSN | 2023 Impact Factor: 6.5 2023 SCImago Journal Rankings: 3.827 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, J | - |
dc.contributor.author | Li, VOK | - |
dc.contributor.author | Leung, KC | - |
dc.contributor.author | Lam, AYS | - |
dc.date.accessioned | 2016-07-18T09:09:38Z | - |
dc.date.available | 2016-07-18T09:09:38Z | - |
dc.date.issued | 2017 | - |
dc.identifier.citation | IEEE Transactions on Power Systems, 2017, v. 32 n. 1, p. 531-543 | - |
dc.identifier.issn | 0885-8950 | - |
dc.identifier.uri | http://hdl.handle.net/10722/227297 | - |
dc.description.abstract | 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. | - |
dc.language | eng | - |
dc.publisher | Institute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=59 | - |
dc.relation.ispartof | IEEE Transactions on Power Systems | - |
dc.rights | ©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | convex relaxation | - |
dc.subject | optimal power flow | - |
dc.subject | Power flow routers | - |
dc.subject | semidefinite programming | - |
dc.title | Optimal Power Flow with Power Flow Routers | - |
dc.type | Article | - |
dc.identifier.email | Li, VOK: vli@eee.hku.hk | - |
dc.identifier.email | Leung, KC: kcleung@eee.hku.hk | - |
dc.identifier.email | Lam, AYS: ayslam@eee.hku.hk | - |
dc.identifier.authority | Li, VOK=rp00150 | - |
dc.identifier.authority | Leung, KC=rp00147 | - |
dc.identifier.authority | Lam, AYS=rp02083 | - |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1109/TPWRS.2016.2542678 | - |
dc.identifier.scopus | eid_2-s2.0-84961783284 | - |
dc.identifier.hkuros | 259717 | - |
dc.identifier.isi | WOS:000391741100049 | - |
dc.publisher.place | United States | - |
dc.identifier.issnl | 0885-8950 | - |