The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Consensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies
Abstract
Distributed consensus tracking is addressed in this paper for multi-agent systems with Lipschitz-type node dynamics. The main contribution of this work is solving the consensus tracking problem without the assumption that the topology among followers is strongly connected and fixed. By using tools from M-matrix theory, a class of consensus tracking protocols based only on the relative states among neighboring agents is designed. By appropriately constructing Lyapunov function, it is proved that consensus tracking in the closed-loop multi-agent systems with a fixed topology having a directed spanning tree can be achieved if the feedback gain matrix and the coupling strength are suitably selected. Furthermore, with the assumption that each possible topology contains a directed spanning tree, it is theoretically shown that consensus tracking under switching directed topologies can be achieved if the control parameters are suitably selected and the dwell time is larger than a positive threshold. The results are then extended to the case where the communication topology contains a directed spanning tree only frequently as the system evolves with time. Finally, some numerical simulations are given to verify the theoretical analysis.
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 1×
“2268091 To date, numerous results have been reported on consensus of multi-agent systems with first-order integrator dynamics under a dynamically changing environment [8], [9].”
BackgroundConsensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522
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
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Cited by
Xu, W., Ho, D. W. C., Li, L., & Cao, J. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2510746 · Cited by 346
Fixed-Time Leader-Following Consensus for Second-Order Multiagent Systems With Input Delay
Ni, J., Liu, L., Liu, C., & Liu, J. (2017) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2017.2701775 · Cited by 328
Metadata
- Authors
- Wen, G., Duan, Z., Chen, G., & Yu, W.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2014-02
- Volume
- 61
- Issue
- 2
- Pages
- 499-511
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2055953081
- Cited by
- 798
- References
- 4
- FWCI
- 98.24
- 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: Consensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies. https://app.cochat.ai/papers/10.1109/tcsi.2013.2268091
- The paper
- Wen, G., Duan, Z., Chen, G., & Yu, W. (2014). Consensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies. IEEE Transactions on Circuits and Systems I: Regular Papers. https://doi.org/10.1109/tcsi.2013.2268091
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.
