The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays
Abstract
In power system operation, the economic dispatch problem (EDP) aims to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient push-sum method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. This paper shows that the proposed algorithm is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time-varying delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 4×
“⎩ G1 , if t ∈ [0, 1) ∪ [2, 3) · · · ∪ [2s, 2s + 1) · · · G2 , if t ∈ [1, 2) ∪ [3, 4) · · · ∪ [2s + 1, 2s + 2) · · · where s ∈ Z+ , G1 is the graph obtained by disconnecting Zone 1 and Zone 2 in [35, Fig.”
BackgroundInfluentialBertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Power Generation, Operation, and Control
Wood, A. J., & Wollenberg, B. F. (1984) · Cited by 8,303
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Zimmerman, R. D., Murillo-Sanchez, C. E., & Thomas, R. J. (2011) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2010.2051168 · Cited by 6,756
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Parlar, M. (2000) · Interactive Operations Research with Maple · doi:10.1007/978-1-4612-1356-7_5 · Cited by 1,741
Gossip-based computation of aggregate information
Kempe, D., Dobra, A., & Gehrke, J. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238221 · Cited by 1,480
Cited by
A 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
Self-citationA Distributed Economic Dispatch Strategy for Power–Water Networks
Li, P., Hu, J., Qiu, L., Zhao, Y., & Ghosh, B. K. (2022) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2021.3104103 · Cited by 267
Metadata
- Authors
- Yang, T., Lu, J., Wu, D., Wu, J., Shi, G., Meng, Z., & Johansson, K. H.
- Venue
- IEEE Transactions on Industrial Electronics
- Published
- 2017-06
- Volume
- 64
- Issue
- 6
- Pages
- 5095-5106
- ISSN
- 0278-0046 (ISSN-L)
- 1557-9948
- OpenAlex
- W2533385740
- Cited by
- 264
- References
- 35
- FWCI
- 23.69
- Type
- journal article
- Language
- en
- Open access
- closed
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: A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays. https://app.cochat.ai/papers/10.1109/tie.2016.2617832
- The paper
- Yang, T., Lu, J., Wu, D., Wu, J., Shi, G., Meng, Z., & Johansson, K. H. (2017). A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays. IEEE Transactions on Industrial Electronics. https://doi.org/10.1109/tie.2016.2617832
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.
