The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Stable Multi-Agent-Based Load Shedding Algorithm for Power Systems
Abstract
If generation in a power system is insufficient to power all loads, efficient load shedding operations may need to be deployed to maintain the supply-demand balance. This paper proposes a distributed multi-agent-based load shedding algorithm, which can make efficient load shedding decision based on discovered global information. During the information discovery process, only communications between immediate neighboring agents are used. The information discovery algorithm is represented as a discrete time linear system and the stability of which is analyzed according to average-consensus theorem. According to rigorous stability analysis, convergence of the designed algorithm can be guaranteed. To improve the speed of the algorithm, particle swarm optimization (PSO) is used to optimize the coefficients for information exchange so that the second largest eigenvalue of the iteration matrix is minimized. According to the designed algorithm, total net active power and operating status of loads can be discovered accurately even with faults. Based on the discovered information, coordinated load shedding decision can be made.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 1×
“of solvability of consensus problem and consensus protocol were first introduced in [15].”
Background
Cited by
Optimal Power Dispatch of Multi-Microgrids at Future Smart Distribution Grids
Nikmehr, N., & Najafi Ravadanegh, S. (2015) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2396992 · Cited by 377
Zhang, H., Kim, S., Sun, Q., & Zhou, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2015.2506760 · Cited by 315
Rahbari-Asr, N., Ojha, U., Zhang, Z., & Chow, M.-Y. (2014) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2014.2346511 · Cited by 309
Liu, W., Gu, W., Sheng, W., Meng, X., Wu, Z., & Chen, W. (2014) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2013.2293148 · Cited by 274
Self-citation
Metadata
- Authors
- Xu, Y., Liu, W., & Gong, J.
- Venue
- IEEE Transactions on Power Systems
- Published
- 2011-11
- Volume
- 26
- Issue
- 4
- Pages
- 2006-2014
- ISSN
- 0885-8950 (ISSN-L)
- 1558-0679
- OpenAlex
- W2144689554
- Cited by
- 193
- References
- 1
- FWCI
- 7.13
- 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
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.