The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Motion Coordination with Distributed Information
Abstract
Motion coordination is a remarkable phenomenon in biological systems and an extremely useful tool for groups of vehicles, mobile sensors, and embedded robotic systems. For many applications, teams of mobile autonomous agents need the ability to deploy over a region, assume a specified pattern, rendezvous at a common point, or move in a synchronized manner. The objective of this article is to illustrate the use of systems theory to analyze emergent behaviors in animal groups and to design autonomous and reliable robotic networks. We present and survey some recently developed theoretical tools for modeling, analysis, and design of motion coordination algorithms in both continuous and discrete time. We pay special attention to the distributed character of coordination algorithms, the characterization of their performance, and the development of design methodologies that provide mobile networks with provably correct cooperative strategies.
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
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
Harary, F. (1969) · Cited by 10,739
Optimization and Nonsmooth Analysis
Clarke, F. H. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971309 · Cited by 10,264
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
Bhatia, R., Bredon, G. E., Walter, W. L., Rotman, J. J., Murty, M. R., Gilman, J., Walters, P., Golubitsky, M., Karatzas, I., Cohen, H., et al. (1977) · Cited by 8,252
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Miller, M. B., & Bassler, B. L. (2001) · Annual Review of Microbiology · doi:10.1146/annurev.micro.55.1.165 · Cited by 5,105
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
Differential equations with discontinuous right hand sides
(1989) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(89)90171-7 · Cited by 4,893
Cited by
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Finite-time formation control for multi-agent systems
Xiao, F., Wang, L., Chen, J., & Gao, Y. (2009) · Automatica · doi:10.1016/j.automatica.2009.07.012 · Cited by 934
A network diffusion model of disease progression in dementia
Raj, A., Kuceyeski, A., & Weiner, M. (2012) · Neuron · doi:10.1016/j.neuron.2011.12.040 · Cited by 723
Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
Bamieh, B., Jovanovic, M. R., Mitra, P., & Patterson, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2202052 · Cited by 372
Reaching an Optimal Consensus: Dynamical Systems That Compute Intersections of Convex Sets
Shi, G., Johansson, K. H., & Hong, Y. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2215261 · Cited by 288
Finite-time distributed consensus via binary control protocols
Chen, G., Lewis, F. L., & Xie, L. (2011) · Automatica · doi:10.1016/j.automatica.2011.05.013 · Cited by 271
Abdelnour, F., Voss, H. U., & Raj, A. (2014) · NeuroImage · doi:10.1016/j.neuroimage.2013.12.039 · Cited by 270
Cooperative Control Design for Time-Varying Formations of Multi-Agent Systems
Brinon-Arranz, L., Seuret, A., & Canudas-de-Wit, C. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2303213 · Cited by 262
Metadata
- Venue
- IEEE Control Systems
- Published
- 2007-08
- Volume
- 27
- Issue
- 4
- Pages
- 75-88
- ISSN
- 1066-033X (ISSN-L)
- 1941-000X
- OpenAlex
- W2039245308
- Cited by
- 526
- References
- 57
- FWCI
- 48.33
- 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.