Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 210

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Flocking while preserving network connectivity

Zavlanos, Michael M., Jadbabaie, Ali, Pappas, George J.·2007·2007 46th IEEE Conference on Decision and Control

Abstract

Coordinated motion of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as consensus seeking or flocking by a group of mobile agents, a great new challenge is the development of robust distributed motion algorithms that can always achieve the desired coordination. In this paper, we address this challenge by embedding the requirement for connectivity of the underlying communication network in the controller specifications. We employ double integrator models for the agents and design nearest neighbor control laws, based on potential fields, that serve a twofold objective. First, they contribute to velocity alignment in the system and second, they regulate switching among different network topologies so that the connectivity requirement is always met. Collision avoidance among neighboring agents is also ensured and under the assumption that the initial network is connected, the overall system is shown to asymptotically flock for all initial conditions. In particular, it is shown that flocking is achieved even in sparse communication networks where connectivity is more prone to failure. We conclude by illustrating a class of interesting problems that can be achieved while preserving connectivity.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/cdc.2007.4434530

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 210

Metadata

Authors
Zavlanos, M. M., Jadbabaie, A., & Pappas, G. J.
Venue
2007 46th IEEE Conference on Decision and Control
Publisher
IEEE
Published
2007
Pages
2919-2924
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2149913175
Cited by
210
References
3
FWCI
7.89
Type
conference paper
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 while preserving network connectivity. https://app.cochat.ai/papers/10.1109/cdc.2007.4434530
The paper
Zavlanos, M. M., Jadbabaie, A., & Pappas, G. J. (2007). Flocking while preserving network connectivity. 2007 46th IEEE Conference on Decision and Control. https://doi.org/10.1109/cdc.2007.4434530

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.