The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Multi-Agent Coordination by Decentralized Estimation and Control
Open accessAbstract
We describe a framework for the design of collective behaviors for groups of identical mobile agents. The approach is based on decentralized simultaneous estimation and control, where each agent communicates with neighbors and estimates the global performance properties of the swarm needed to make a local control decision. Challenges of the approach include designing a control law with desired convergence properties, assuming each agent has perfect global knowledge; designing an estimator that allows each agent to make correct estimates of the global properties needed to implement the controller; and possibly modifying the controller to recover desired convergence properties when using the estimates of global performance. We apply this framework to the problem of controlling the moment statistics describing the location and shape of a swarm. We derive conditions which guarantee that the formation statistics are driven to desired values, even in the presence of a changing network topology.
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
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
Bochnak, J., Coste, M., & Roy, M.-F. (1998) · Springer · doi:10.1007/978-3-662-03718-8 · Cited by 1,538
Semianalytic and subanalytic sets
Bierstone, E., & Milman, P. D. (1988) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699126 · Cited by 671
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
You, K., & Xie, L. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2164017 · Cited by 622
Discrete-time dynamic average consensus
Zhu, M., & Martínez, S. (2010) · Automatica · doi:10.1016/j.automatica.2009.10.021 · Cited by 488
Cao, Y., Ren, W., & Meng, Z. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.06.002 · Cited by 405
Consensus of Hybrid Multi-Agent Systems
Zheng, Y., Ma, J., & Wang, L. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2651402 · Cited by 391
Metadata
- Authors
- Yang, P., Freeman, R. A., & Lynch, K. M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2008-12
- Volume
- 53
- Issue
- 11
- Pages
- 2480-2496
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2096108718
- Cited by
- 330
- References
- 4
- FWCI
- 41.15
- Type
- journal article
- Language
- en
- Open access
- green
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: Multi-Agent Coordination by Decentralized Estimation and Control. https://app.cochat.ai/papers/10.1109/tac.2008.2006925
- The paper
- Yang, P., Freeman, R. A., & Lynch, K. M. (2008). Multi-Agent Coordination by Decentralized Estimation and Control. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2008.2006925
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.