The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finite-Time Consensus Problems for Networks of Dynamic Agents
Open accessAbstract
In this note, we discuss finite-time state consensus problems for multi-agent systems and present one framework for constructing effective distributed protocols, which are continuous state feedbacks. By employing the theory of finite-time stability, we investigate both the bidirectional interaction case and the unidirectional interaction case, and prove that if the sum of time intervals, in which the interaction topology is connected, is sufficiently large, the proposed protocols will solve the finite-time consensus problems.
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
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
A class of predefined-time stable dynamical systems
Sánchez-Torres, J. D., Gómez-Gutiérrez, D., López, E., & Loukianov, A. G. (2018) · IMA Journal of Mathematical Control and Information · doi:10.1093/imamci/dnx004 · Cited by 570
Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
Chen, F., Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199176 · Cited by 320
Song, Q., Liu, F., Cao, J., & Yu, W. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2227723 · Cited by 262
Evolution of cooperation in a hierarchical society with corruption control
Huang, F., Chen, X., & Wang, L. (2018) · Journal of Theoretical Biology · doi:10.1016/j.jtbi.2018.04.018 · Cited by 28
Self-citation
Metadata
- Authors
- Wang, L., & Xiao, F.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2010-04
- Volume
- 55
- Issue
- 4
- Pages
- 950-955
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2172143163
- Cited by
- 1,170
- References
- 2
- FWCI
- 63.61
- Type
- journal article
- Language
- en
- Open access
- green
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: Finite-Time Consensus Problems for Networks of Dynamic Agents. https://app.cochat.ai/papers/10.1109/tac.2010.2041610
- The paper
- Wang, L., & Xiao, F. (2010). Finite-Time Consensus Problems for Networks of Dynamic Agents. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2041610
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.
