The DOI matches its Crossref record; 85 of the 85 references it cites were found in a registry or an index.
An Overview of Recent Advances in Fixed-Time Cooperative Control of Multiagent Systems
Abstract
Fixed-time cooperative control is currently a hot research topic in multiagent systems since it can provide a guaranteed settling time, which does not depend on initial conditions. Compared with asymptotic cooperative control algorithms, fixed-time cooperative control algorithms can achieve better closed-loop performance and disturbance rejection properties. Different from finite-time control, fixed-time cooperative control produces the faster rate of convergence and provides an explicit estimation of the settling time independent of initial conditions, which is desirable for multiagent systems. This paper aims at presenting an overview of recent advances in fixed-time cooperative control of multiagent systems. Some fundamental concepts about finite- and fixed-time stability and stabilization are first recalled with insight understanding. Then, recent results in finite- and fixed-time cooperative control are reviewed in detail and categorized according to different agent dynamics. Finally, this paper raises several challenging issues that need to be addressed in the near future.
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 3×
“Especially, in the undirected interaction graph, larger algebraic connectivity of G will result in shorter settling time, which is similar to the linear counterpart of the protocol studied in [8].”
BackgroundResultConsensus 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
Finite-Time Stability of Continuous Autonomous Systems
Bhat, S. P., & Bernstein, D. S. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012997321358 · Cited by 5,510
Nonlinear Feedback Design for Fixed-Time Stabilization of Linear Control Systems
Polyakov, A. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2179869 · Cited by 5,207
Differential equations with discontinuous right hand sides
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90171-7 · Cited by 4,893
Differential Equations with Discontinuous Righthand Sides
Filippov, A. F. (1988) · Mathematics and Its Applications · doi:10.1007/978-94-015-7793-9 · Cited by 4,720
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
Time-varying feedback for regulation of normal-form nonlinear systems in prescribed finite time
Song, Y., Wang, Y., Holloway, J., & Krstic, M. (2017) · Automatica · doi:10.1016/j.automatica.2017.06.008 · Cited by 1,235
An Overview of Recent Advances in Event-Triggered Consensus of Multiagent Systems
Ding, L., Han, Q.-L., Ge, X., & Zhang, X.-M. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2771560 · Cited by 1,182
Self-citationFinite-Time Consensus Problems for Networks of Dynamic Agents
Wang, L., & Xiao, F. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041610 · Cited by 1,170
Metadata
- Authors
- Zuo, Z., Han, Q.-L., Ning, B., Ge, X., & Zhang, X.-M.
- Venue
- IEEE Transactions on Industrial Informatics
- Published
- 2018-06
- Volume
- 14
- Issue
- 6
- Pages
- 2322-2334
- ISSN
- 1551-3203 (ISSN-L)
- 1941-0050
- OpenAlex
- W2794361571
- Cited by
- 658
- References
- 85
- FWCI
- 45.75
- 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: An Overview of Recent Advances in Fixed-Time Cooperative Control of Multiagent Systems. https://app.cochat.ai/papers/10.1109/tii.2018.2817248
- The paper
- Zuo, Z., Han, Q.-L., Ning, B., Ge, X., & Zhang, X.-M. (2018). An Overview of Recent Advances in Fixed-Time Cooperative Control of Multiagent Systems. IEEE Transactions on Industrial Informatics. https://doi.org/10.1109/tii.2018.2817248
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.
