The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Fixed-Time-Synchronized Consensus Control of Multiagent Systems
Abstract
In this article, a unique multiagent control problem is defined-all the elements of all the agent states reaching consensus at the same time, i.e., the multiagent system achieves time-synchronized consensus and fixed-time-synchronized consensus, where the upper bound of the synchronized settling time is independent of the initial states of multiagent systems. To articulate this (fixed-) time-synchronized consensus problem, we first propose time-synchronized stability and fixed-time-synchronized stability, a special kind of fixed/finite-time stability, where all the elements of the system state synchronously arrive at the equilibrium at the same time, with the upper bound of the synchronized settling time dependent/independent of initial conditions. Based on fixed-time-synchronized stability, a singularity-free sliding mode control law is designed to solve the fixed-time-synchronized consensus problem. Finally, numerical simulations are conducted to showcase the effectiveness, and further exploration of the merit of the proposed controller is provided.
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
Coordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
Cited by
An Overview of Finite/Fixed-Time Control and Its Application in Engineering Systems
Liu, Y., Li, H., Lu, R., Zuo, Z., & Li, X. (2022) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2022.105413 · Cited by 512
Deepfake detection using deep learning methods: A systematic and comprehensive review
Heidari, A., Jafari Navimipour, N., Dag, H., & Unal, M. (2024) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1520 · Cited by 349
Metadata
- Authors
- Li, D., Ge, S. S., & Lee, T. H.
- Venue
- IEEE Transactions on Control of Network Systems
- Published
- 2021-03
- Volume
- 8
- Issue
- 1
- Pages
- 89-98
- ISSN
- 2325-5870 (ISSN-L)
- 2372-2533
- OpenAlex
- W3094869672
- Cited by
- 196
- References
- 2
- FWCI
- 12.61
- 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.