CoChat

Consensus protocols for networks of dynamic agents

Saber, R.O., Murray, R.M. · 2004 · Proceedings of the 2003 American Control Conference, 2003.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/acc.2003.1239709

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 2

  1. [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. -
  2. [4] N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., 1997. -

Cited by

See all 901

Metadata

Authors
Saber, R. O., & Murray, R. M.
Affiliations
California Institute of Technology (US)
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.