The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Consensus of Multiagent Systems Subject to Partially Accessible and Overlapping Markovian Network Topologies
Abstract
This paper addresses the consensus problem for a continuous-time multiagent system (MAS) with Markovian network topologies and external disturbance. Different from some existing results, global jumping modes of the Markovian network topologies are not required to be completely available for consensus protocol design. A network topology mode regulator (NTMR) is first developed to decompose unavailable global modes into several overlapping groups, where overlapping groups refer to the scenario that there exist commonly shared local modes between any two distinct groups. The NTMR schedules which group modes each agent may access at every time step. Then a new group mode-dependent distributed consensus protocol on the basis of relative measurement outputs of neighboring agents is delicately constructed. In this sense, the proposed consensus protocol relies only on group and partial modes and eliminates the need for complete knowledge of global modes. Sufficient conditions on the existence of desired distributed consensus protocols are derived to ensure consensus of the MAS with a prescribed $H_{\infty }$ performance level. Two examples are provided to show the effectiveness of the proposed consensus protocol.
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 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 · cited 5×
“3) Network topologies deployed for consensus seeking in the existing literature, in most cases, are fixed a priori (see [7], [10]–[17], [20]–[23]).”
BackgroundInfluentialConsensus 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×
“well studied from various perspectives such as agents’ dynamics, control strategies, and constraints on communication and there are many results available in [1]–[6].”
Background
Cited by
An Overview of Recent Advances in Event-Triggered Consensus of Multiagent Systems
Ding, L., Han, Q.-L., Ge, X., & Zhang, X.-M. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2771560 · Cited by 1,182
Self-citationA survey on security control and attack detection for industrial cyber-physical systems
Ding, D., Han, Q.-L., Xiang, Y., Ge, X., & Zhang, X.-M. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.10.009 · Cited by 944
Self-citationAn 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
Self-citationGe, X., Han, Q.-L., & Wang, Z. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2769722 · Cited by 500
Self-citationA survey on recent advances in distributed sampled-data cooperative control of multi-agent systems
Ge, X., Han, Q.-L., Ding, D., Zhang, X.-M., & Ning, B. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.10.008 · Cited by 389
Self-citation
Metadata
- Authors
- Ge, X., & Han, Q.-L.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2017-08
- Volume
- 47
- Issue
- 8
- Pages
- 1807-1819
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2417709453
- Cited by
- 219
- References
- 2
- FWCI
- 36.95
- 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 Multiagent Systems Subject to Partially Accessible and Overlapping Markovian Network Topologies. https://app.cochat.ai/papers/10.1109/tcyb.2016.2570860
- The paper
- Ge, X., & Han, Q.-L. (2017). Consensus of Multiagent Systems Subject to Partially Accessible and Overlapping Markovian Network Topologies. IEEE Transactions on Cybernetics. https://doi.org/10.1109/tcyb.2016.2570860
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.