The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Consensus Tracking Under Directed Interaction Topologies: Algorithms and Experiments
Abstract
Consensus tracking problems with, respectively, bounded control effort and directed switching interaction topologies are considered when a time-varying consensus reference state is available to only a subgroup of a team and the team members have only local interaction. A consensus tracking algorithm explicitly accounting for bounded control effort is proposed and analyzed under a directed fixed interaction topology. Furthermore, convergence analysis for a consensus tracking algorithm is provided when the time-varying consensus reference state is available to a dynamically changing subgroup of the team under directed switching inter-vehicle interaction topologies. Experimental results of a formation control application are demonstrated on a multi-robot platform to validate one of the proposed consensus tracking algorithms.
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
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×
“The goal is to design a distributed update law so that the information states of all of the vehicles in the network converge to a common value (see [1], [2], and references therein).”
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
On the spectra of nonsymmetric Laplacian matrices
Agaev, R., & Chebotarev, P. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.09.003 · Cited by 177
Cited by
Distributed Coordinated Tracking With a Dynamic Leader for Multiple Euler-Lagrange Systems
Mei, J., Ren, W., & Ma, G. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2109437 · Cited by 473
Self-citationRobust consensus tracking of a class of second-order multi-agent dynamic systems
Hu, G. (2012) · Systems & Control Letters · doi:10.1016/j.sysconle.2011.10.004 · Cited by 339
Metadata
- Authors
- Ren, W.
- Venue
- IEEE Transactions on Control Systems Technology
- Published
- 2010-01
- Volume
- 18
- Issue
- 1
- Pages
- 230-237
- ISSN
- 1063-6536 (ISSN-L)
- 1558-0865
- OpenAlex
- W2029089298
- Cited by
- 237
- References
- 4
- FWCI
- 20.91
- 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: Consensus Tracking Under Directed Interaction Topologies: Algorithms and Experiments. https://app.cochat.ai/papers/10.1109/tcst.2009.2015285
- The paper
- Ren, W. (2010). Consensus Tracking Under Directed Interaction Topologies: Algorithms and Experiments. IEEE Transactions on Control Systems Technology. https://doi.org/10.1109/tcst.2009.2015285
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.
