The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Rigid graph control architectures for autonomous formations
Abstract
This article sets out the rudiments of a theory for analyzing and creating architectures appropriate to the control of formations of autonomous vehicles. The theory rests on ideas of rigid graph theory, some but not all of which are old. The theory, however, has some gaps in it, and their elimination would help in applications. Some of the gaps in the relevant graph theory are as follows. First, there is as yet no analogue for three-dimensional graphs of Laman's theorem, which provides a combinatorial criterion for rigidity in two-dimensional graphs. Second, for three-dimensional graphs there is no analogue of the two-dimensional Henneberg construction for growing or deconstructing minimally rigid graphs although there are conjectures. Third, global rigidity can easily be characterized for two-dimensional graphs, but not for three-dimensional graphs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Coordination 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
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Bollobás, B. (1998) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0619-4 · Cited by 3,772
Modeling and control of formations of nonholonomic mobile robots
Desai, J. P., Ostrowski, J. P., & Kumar, V. (2001) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.976023 · Cited by 1,158
A vision-based formation control framework
Das, A. K., Fierro, R., Kumar, V., Ostrowski, J. P., Spletzer, J., & Taylor, C. J. (2002) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2002.803463 · Cited by 1,146
On graphs and rigidity of plane skeletal structures
Laman, G. (1970) · Journal of Engineering Mathematics · doi:10.1007/bf01534980 · Cited by 1,043
Necessary and sufficient graphical conditions for formation control of unicycles
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841121 · Cited by 1,041
Gazi, V., & Passino, K. M. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.809765 · Cited by 931
Tanner, H. G., Pappas, G. J., & Kumar, V. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.825275 · Cited by 775
DISTRIBUTED COOPERATIVE CONTROL OF MULTIPLE VEHICLE FORMATIONS USING STRUCTURAL POTENTIAL FUNCTIONS
Olfati-Saber, R., & Murray, R. M. (2002) · IFAC Proceedings Volumes · doi:10.3182/20020721-6-es-1901.00244 · Cited by 663
Cited by
A survey of multi-agent formation control
Oh, K.-K., Park, M.-C., & Ahn, H.-S. (2015) · Automatica · doi:10.1016/j.automatica.2014.10.022 · Cited by 2,457
Distributed Formation Control of Multi-Agent Systems Using Complex Laplacian
Lin, Z., Wang, L., Han, Z., & Fu, M. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2309031 · Cited by 476
Bearing Rigidity and Almost Global Bearing-Only Formation Stabilization
Zhao, S., & Zelazo, D. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2459191 · Cited by 463
Robust 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
Necessary and Sufficient Graphical Conditions for Affine Formation Control
Lin, Z., Wang, L., Chen, Z., Fu, M., & Han, Z. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2504265 · Cited by 262
Clustering in diffusively coupled networks
Xia, W., & Cao, M. (2011) · Automatica · doi:10.1016/j.automatica.2011.08.043 · Cited by 256
McCord, C., Queralta, J. P., Gia, T. N., & Westerlund, T. (2019) · 2019 European Conference on Mobile Robots (ECMR) · doi:10.1109/ecmr.2019.8870934 · Cited by 23
Metadata
- Venue
- IEEE Control Systems
- Published
- 2008-12
- Volume
- 28
- Issue
- 6
- Pages
- 48-63
- ISSN
- 1066-033X (ISSN-L)
- 1941-000X
- OpenAlex
- W2130532917
- Cited by
- 636
- References
- 25
- FWCI
- 30.18
- 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
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.