The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems
Abstract
This technical note proposes a general class of distributed potential-based control laws with the connectivity preserving property for single-integrator agents. The potential functions are designed in such a way that when an edge in the information flow graph is about to lose connectivity, the gradient of the potential function lies in the direction of that edge, aiming to shrink it. The results are developed for a static information flow graph first, and then are extended to the case of dynamic edge addition. Connectivity preservation for problems involving static leaders is covered as well. The potential functions are chosen to be smooth, resulting in bounded control inputs. Other constraints may also be imposed on the potential functions to satisfy various design criteria such as consensus, containment, and formation convergence. The effectiveness of the proposed control strategy is illustrated by simulation for examples of consensus and containment.
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 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 · cited 1×
“Examples of such an objective include flocking, consensus, containment, and formation [2], [6]–[9].”
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
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
Graph-theoretic connectivity control of mobile robot networks
Zavlanos, M. M., Egerstedt, M. B., & Pappas, G. J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2011.2157884 · Cited by 405
Survey on Unmanned Aerial Vehicle Networks: A Cyber Physical System Perspective
Wang, H., Zhao, H., Zhang, J., Ma, D., Li, J., & Wei, J. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2962207 · Cited by 264
Metadata
- Authors
- Ajorlou, A., Momeni, A., & Aghdam, A. G.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2010-12
- Volume
- 55
- Issue
- 12
- Pages
- 2828-2833
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2107723135
- Cited by
- 204
- References
- 2
- FWCI
- 25.80
- 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: A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems. https://app.cochat.ai/papers/10.1109/tac.2010.2072570
- The paper
- Ajorlou, A., Momeni, A., & Aghdam, A. G. (2010). A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2072570
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.