The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Decentralized time-varying formation control for multi-robot systems
Abstract
In this paper, a distributed controller–observer schema for tracking control of the centroid and of the relative formation of a multi-robot system with first-order dynamics is presented. Each robot of the team uses a distributed observer to estimate the overall system state and a motion control strategy for tracking control of time-varying centroid and formation. Proof of the overall convergence of the controller–observer schema for different kinds of connection topologies, as well as for the cases of unsaturated and saturated control inputs is presented. In particular, the solution is proven to work in the case of strongly connected non-switching topologies and in the case of balanced strongly connected switching topologies. In order to complete the work, the approach is validated by experimental tests with a team of five wheeled mobile robots.
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 · cited 3×
“In fact, for the case of balanced directed topologies, LS = ( L+L ) /2 is the Laplacian of the mirror (undirected) graph associated to the given directed graph with Laplacian L [38].”
BackgroundConsensus 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 2×
“Recent studies are summarized in Mesbahi and Egerstedt (2010) and Ren and Beard (2008), while in Olfati-Saber et al. (2007) and Ren et al. (2007) the consensus algorithms are investigated with an emphasis on robustness, time-delays, and performance bounds.”
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
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×
“Recent studies are summarized in Mesbahi and Egerstedt (2010) and Ren and Beard (2008), while in Olfati-Saber et al. (2007) and Ren et al. (2007) the consensus algorithms are investigated with an emphasis on robustness, time-delays, and performance bounds.”
BackgroundDistributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
Cited by
Dong, X., & Hu, G. (2016) · Automatica · doi:10.1016/j.automatica.2016.06.024 · Cited by 510
Metadata
- Authors
- Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2014-05-01
- Volume
- 33
- Issue
- 7
- Pages
- 1029-1043
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1982425003
- Cited by
- 159
- References
- 5
- FWCI
- 16.95
- 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: Decentralized time-varying formation control for multi-robot systems. https://app.cochat.ai/papers/10.1177/0278364913519149
- The paper
- Antonelli, G., Arrichiello, F., Caccavale, F., & Marino, A. (2014). Decentralized time-varying formation control for multi-robot systems. The International Journal of Robotics Research. https://doi.org/10.1177/0278364913519149
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.