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

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

Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach

Yongcan Cao, Wei Ren·2012·IEEE Transactions on Automatic Control

Abstract

A distributed coordinated tracking problem is solved via a variable structure approach when there exists a dynamic virtual leader who is a neighbor of only a subset of a group of followers, all followers have only local interaction, and only partial measurements of the states of the virtual leader and the followers are available. In the context of coordinated tracking, we focus on both consensus tracking and swarm tracking algorithms. In the case of first-order kinematics, we propose a distributed consensus tracking algorithm without velocity measurements under both fixed and switching network topologies. In particular, we show that distributed consensus tracking can be achieved in finite time. The algorithm is then extended to achieve distributed swarm tracking without velocity measurements. In the case of second-order dynamics, we first propose two distributed consensus tracking algorithms without acceleration measurements when the velocity of the virtual leader is varying under, respectively, a fixed and switching network topology. In particular, we show that the proposed algorithms guarantee at least global exponential tracking. We then propose a distributed consensus tracking algorithm and a distributed swarm tracking algorithm when the velocity of the virtual leader is constant. When the velocity of the virtual leader is varying, distributed swarm tracking is solved by using a distributed estimator. For distributed consensus tracking, a mild connectivity requirement is proposed by adopting an adaptive connectivity maintenance mechanism in which the adjacency matrix is defined in a proper way. Similarly, a mild connectivity requirement is proposed for distributed swarm tracking by adopting a connectivity maintenance mechanism in which the potential function is defined in a proper way. Several simulation examples are presented as a proof of concept.

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.2011.2146830

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 568

Metadata

Authors
Cao, Y., & Ren, W.
Venue
IEEE Transactions on Automatic Control
Published
2012-01
Volume
57
Issue
1
Pages
33-48
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W1973963158
Cited by
568
References
3
FWCI
64.97
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: Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach. https://app.cochat.ai/papers/10.1109/tac.2011.2146830
The paper
Cao, Y., & Ren, W. (2012). Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2011.2146830

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.