The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Robust Synchronization of Uncertain Linear Multi-Agent Systems
Open accessAbstract
This paper deals with robust synchronization of uncertain multi-agent networks. Given a network with for each of the agents identical nominal linear dynamics, we allow uncertainty in the form of additive perturbations of the transfer matrices of the nominal dynamics. The perturbations are assumed to be stable and bounded inH∞-norm by some a priori given desired tolerance. We derive state space formulas for observer based dynamic protocols that achieve synchronization for all perturbations bounded by this desired tolerance. It is shown that a protocol achieves robust synchronization if and only if each controller from a related finite set of feedback controllers robustly stabilizes a given, single linear system. Our protocols are expressed in terms of real symmetric solutions of certain algebraic Riccati equations and inequalities, and also involve weighting factors that depend on the eigenvalues of the graph Laplacian. For undirected network graphs we show that within the class of such dynamic protocols, a guaranteed achievable tolerance can be obtained that is proportional to the quotient of the second smallest and the largest eigenvalue of the Laplacian. We also extend our results to additive nonlinear perturbations withL2-gain bounded by a given tolerance.
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 1×
“Among these problem formulations perhaps the most well-known is the consensus problem, see [15], [17], [18], [20], [21] and pioneering work in [28].”
BackgroundConsensus 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×
“An excellent overview of the literature can be found in [19].”
BackgroundCoordination 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
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×
“Many properties of networked systems can be expressed in terms of the spectrum of the Laplacian, see [13], [30].”
BackgroundDistributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Consensus protocols for networks of dynamic agents
Saber, R. O., & Murray, R. M. (2004) · Proceedings of the 2003 American Control Conference, 2003. · doi:10.1109/acc.2003.1239709 · Cited by 901
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
Output Consensus of Heterogeneous Linear Multi-Agent Systems with Adaptive Event-Triggered Control
Qian, Y.-Y., Liu, L., & Feng, G. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2868997 · Cited by 326
Leader–follower consensus of time-varying nonlinear multi-agent systems
Zhang, X., Liu, L., & Feng, G. (2015) · Automatica · doi:10.1016/j.automatica.2014.10.127 · Cited by 302
Bechlioulis, C. P., & Rovithakis, G. A. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2535102 · Cited by 301
Metadata
- Authors
- Trentelman, H. L., Takaba, K., & Monshizadeh, N.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2013-06
- Volume
- 58
- Issue
- 6
- Pages
- 1511-1523
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2113281549
- Cited by
- 315
- References
- 7
- FWCI
- 37.45
- 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: Robust Synchronization of Uncertain Linear Multi-Agent Systems. https://app.cochat.ai/papers/10.1109/tac.2013.2239011
- The paper
- Trentelman, H. L., Takaba, K., & Monshizadeh, N. (2013). Robust Synchronization of Uncertain Linear Multi-Agent Systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2013.2239011
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.