Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 185

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays

Liu, Xiwei, Lu, Wenlian, Chen, Tianping · 2010 · IEEE Transactions on Automatic Control

Abstract

In this note, the consensus problem with infinite time-varying delays for linearly coupled static network is investigated. The delay affects only the off-diagonal terms in continuous-time equations. At first, we define an effective consensus ability index. Then, by using the graph theory and a new concept of consensus, we prove that under some mild conditions, the network can realize consensus. An example is given to show the validity of obtained results.

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.

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

Integrity signals

Registry

Crossref · 10.1109/tac.2010.2054770

Cites

1 of 1 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 1 references

Cited by

See all 185

Metadata

Authors
Liu, X., Lu, W., & Chen, T.
Venue
IEEE Transactions on Automatic Control
Published
2010-10
Volume
55
Issue
10
Pages
2396-2401
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W2104299666
Cited by
185
References
1
FWCI
15.57
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays. https://app.cochat.ai/papers/10.1109/tac.2010.2054770
The paper
Liu, X., Lu, W., & Chen, T. (2010). Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2054770

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.