The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Flocking of Multi-Agent Non-Holonomic Systems With Proximity Graphs
Open accessAbstract
Multi-agent systems are ubiquitous in the real-world and have received an increasing attention by many researchers worldwide. A multi-agent system is composed of many agents interconnected by a communication network. This paper aims to further investigate the flocking and preserving connectedness in multi-agent nonholonomic systems with proximity graphs, in which the positions and the relative distances are not available to the distributed controllers. Several sufficient conditions are derived to resolve the above problem based on the kinematic model and the dynamic model, respectively. These sufficient conditions indicate that, for any given distinct initial positions and connected initial graph, there always exist gains of the linear protocols to preserve the connectedness of the graph and realize flocking. Moreover, under an additional condition on initial heading angles, the similar result is obtained for a nonlinear protocol with the form of Kuramoto model. Finally, numerical simulations are given to validate the above theoretical results.
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
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
Distributed fixed-time consensus for nonlinear heterogeneous multi-agent systems
Du, H., Wen, G., Wu, D., Cheng, Y., & Lü, J. (2020) · Automatica · doi:10.1016/j.automatica.2019.108797 · Cited by 391
Liu, J., Zhang, Y., Yu, Y., & Sun, C. (2019) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2018.2876334 · Cited by 313
Metadata
- Authors
- Zhu, J., Lu, J., & Yu, X.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2013-01
- Volume
- 60
- Issue
- 1
- Pages
- 199-210
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W1987482599
- Cited by
- 160
- References
- 3
- FWCI
- 22.37
- 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: Flocking of Multi-Agent Non-Holonomic Systems With Proximity Graphs. https://app.cochat.ai/papers/10.1109/tcsi.2012.2215715
- The paper
- Zhu, J., Lu, J., & Yu, X. (2013). Flocking of Multi-Agent Non-Holonomic Systems With Proximity Graphs. IEEE Transactions on Circuits and Systems I: Regular Papers. https://doi.org/10.1109/tcsi.2012.2215715
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.