The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Consensus of multi‐agent linear dynamic systems
Abstract
In this paper the consensus problem is considered for multi‐agent systems, in which all agents have an identical linear dynamic mode that can be of any order. The main result is that if the adjacent topology of the graph is frequently connected then the consensus is achievable via local‐information‐based decentralized controls, provided that the linear dynamic mode is completely controllable. Consequently, many existing results become particular cases of this general result. In this paper, the case of fixed connected topology is discussed first. Then the case of switching connected topology is considered. Finally, the general case is studied where the graph topology is switching and only connected often enough. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society
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
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×
“A survey on consensus problems was given in [12].”
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Novel Type of Phase Transition in a System of Self-Driven Particles
Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., & Shochet, O. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1226 · Cited by 7,380
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Information Flow and Cooperative Control of Vehicle Formations
Fax, J. A., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834433 · Cited by 4,579
Kalman Filtering With Intermittent Observations
Sinopoli, B., Schenato, L., Franceschetti, M., Poolla, K., Jordan, M. I., & Sastry, S. S. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834121 · Cited by 2,544
Vidyasagar, M., & Desoer, C. A. (1980) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1980.4308549 · Cited by 2,011
Necessary and sufficient graphical conditions for formation control of unicycles
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841121 · Cited by 1,041
Vidyasagar, M. (2002) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719185 · Cited by 996
New approach to synchronization analysis of linearly coupled ordinary differential systems
Lu, W., & Chen, T. (2006) · Physica D: Nonlinear Phenomena · doi:10.1016/j.physd.2005.11.009 · Cited by 620
Synchronization in oscillator networks with delayed coupling: A stability criterion
Earl, M. G., & Strogatz, S. H. (2003) · Physical Review E · doi:10.1103/physreve.67.036204 · Cited by 261
Consensus control for a class of networks of dynamic agents: switching topology
Xie, G., & Wang, L. (2006) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2006.1656410 · Cited by 43
Cited by
Leader-following consensus of multi-agent systems under fixed and switching topologies
Ni, W., & Cheng, D. (2010) · Systems & Control Letters · doi:10.1016/j.sysconle.2010.01.006 · Cited by 1,462
Self-citationConsensus of Linear Multi-Agent Systems by Distributed Event-Triggered Strategy
Hu, W., Liu, L., & Feng, G. (2016) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2015.2398892 · Cited by 738
Consensus of high-order linear systems using dynamic output feedback compensator: Low gain approach
Seo, J. H., Shim, H., & Back, J. (2009) · Automatica · doi:10.1016/j.automatica.2009.07.022 · Cited by 615
Cooperative Output Regulation With Application to Multi-Agent Consensus Under Switching Network
Su, Y., & Huang, J. (2012) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2011.2179981 · Cited by 487
Stability of a Class of Linear Switching Systems with Applications to Two Consensus Problems
Su, Y., & Huang, J. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2176391 · Cited by 453
Metadata
- Authors
- Wang, J., Cheng, D., & Hu, X.
- Venue
- Asian Journal of Control
- Publisher
- Wiley
- Published
- 2008-03
- Volume
- 10
- Issue
- 2
- Pages
- 144-155
- ISSN
- 1561-8625 (ISSN-L)
- 1934-6093
- OpenAlex
- W2103949151
- Cited by
- 257
- References
- 15
- FWCI
- 26.34
- 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.