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

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

Ajorlou, Amir, Momeni, Ahmadreza, Aghdam, Amir G.·2010·IEEE Transactions on Automatic Control

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.

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

Integrity signals

Registry

Crossref · 10.1109/tac.2010.2072570

Cites

2 of 2 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 2 references

Cited by

See all 204

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.