The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions
Abstract
This paper deals with finite-time consensus problems for multiagent systems that are subject to hybrid cooperative and antagonistic interactions. Two consensus protocols are constructed by employing the nearest neighbor rule. It is shown that under the presented protocols, the states of all agents can be guaranteed to reach an agreement in a finite time regarding consensus values that are the same in modulus but may not be the same in sign. In particular, the second protocol can enable all agents to reach a finite-time consensus with a settling time that is not dependent upon the initial states of agents. Simulation results are given to demonstrate the effectiveness and finite-time convergence of the proposed consensus 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
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×
“I. INTRODUCTION CONSENSUS is considered as one of the hottest topicsin the studies of multiagent systems that consist of a group of mobile agents operating in a cooperative manner to implement tasks for the group [1]–[6].”
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
An Overview of Recent Advances in Fixed-Time Cooperative Control of Multiagent Systems
Zuo, Z., Han, Q.-L., Ning, B., Ge, X., & Zhang, X.-M. (2018) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2018.2817248 · Cited by 658
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Meng, D., Du, M., & Jia, Y. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2016.2528539 · Cited by 401
Self-citationFinite-Time and Fixed-Time Cluster Synchronization With or Without Pinning Control
Liu, X., & Chen, T. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2630703 · Cited by 287
Ning, B., Han, Q.-L., & Zuo, Z. (2021) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2020.3008125 · Cited by 266
Metadata
- Authors
- Meng, D., Jia, Y., & Du, J.
- Venue
- IEEE Transactions on Neural Networks and Learning Systems
- Published
- 2016-04
- Volume
- 27
- Issue
- 4
- Pages
- 762-770
- ISSN
- 2162-237X (ISSN-L)
- 2162-2388
- OpenAlex
- W2300802593
- Cited by
- 208
- References
- 2
- FWCI
- 19.57
- 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: Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions. https://app.cochat.ai/papers/10.1109/tnnls.2015.2424225
- The paper
- Meng, D., Jia, Y., & Du, J. (2016). Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2015.2424225
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.