The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Finite-Time Bipartite Consensus for Multi-Agent Systems on Directed Signed Networks
Open accessAbstract
This paper addresses the finite-time bipartite consensus problem for multi-agent systems (MASs) on a directed signed network. Some properties for signed digraphs are first investigated and two nonlinear control protocols are then designed for first- and second-order MASs, respectively, where agents may be influenced by bounded disturbances. Particularly, for MASs with second-order dynamics, a new estimation technique is developed to estimate the settling time. Simulation results are finally presented to verify the effectiveness of the proposed control protocols.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Cited by
Ning, B., Han, Q.-L., & Zuo, Z. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008125 · Cited by 266
Metadata
- Authors
- Wang, H., Yu, W., Wen, G., & Chen, G.
- Venue
- IEEE Transactions on Circuits and Systems I: Regular Papers
- Published
- 2018-12
- Volume
- 65
- Issue
- 12
- Pages
- 4336-4348
- ISSN
- 1549-8328 (ISSN-L)
- 1558-0806
- OpenAlex
- W2899510315
- Cited by
- 192
- References
- 1
- FWCI
- 13.54
- 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: Finite-Time Bipartite Consensus for Multi-Agent Systems on Directed Signed Networks. https://app.cochat.ai/papers/10.1109/tcsi.2018.2838087
- The paper
- Wang, H., Yu, W., Wen, G., & Chen, G. (2018). Finite-Time Bipartite Consensus for Multi-Agent Systems on Directed Signed Networks. IEEE Transactions on Circuits and Systems I: Regular Papers. https://doi.org/10.1109/tcsi.2018.2838087
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.