The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs
Abstract
This paper solves consensus problems for networked agents whose interactions with each other are described by signed digraphs. The Laplacian matrix of a signed digraph is studied by introducing rooted cycles, and the relationship between it and the spanning tree condition is addressed. In particular, the Laplacian matrix of a signed digraph with spanning trees is positive stable if and only if there is at least one negative rooted cycle; otherwise, it has exactly one zero eigenvalue if and only if either there exist no rooted cycles or all existing rooted cycles are positive. It is shown that all agents reach interval bipartite consensus if their associated signed digraph has a spanning tree. Further, the consensus values of all agents depend only on the initial states of those agents which are associated with root vertices. The developed consensus results are applicable for multi-agent systems with both continuous-time and discrete-time dynamics. Illustrative examples are provided to demonstrate interval bipartite consensus performances for multi-agent systems associated with different signed digraphs which all contain spanning trees but are not strongly connected.
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 1×
“When it comes to consensus of multiagent networks under the general directed graphs (digraphs for short), the necessary and sufficient condition is that the related digraphs have a spanning tree [5] or a globally reachable vertex [3], whereas the strong connectivity of the related digraphs just is sufficient but not n…”
BackgroundConsensus 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 3×
“controllers conducted by the nearest neighbor interaction rules, under which consensus is considered one of the basic problems for multi-agent systems (see also surveys and books [9]–[13]).”
BackgroundHorn, R. A., & Johnson, C. R. (1985) · Cambridge University Press eBooks · doi:10.1017/cbo9780511810817 · Cited by 10,280
Coordination 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
Consensus seeking in multiagent systems under dynamically changing interaction topologies
Ren, W., & Beard, R. W. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.846556 · Cited by 6,569
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897
Stability of multiagent systems with time-dependent communication links
Moreau, L. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841888 · Cited by 2,706
Structural balance: a generalization of Heider's theory.
Cartwright, D., & Harary, F. (1956) · Psychological Review · doi:10.1037/h0046049 · Cited by 2,525
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination
Cao, Y., Yu, W., Ren, W., & Chen, G. (2013) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2012.2219061 · Cited by 2,399
Consensus Problems on Networks With Antagonistic Interactions
Altafini, C. (2013) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2224251 · Cited by 2,109
Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms
Bullo, F., Cortés, J., & Martínez, S. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831470 · Cited by 1,509
Necessary and sufficient graphical conditions for formation control of unicycles
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841121 · Cited by 1,041
Leader-following coordination of multi-agent systems with coupling time delays
Hu, J., & Hong, Y. (2007) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2006.08.015 · Cited by 945
Convergence Speed in Distributed Consensus and Averaging
Olshevsky, A., & Tsitsiklis, J. N. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/060678324 · Cited by 692
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
Cao, M., Morse, A. S., & Anderson, B. D. O. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/060657005 · Cited by 563
Zaslavsky, T. (1982) · Discrete Applied Mathematics · doi:10.1016/0166-218x(82)90033-6 · Cited by 548
Computing global structural balance in large-scale signed social networks
Facchetti, G., Iacono, G., & Altafini, C. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1109521108 · Cited by 440
Valcher, M. E., & Misra, P. (2014) · Systems & Control Letters · doi:10.1016/j.sysconle.2014.01.006 · Cited by 415
Dynamics of Opinion Forming in Structurally Balanced Social Networks
Altafini, C. (2012) · PLoS ONE · doi:10.1371/journal.pone.0038135 · Cited by 265
Finite-Time Consensus for Multiagent Systems With Cooperative and Antagonistic Interactions
Meng, D., Jia, Y., & Du, J. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2424225 · Cited by 208
Self-citationEmergent collective behaviors on coopetition networks
Hu, J., & Zheng, W. X. (2014) · Physics Letters A · doi:10.1016/j.physleta.2014.04.070 · Cited by 202
Bipartite consensus of general linear multi-agent systems
Zhang, H., & Chen, J. (2014) · Proceedings of the ... American Control Conference/Proceedings of the American Control Conference · doi:10.1109/acc.2014.6858991 · Cited by 111
Bipartite consensus for multi-agent systems on directed signed networks
Hu, J., & Zheng, W. X. (2013) · Proceedings of the IEEE Conference on Decision & Control, including the Symposium on Adaptive Processes · doi:10.1109/cdc.2013.6760412 · Cited by 99
Bipartite flocking for multi-agent systems
Fan, M.-C., Zhang, H., & Wang, M. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2013.10.009 · Cited by 94
Meng, D., Jia, Y., & Du, J. (2015) · International Journal of Control · doi:10.1080/00207179.2015.1033757 · Cited by 68
Self-citationModulus Consensus over Networks with Antagonistic Interactions and Switching TopologiesPreprint
Meng, Z., Shi, G., Johansson, K. H., Cao, M., & Hong, Y. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1402.2766 · Cited by 19
Bipartite coordination problems on networks of multiple mobile agents
Meng, D., Jia, Y., & Du, J. (2015) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2015.07.009 · Cited by 13
Self-citationCollective four-group antagonistic formation motion
Lu, W., Gao, H., & Dai, M. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896815 · Cited by 4
Dynamic output feedback control of multi-agent systems over signed graphs
Zhang, H. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896821 · Cited by 4
Consensus of multi-agent systems with antagonistic interactions and communication delays
Du, M., & Meng, D. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896777 · Cited by 4
Self-citationMulti-agent systems with compasses: Cooperative and cooperative-antagonistic networks
Meng, Z., Shi, G., & Johansson, K. H. (2014) · Chinese Control Conference (CCC) · doi:10.1109/chicc.2014.6896839 · Cited by 3
Cited by
A tutorial on modeling and analysis of dynamic social networks. Part I
Proskurnikov, A. V., & Tempo, R. (2017) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2017.03.002 · Cited by 553
On the Bipartite Consensus for Generic Linear Multiagent Systems With Input Saturation
Qin, J., Fu, W., Zheng, W. X., & Gao, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2612482 · Cited by 373
Peng, Z., Hu, J., Shi, K., Luo, R., Huang, R., Ghosh, B. K., & Huang, J. (2020) · Applied Mathematics and Computation · doi:10.1016/j.amc.2019.124821 · Cited by 302
A tutorial on modeling and analysis of dynamic social networks. Part II
Proskurnikov, A. V., & Tempo, R. (2018) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2018.03.005 · Cited by 294
Yang, H., & Ye, D. (2018) · Information Sciences · doi:10.1016/j.ins.2018.04.016 · Cited by 279
Metadata
- Authors
- Meng, D., Du, M., & Jia, Y.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2016-12
- Volume
- 61
- Issue
- 12
- Pages
- 3755-3770
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2343734929
- Cited by
- 401
- References
- 32
- FWCI
- 31.58
- 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
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.