The DOI matches its Crossref record; 3 of the 3 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
Cited by
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
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
- 3
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Consensus of multi‐agent linear dynamic systems. https://app.cochat.ai/papers/10.1002/asjc.15
- The paper
- Wang, J., Cheng, D., & Hu, X. (2008). Consensus of multi‐agent linear dynamic systems. Asian Journal of Control. https://doi.org/10.1002/asjc.15
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.
