The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Conditions for Synchronizability in Arrays of Coupled Linear Systems
Open accessAbstract
Synchronization in arrays of coupled continuous-time linear systems is studied. Sufficiency of certain conditions for the existence of a synchronizing feedback law are analyzed. It is shown that, for neutrally stable systems that are detectable from their outputs, a linear feedback law exists under which any number of coupled systems synchronize provided that the (directed, weighted) graph describing the interconnection is fixed and connected. An algorithm generating one such feedback law as well as the trajectory that the solutions converge to are presented. It is also shown that, for critically unstable systems, detectability is not sufficient, whereas full-state coupling is, for the existence of a linear feedback law that is synchronizing for all coupling configurations described by a connected 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 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×
“) The studies concentrated on the first case have resulted in the emergence of the area now known as consensus in multi-agent systems [17, 16, 8, 13, 20, 2, 6, 25] where fairly weak conditions on the interconnection have been established under which the states of individual systems converge to a common point fixed in…”
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
Distributed 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
Cited by
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Designing Fully Distributed Consensus Protocols for Linear Multi-Agent Systems With Directed Graphs
Li, Z., Wen, G., Duan, Z., & Ren, W. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2350391 · Cited by 1,137
Li, Z., Ren, W., Liu, X., & Fu, M. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2235715 · Cited by 841
Distributed consensus of linear multi-agent systems with adaptive dynamic protocols
Li, Z., Ren, W., Liu, X., & Xie, L. (2013) · Automatica · doi:10.1016/j.automatica.2013.03.015 · Cited by 672
Event-triggered communication and control of networked systems for multi-agent consensus
Nowzari, C., Garcia, E., & Cortés, J. (2019) · Automatica · doi:10.1016/j.automatica.2019.03.009 · Cited by 655
“…systems with linear dynamics and assuming continuous communication has been extensively studied, e.g., Li, Duan, and Chen (2011), Li, Duan, Chen, and Huang (2010), Ma and Zhang (2010), Ren (2008b), Scardovi and Sepulchre (2009), Seo, Shim, and Back (2009), Su and Huang (2012) and Tuna (2008, 2009).”
Background
Metadata
- Authors
- Tuna, S. E.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2009-10
- Volume
- 54
- Issue
- 10
- Pages
- 2416-2420
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2146445863
- Cited by
- 246
- References
- 3
- FWCI
- 21.78
- 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.