Consensus protocols for networks of dynamic agents
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
In this paper, we introduce linear and nonlinear consensus protocols for networks of dynamic agents that allow the \nagents to agree in a distributed and cooperative fashion. \nWe consider the cases of networks with communication time-delays and channels that have filtering effects. \nWe find a tight upper bound on the maximum fixed time-delay \nthat can be tolerated in the network. It turns out that the \nconnectivity of the network is the key in reaching a \nconsensus. The case of agreement with bounded inputs is \nconsidered by analyzing the convergence of a class of nonlinear protocols. A Lyapunov function is introduced that \nquantifies the total disagreement among the nodes of a \nnetwork. Simulation results are provided for agreement in networks with communication time-delays and constrained inputs.
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37406 · Cited by 7,714
Flocks, herds and schools: A distributed behavioral model
Reynolds, C. W. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37406 · Cited by 5,148
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Self-citation(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
(1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0030669 · Cited by 597
Graph rigidity and distributed formation stabilization of multi-vehicle systems
Olfati-Saber, R., & Murray, R. M. (2003) · Proceedings of the 41st IEEE Conference on Decision and Control, 2002. · doi:10.1109/cdc.2002.1184307 · Cited by 368
Self-citationINFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS
Fax, J. A., & Murray, R. M. (2002) · IFAC Proceedings Volumes · doi:10.3182/20020721-6-es-1901.00100 · Cited by 195
Self-citationA Distributed Behavioral Model
Reynolds, C. W., & Bennett, E. L. (1987) · ACM SIGGRAPH Computer Graphics · Cited by 63
Research works printed but not linked: 2
- [6] R. Olfati Saber and Murray R. M. Consensus protocols for undirected networks of dynamic agents with communication time-delays. Technical Report CIT-CDS 03-007, California Institute of Technology, Control and Dynamical Systems, Pasadena, California, March 2003. -
- [4] N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1997. -
Cited by
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
Self-citationConsensus 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
Self-citationConsensus 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
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
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
Metadata
- Authors
- Saber, R. O., & Murray, R. M.
- Affiliations
- California Institute of Technology (US)
- ORCID
- Murray, R.M.
- Venue
- Proceedings of the 2003 American Control Conference, 2003.
- Publisher
- IEEE
- Published
- 2004-06-22
- Volume
- 2
- Pages
- 951-956
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W1864806140
- Cited by
- 901
- References
- 11
- Citations by year
- 2026: 8 · 2025: 22 · 2024: 19 · 2023: 23 · 2022: 34 · 2021: 43 · 2020: 59 · 2019: 50 · 2018: 45 · 2017: 60 · 2016: 63 · 2015: 44 · 2014: 50 · 2013: 61 · 2012: 59
- FWCI
- 16.30
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Proceedings of the ... American Control Conference/Proceedings of the American Control Conference (publishedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion)
- Topics
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Physical Sciences › Engineering › Control and Systems Engineering › Neural Networks Stability and Synchronization
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Keywords
- consensus algorithms, multi-agent systems, dynamic agents, communication delay, network connectivity, bounded inputs, Lyapunov function, distributed collaboration
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.