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

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

Distributed average tracking for multiple signals generated by linear dynamical systems: An edge-based framework

Open access
Zhao, Yu, Liu, Yongfang, Li, Zhongkui, Duan, Zhisheng · 2017 · Automatica

Abstract

This paper studies the distributed average tracking problem for multiple time-varying signals generated by linear dynamics, whose reference inputs are nonzero and not available to any agent in the network. In the edge-based framework, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed. Based on the boundary layer concept, the proposed continuous algorithm with static coupling strengths can asymptotically track the average of multiple reference signals without the chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, average tracking errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of theoretical 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.1016/j.automatica.2016.09.005

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

  • Consensus 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 · cited 1×

    “In the past two decades, there have been lots of interests in the distributed cooperative control [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], and [13], for multi-agent systems due to its potential applications in formation flying, path planning and so forth.”
    Background

Show all 1 references

Cited by

Metadata

Authors
Zhao, Y., Liu, Y., Li, Z., & Duan, Z.
Venue
Automatica
Publisher
Elsevier BV
Published
2017-01
Volume
75
Pages
158-166
ISSN
0005-1098 (ISSN-L)
OpenAlex
W2964110462
Cited by
159
References
1
FWCI
26.21
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

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.