The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Distributed consensus of multi-agent systems with general linear node dynamics and intermittent communications: CONSENSUS OF LINEAR MULTI-AGENT SYSTEMS
Abstract
Without assuming that the mobile agents can communicate with their neighbors all the time, the consensus problem of multi-agent systems with general linear node dynamics and a fixed directed topology is investigated. To achieve consensus, a new class of distributed protocols designed based only on the intermittent relative information are presented. By using tools from matrix analysis and switching systems theory, it is theoretically shown that the consensus in multi-agent systems with a periodic intermittent communication and directed topology containing a spanning tree can be cast into the stability of a set of low-dimensional switching systems. It is proved that there exists a protocol guaranteeing consensus if each agent is stabilizable and the communication rate is larger than a threshold value. Furthermore, a multi-step intermittent consensus protocol design procedure is provided. The consensus algorithm is then extended to solve the formation control problem of linear multi-agent systems with intermittent communication constraints as well as the consensus tracking problem with switching directed topologies. Finally, some numerical simulations are provided to verify the effectiveness of the theoretical results. Copyright © 2013 John Wiley & Sons, Ltd.
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
Consensus 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 · cited 1×
“This partly because of its wide applications in design of distributed sensor networks, formation of unmanned air vehicles and scheduling of automated highway systems, to name just a few [1, 2].”
BackgroundCoordination 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
Decentralized event-triggered consensus with general linear dynamics
Garcia, E., Cao, Y., & Casbeer, D. W. (2014) · Automatica · doi:10.1016/j.automatica.2014.08.024 · Cited by 347
McCord, C., Queralta, J. P., Gia, T. N., & Westerlund, T. (2019) · 2019 European Conference on Mobile Robots (ECMR) · doi:10.1109/ecmr.2019.8870934 · Cited by 23
Metadata
- Authors
- Wen, G., Duan, Z., Ren, W., & Chen, G.
- Venue
- International Journal of Robust and Nonlinear Control
- Publisher
- Wiley
- Published
- 2013-05-03
- Volume
- 24
- Issue
- 16
- Pages
- 2438-2457
- ISSN
- 1049-8923 (ISSN-L)
- OpenAlex
- W1938894423
- Cited by
- 261
- References
- 3
- FWCI
- 32.60
- 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: Distributed consensus of multi-agent systems with general linear node dynamics and intermittent communications: CONSENSUS OF LINEAR MULTI-AGENT SYSTEMS. https://app.cochat.ai/papers/10.1002/rnc.3001
- The paper
- Wen, G., Duan, Z., Ren, W., & Chen, G. (2014). Distributed consensus of multi-agent systems with general linear node dynamics and intermittent communications: CONSENSUS OF LINEAR MULTI-AGENT SYSTEMS. International Journal of Robust and Nonlinear Control. https://doi.org/10.1002/rnc.3001
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.
