The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Distributed consensus of linear multi-agent systems with adaptive dynamic protocols
Open accessAbstract
Abstract This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics for both the cases without and with a leader whose control input might be nonzero and time varying. For the case without a leader, based on the relative output information of neighboring agents, two types of distributed adaptive dynamic consensus protocols are proposed, namely, the edge-based adaptive protocol which assigns a time-varying coupling weight to each edge in the communication graph and the node-based adaptive protocol which uses a time-varying coupling weight for each node. These two adaptive protocols are designed to ensure that consensus is reached in a fully distributed fashion for all undirected connected communication graphs. It is shown that the edge-based adaptive consensus protocol is applicable to arbitrary switching connected graphs. For the case where there exists a leader whose control input is possibly nonzero and bounded, a distributed continuous adaptive protocol is designed to guarantee the ultimate boundedness of the consensus error with respect to any communication graph which contains a directed spanning tree with the leader as the root and whose subgraph associated with the followers is undirected, requiring neither global information of the communication graph nor the upper bound of the leader’s control input. A distributed discontinuous protocol is also discussed as a special case. Simulation examples are finally given to illustrate the 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.
Integrity signals
Registry
Cites
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.
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 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 · cited 3×
“Specifically, a general framework of the consensus problem for networks of integrators with fixed or switching topologies is proposed in [2].”
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×
“Due to its potential applications in broad areas such as spacecraft formation flying and sensor networks, the consensus problem has been extensively studied by numerous researchers from various perspectives; see [1, 2, 3, 4, 5, 6, 7] and references therein.”
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
On the spectra of nonsymmetric Laplacian matrices
Agaev, R., & Chebotarev, P. (2005) · Linear Algebra and its Applications · doi:10.1016/j.laa.2004.09.003 · Cited by 177
Cited by
Consensus of multi-agent systems via fully distributed event-triggered control
Li, X., Tang, Y., & Karimi, H. R. (2020) · Automatica · doi:10.1016/j.automatica.2020.108898 · Cited by 391
Metadata
- Authors
- Li, Z., Ren, W., Liu, X., & Xie, L.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2013-07
- Volume
- 49
- Issue
- 7
- Pages
- 1986-1995
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2038896449
- Cited by
- 672
- References
- 4
- FWCI
- 68.29
- 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.
