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

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

Multi-Agent Consensus With Relative-State-Dependent Measurement Noises

Open access
Li, Tao, Wu, Fuke, Zhang, Ji-Feng · 2014 · IEEE Transactions on Automatic Control

Abstract

In this note, the distributed consensus corrupted by relative-state-dependent measurement noises is considered. Each agent can measure or receive its neighbors' state information with random noises, whose intensity is a vector function of agents' relative states. By investigating the structure of this interaction and the tools of stochastic differential equations, we develop several small consensus gain theorems to give sufficient conditions in terms of the control gain, the number of agents and the noise intensity function to ensure mean square (m.s.) and almost sure (a.s.) consensus and quantify the convergence rate and the steady-state error. Especially, for the case with homogeneous communication and control channels, a necessary and sufficient condition to ensure m.s. consensus on the control gain is given and it is shown that the control gain is independent of the specific network topology, but only depends on the number of nodes and the noise coefficient constant. For symmetric measurement models, the almost sure convergence rate is estimated by the Iterated Logarithm Law of Brownian motions.

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.2014.2304368

Cites

2 of 2 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 2 references

Cited by

See all 226

Metadata

Authors
Li, T., Wu, F., & Zhang, J.-F.
Venue
IEEE Transactions on Automatic Control
Published
2014-09
Volume
59
Issue
9
Pages
2463-2468
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
OpenAlex
W1975387445
Cited by
226
References
2
FWCI
20.03
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 Consensus With Relative-State-Dependent Measurement Noises. https://app.cochat.ai/papers/10.1109/tac.2014.2304368
The paper
Li, T., Wu, F., & Zhang, J.-F. (2014). Multi-Agent Consensus With Relative-State-Dependent Measurement Noises. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2014.2304368

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.