The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Distributed Coordination of Multi-Agent Systems With Quantized-Observer Based Encoding-Decoding
Abstract
Integrative design of communication mechanism and coordinated control law is an interesting and important problem for multi-agent networks. In this paper, we consider distributed coordination of discrete-time second-order multi-agent systems with partially measurable state and a limited communication data rate. A quantized-observer based encoding-decoding scheme is designed, which integrates the state observation with encoding/decoding. A distributed coordinated control law is proposed for each agent which is given in terms of the states of its encoder and decoders. It is shown that for a connected network, 2-bit quantizers suffice for the exponential asymptotic synchronization of the states of the agents. The selection of controller parameters and the performance limit are discussed. It is shown that the algebraic connectivity and the spectral radius of the Laplacian matrix of the communication graph play key roles in the closed-loop performance. The spectral radius of the Laplacian matrix is related to the selection of control gains, while the algebraic connectivity is related to the spectral radius of the closed-loop state matrix. Furthermore, it is shown that as the number of agents increases, the asymptotic convergence rate can be approximated as a function of the number of agents, the number of quantization levels (communication data rate) and the ratio of the algebraic connectivity to the spectral radius of the Laplacian matrix of the communication graph.
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.
Integrity signals
Registry
Cites
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.
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
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Cited by
Prescribed Performance Cooperative Control for Multiagent Systems With Input Quantization
Liang, H., Zhang, Y., Huang, T., & Ma, H. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2019.2893645 · Cited by 350
Overview: Collective Control of Multiagent Systems
Knorn, S., Chen, Z., & Middleton, R. H. (2016) · IEEE Transactions on Control of Network Systems · doi:10.1109/tcns.2015.2468991 · Cited by 281
Metadata
- Authors
- Li, T., & Xie, L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-12
- Volume
- 57
- Issue
- 12
- Pages
- 3023-3037
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2088919874
- Cited by
- 173
- References
- 5
- FWCI
- 10.55
- 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
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.