The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Consensus of Multi-Agent Networks With Aperiodic Sampled Communication Via Impulsive Algorithms Using Position-Only Measurements
Abstract
In this technical note, an impulsive consensus algorithm is proposed for second-order continuous-time multi-agent networks with switching topology. The communication among agents occurs at sampling instants based on position only measurements. By using the property of stochastic matrices and algebraic graph theory, some sufficient conditions are obtained to ensure the consensus of the controlled multi-agent network if the communication graph has a spanning tree jointly. A numerical example is given to illustrate the effectiveness of the proposed algorithm.
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×
“Many results have been reported for multi-agent networks with different special features, such as time delay [5], switching topology [6], asynchronous algorithms [4], [7], nonlinear algorithms [8], [9], quantized data [4], noisy communication channel [10], second-order model [11], [12], optimal consensus [13], etc.”
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
Event-based consensus of multi-agent systems with general linear models
Zhu, W., Jiang, Z.-P., & Feng, G. (2014) · Automatica · doi:10.1016/j.automatica.2013.11.023 · Cited by 662
Self-citation
Metadata
- Authors
- Liu, Z.-W., Guan, Z.-H., Shen, X., & Feng, G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-10
- Volume
- 57
- Issue
- 10
- Pages
- 2639-2643
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2000481360
- Cited by
- 234
- References
- 2
- FWCI
- 17.73
- 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 of Multi-Agent Networks With Aperiodic Sampled Communication Via Impulsive Algorithms Using Position-Only Measurements. https://app.cochat.ai/papers/10.1109/tac.2012.2214451
- The paper
- Liu, Z.-W., Guan, Z.-H., Shen, X., & Feng, G. (2012). Consensus of Multi-Agent Networks With Aperiodic Sampled Communication Via Impulsive Algorithms Using Position-Only Measurements. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2012.2214451
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.