The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Necessary and Sufficient Graphical Conditions for Affine Formation Control
Abstract
This paper introduces a new multi-agent control problem, called an affine formation control problem, with the objective of asymptotically reaching a configuration that preserves collinearity and ratios of distances with respect to a target configuration. Suppose each agent updates its own state using a weighted sum of its neighbor's relative states with possibly negative weights. Then the affine control problem can be solved for either undirected or directed interaction graphs. It is shown in this paper that an affine formation is stabilizable over an undirected graph if and only if the undirected graph is universally rigid, while an affine formation is stabilizable over a directed graph in the d-dimensional space if and only if the directed graph is (d + 1)-rooted. Rigorous analysis is provided, mainly relying on Laplacian associated with the interaction graph, which contain both positive and negative weights.
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
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Sastry, S. (1999) · Interdisciplinary Applied Mathematics · doi:10.1007/978-1-4757-3108-8 · Cited by 1,764
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
Local Control Strategies for Groups of Mobile Autonomous Agents
Lin, Z., Broucke, M., & Francis, B. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.825639 · Cited by 850
Self-citationContainment Control in Mobile Networks
Ji, M., Ferrari-Trecate, G., Egerstedt, M., & Buffa, A. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.930098 · Cited by 810
An Interior-Point Method for Semidefinite Programming
Helmberg, C., Rendl, F., Vanderbei, R. J., & Wolkowicz, H. (1996) · SIAM Journal on Optimization · doi:10.1137/0806020 · Cited by 706
Rigid graph control architectures for autonomous formations
(2008) · IEEE Control Systems · doi:10.1109/mcs.2008.929280 · Cited by 636
Cao, Y., Stuart, D., Ren, W., & Meng, Z. (2011) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2010.2053542 · Cited by 567
Asimow, L., & Roth, B. (1978) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1978-0511410-9 · Cited by 493
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
Self-citationQin, J., & Yu, C. (2013) · Automatica · doi:10.1016/j.automatica.2013.06.017 · Cited by 393
Cluster Synchronization in Directed Networks Via Intermittent Pinning Control
Liu, X., & Chen, T. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2139224 · Cited by 318
Clustering in diffusively coupled networks
Xia, W., & Cao, M. (2011) · Automatica · doi:10.1016/j.automatica.2011.08.043 · Cited by 256
Target containment control of multi-agent systems with random switching interconnection topologies
Lou, Y., & Hong, Y. (2012) · Automatica · doi:10.1016/j.automatica.2012.02.032 · Cited by 230
Characterizing generic global rigidity
Gortler, S. J., Healy, A., & Thurston, D. P. (2010) · American Journal of Mathematics · doi:10.1353/ajm.0.0132 · Cited by 222
A Barycentric Coordinate Based Distributed Localization Algorithm for Sensor Networks
Diao, Y., Lin, Z., & Fu, M. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2339797 · Cited by 121
Self-citationMutual Synchronization of Multiple Robot Manipulators with Unknown Dynamics
Cui, R., & Yan, W. (2012) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-012-9674-9 · Cited by 70
Distributed formation control with permutation symmetries
Zavlanos, M. M., & Pappas, G. J. (2007) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2007.4434527 · Cited by 48
Metadata
- Authors
- Lin, Z., Wang, L., Chen, Z., Fu, M., & Han, Z.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2016-10
- Volume
- 61
- Issue
- 10
- Pages
- 2877-2891
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2343580824
- Cited by
- 262
- References
- 21
- FWCI
- 14.58
- 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.