The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
$H_{\infty}$ Consensus Achievement of Multi-Agent Systems With Directed and Switching Topology Networks
Abstract
The consensus problems with H∞and weighted H∞bounds for a homogeneous team of linear time-invariant (LTI) multi-agent systems with a switching topology and directed communication network graph are studied in this technical note. Sufficient conditions to design distributed controllers are proposed based on state feedback corresponding to bounded L2gain and rms bounded disturbances. Based on the solution of an algebraic Riccati equation that circumvents the need to solve linear matrix inequalities (LMIs), a design methodology is proposed to properly select the controller gains. The stability properties of the proposed controllers are then investigated based on Lyapunov analysis. The effectiveness of our proposed consensus algorithms are then illustrated by performing simulations for diving consensus of a team of unmanned underwater vehicles (UUVs).
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 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 2×
“Proof: See proof of Lemma 2 in [11] and Remark 1 in [1].”
Background
Cited by
Dong, X., & Hu, G. (2016) · Automatica · doi:10.1016/j.automatica.2016.06.024 · Cited by 510
Metadata
- Authors
- Saboori, I., & Khorasani, K.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-11
- Volume
- 59
- Issue
- 11
- Pages
- 3104-3109
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2080183025
- Cited by
- 167
- References
- 1
- FWCI
- 19.26
- 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: $H_{\infty}$ Consensus Achievement of Multi-Agent Systems With Directed and Switching Topology Networks. https://app.cochat.ai/papers/10.1109/tac.2014.2358071
- The paper
- Saboori, I., & Khorasani, K. (2014). $H_{\infty}$ Consensus Achievement of Multi-Agent Systems With Directed and Switching Topology Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2014.2358071
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.