The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Flocking in Fixed and Switching Networks
Abstract
This note analyzes the stability properties of a group of mobile agents that align their velocity vectors, and stabilize their inter-agent distances, using decentralized, nearest-neighbor interaction rules, exchanging information over networks that change arbitrarily (no dwell time between consecutive switches). These changes introduce discontinuities in the agent control laws. To accommodate for arbitrary switching in the topology of the network of agent interactions we employ nonsmooth analysis. The main result is that regardless of switching, convergence to a common velocity vector and stabilization of inter-agent distances is still guaranteed as long as the network remains connected at all times.
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
Self-citationReal-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
Cited by
Event based agreement protocols for multi-agent networks
Meng, X., & Chen, T. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.002 · Cited by 538
Potential Fields for Maintaining Connectivity of Mobile Networks
Zavlanos, M. M., & Pappas, G. J. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.900642 · Cited by 353
Self-citationAbdessameud, A., & Tayebi, A. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.06.019 · Cited by 265
Defend the practicality of single-integrator models in multi-robot coordination control
Zhao, S., & Sun, Z. (2017) · 2017 13th IEEE International Conference on Control & Automation (ICCA) · doi:10.1109/icca.2017.8003139 · Cited by 23
Metadata
- Authors
- Tanner, H. G., Jadbabaie, A., & Pappas, G. J.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2007-05
- Volume
- 52
- Issue
- 5
- Pages
- 863-868
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2128928412
- Cited by
- 1,431
- References
- 3
- FWCI
- 151.22
- 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: Flocking in Fixed and Switching Networks. https://app.cochat.ai/papers/10.1109/tac.2007.895948
- The paper
- Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007). Flocking in Fixed and Switching Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2007.895948
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.
