The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case
Open accessAbstract
The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. Traditionally, OPF is solved in a centralized manner. With increasing penetration of renewable energy in distribution system, we need faster and distributed solutions for real-time feedback control. This is difficult due to the nonlinearity of the power flow equations. In this paper, we propose a solution for balanced radial networks. It exploits recent results that suggest solving for a globally optimal solution of OPF over a radial network through the second-order cone program relaxation. Our distributed algorithm is based on alternating direction method of multiplier (ADMM), but unlike standard ADMM-based distributed OPF algorithms that require solving optimization subproblems using iterative method, our decomposition allows us to derive closed form solutions for these subproblems, greatly speeding up each ADMM iteration. We illustrate the scalability of the proposed algorithm by simulating it on a real-world 2065-bus distribution network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Branch Flow Model: Relaxations and Convexification—Part I
Farivar, M., & Low, S. H. (2013) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2013.2255317 · Cited by 1,541
Self-citationInverter VAR control for distribution systems with renewables
Farivar, M., Clarke, C. R., Low, S. H., & Chandy, K. M. (2011) · 2011 IEEE International Conference on Smart Grid Communications (SmartGridComm) · doi:10.1109/smartgridcomm.2011.6102366 · Cited by 331
Self-citation
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Self-citationA survey of distributed optimization
Yang, T., Yi, X., Wu, J., Yuan, Y., Wu, D., Meng, Z., Hong, Y., Wang, H., Lin, Z., & Johansson, K. H. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.05.006 · Cited by 913
Control Strategies for Microgrids With Distributed Energy Storage Systems: An Overview
Morstyn, T., Hredzak, B., & Agelidis, V. G. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2637958 · Cited by 454
Optimal Distributed Control of Reactive Power Via the Alternating Direction Method of Multipliers
Sulc, P., Backhaus, S., & Chertkov, M. (2014) · IEEE Transactions on Energy Conversion · doi:10.1109/tec.2014.2363196 · Cited by 315
Guerrero, J., Gebbran, D., Mhanna, S., Chapman, A. C., & Verbič, G. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.110000 · Cited by 307
Metadata
- Authors
- Peng, Q., & Low, S. H.
- Venue
- IEEE Transactions on Smart Grid
- Published
- 2018-01
- Volume
- 9
- Issue
- 1
- Pages
- 111-121
- ISSN
- 1949-3053 (ISSN-L)
- 1949-3061
- OpenAlex
- W2479566716
- Cited by
- 206
- References
- 3
- FWCI
- 8.99
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case. https://app.cochat.ai/papers/10.1109/tsg.2016.2546305
- The paper
- Peng, Q., & Low, S. H. (2018). Distributed Optimal Power Flow Algorithm for Radial Networks, I: Balanced Single Phase Case. IEEE Transactions on Smart Grid. https://doi.org/10.1109/tsg.2016.2546305
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.