The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finite-Time Consensus of Switched Multiagent Systems
Abstract
This paper focuses on the finite-time consensus (FTC) problem of switched multiagent system (MAS) which is composed of continuous-time and discrete-time subsystems. Different from the existing results, each agent of this system is controlled by switching control method. To achieve consensus in finite time for the switched MAS, two types of consensus protocols (the FTC protocol and the fixed-time consensus (FdTC) protocol) are proposed. By using algebraic graph theory, Lyapunov theory and matrix theory, it is proved that the FTC problem in strongly connected network and leader-following network can be solved, respectively. When the initial states of agents are not available, the FdTC protocol is applied to solve the FTC problem. Simulations are provided to illustrate the effectiveness of our theoretical results.
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 2×
“For MASs, when switching behaviors occur in the topologies, it can be found that the system matrix changes with topology switches [17], [44].”
BackgroundHorn, R. A., & Johnson, C. R. (2012) · doi:10.1017/cbo9781139020411 · Cited by 4,642
Cited by
Event-Triggered Control for Consensus of Multiagent Systems With Fixed/Switching Topologies
Wu, Z.-G., Xu, Y., Lu, R., Wu, Y., & Huang, T. (2018) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2017.2744671 · Cited by 437
Predefined-Time Consensus Tracking of Second-Order Multiagent Systems
Ni, J., Liu, L., Tang, Y., & Liu, C. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2019.2916257 · Cited by 257
Metadata
- Authors
- Lin, X., & Zheng, Y.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2017-07
- Volume
- 47
- Issue
- 7
- Pages
- 1535-1545
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W2560289364
- Cited by
- 168
- References
- 2
- FWCI
- 25.90
- 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.