The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements
Open accessAbstract
Most existing flocking algorithms rely on information about both relative position and relative velocity among neighbouring agents. In this article, we investigate the flocking problem with only position measurements. We propose a provably-stable flocking algorithm, in which an output vector is produced by distributed filters based on position information alone but not velocity information. Under the assumption that the initial interactive network is connected, the flocking algorithm not only can steer a group of agents to a stable flocking motion, but also can preserve the connectivity of the interactive network during the dynamical evolution. Moreover, we investigate the flocking algorithm with a virtual leader and show that all agents can asymptotically attain a desired velocity even if only one agent in the team has access to the information of the virtual leader. We finally show some numerical simulations to illustrate the 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
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
Real-Time Obstacle Avoidance for Manipulators and Mobile Robots
Khatib, O. (1986) · The International Journal of Robotics Research · doi:10.1177/027836498600500106 · Cited by 7,894
Effective leadership and decision-making in animal groups on the move
Couzin, I. D., Krause, J., Franks, N. R., & Levin, S. A. (2005) · Nature · doi:10.1038/nature03236 · Cited by 2,753
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Self-citationConsensus Tracking of Multi-Agent Systems With Lipschitz-Type Node Dynamics and Switching Topologies
Wen, G., Duan, Z., Chen, G., & Yu, W. (2014) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2013.2268091 · Cited by 798
Self-citationRendezvous of multiple mobile agents with preserved network connectivity
Su, H., Wang, X., & Chen, G. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.03.006 · Cited by 284
Self-citationYu, W., Chen, G., & Cao, M. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.06.014 · Cited by 284
Self-citation
Metadata
- Authors
- Su, H., Wang, X., & Chen, G.
- Venue
- International Journal of Control
- Publisher
- Informa UK Limited
- Published
- 2009-05-13
- Volume
- 82
- Issue
- 7
- Pages
- 1334-1343
- ISSN
- 0020-7179 (ISSN-L)
- 1366-5820
- OpenAlex
- W1990197468
- Cited by
- 180
- References
- 4
- FWCI
- 22.21
- Type
- journal article
- Language
- en
- Open access
- bronze
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: A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements. https://app.cochat.ai/papers/10.1080/00207170802549578
- The paper
- Su, H., Wang, X., & Chen, G. (2009). A connectivity-preserving flocking algorithm for multi-agent systems based only on position measurements. International Journal of Control. https://doi.org/10.1080/00207170802549578
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.