Abstract
The emergence of new technologies such as the Internet of things and the Cloud transforms the way we interact. Whether it be human to human interaction or human to machine interaction, the size of the networks keeps growing. As the networks get more complex nowadays with many interconnected components, it is necessary to develop distributed scalable algorithms so as to minimize the computation required in decision making in such large-scale systems. In this paper, we consider a setup where each agent in the network updates its opinion by relying on its neighbors’ opinions. The information exchange between the agents is assumed to be mutual. The cluster consensus problem is investigated for networks represented by static or time-varying graphs. Joint and integral connectivity conditions are utilized to determine the number of clusters that are formed, as the interactions among the agents evolve over time. Finally, some numerical examples are given to illustrate the theoretical results.
Similar content being viewed by others
References
Acemoglu D, Ozdaglar A (2011) Opinion dynamics and learning in social networks. Dyn Games Appl 1(1):3–49
Akar M, Shorten R (2008) Distributed probabilistic synchronization algorithms for communication networks. IEEE Trans Autom Control 53(1):389–393
Avvenuti M, Cresci S, Del Vigna F, Tesconi M (2017) On the need of opening up crowdsourced emergency management systems. In: AI and society, pp 1–6
Cao M, Morse AS, Anderson BD (2008) Agreeing asynchronously. IEEE Trans Autom Control 53(8):1826–1838
Cao L, Zheng Y, Zhou Q (2011) A necessary and sufficient condition for consensus of continuous-time agents over undirected time-varying networks. IEEE Trans Autom Control 56(8):1915–1920
Castelfranchi C, Falcone R (1998) Principles of trust for MAS: cognitive anatomy, social importance, and quantification. In: Proceedings of the international conference on multi agent systems, pp 72–79
Chen Y, Lu J, Han F, Yu X (2011) On the cluster consensus of discrete-time multi-agent systems. Syst Control Lett 60(7):517–523
Cihan O, Akar M (2015) Effect of nonuniform varying delay on the rate of convergence in averaging-based consensus. Turk J Electri Eng Comput Sci 23:1069–1080
Erkan OF, Akar M (2015) Distributed consensus with multiple equilibria in continuous-time multi-agent networks under undirected topologies. In: Proceedings of the 16th IFAC conference on TECIS, vol 48(24), pp 225–230
Erkan OF, Akar M (2016) Discrete-time analysis of multi-agent networks with multiple consensus equilibria. In: Proceeding of 14th IFAC symposium on control in transportation systems, pp 389–394
Erkan OF, Akar M (2017) An integral connectivity condition for multi-equilibria consensus in networks evolving over undirected graphs. Anadolu Univ J Sci Technol (AUJST-A) 18(4):842–848
Erkan OF, Cihan O, Akar M (2017) Distributed consensus with multi-equilibria in directed networks. In: Proceeding of American control conference, pp 4681–4685
Flanagan M (2006) Making games for social change. AI Soc 20(4):493–505
Gazi V (2008) Stability of an asynchronous swarm with time-dependent communication links. IEEE Trans Syst Man Cybern Part B Cybern 38(1):267–274
Ge X, Yang F, Han QL (2017) Distributed networked control systems: a brief overview. Inf Sci 380:117–131
Han GS, Guan ZH, Cheng XM, Wu Y, Liu F (2013a) Multiconsensus of second order multiagent systems with directed topologies. Int J Control Autom Syst 11(6):1122–1127
Han Y, Lu W, Chen T (2013b) Cluster consensus in discrete-time networks of multi agents with inter-cluster nonidentical inputs. IEEE Trans Neural Netw Learn Syst 24(4):566–578
Hörner J (2002) Reputation and competition. Am Econ Rev 92:644–663
Karlins M, Abelson HI (1970) Persuasion: how opinions and attitudes are changed. Lockwood, London
Li L, Scaglione A, Swami A, Zhao Q (2013a) Consensus, polarization and clustering of opinions in social networks. IEEE J Sel Areas Commun 31(6):1072–1083
Li Q, Braunstein LA, Wang H, Shao J, Stanley HE, Havlin S (2013b) Non-consensus opinion models on complex networks. J Stat Phys 151(1–2):92–112
Mossel E, Schoenebeck G (2010) Reaching consensus on social networks. In: Innovations in computer science, pp 214–229
Qin J, Yu C (2013) Cluster consensus control of generic linear multi-agent systems under directed topology with acyclic partition. Automatica 49(9):2898–2905
Qin J, Ma Q, Shi Y, Wang L (2017) Recent advances in consensus of multi-agent systems: a brief survey. IEEE Trans Ind Electron 64(6):4972–4983
Ren W, Beard RW (2005) Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans Autom Control 50(5):655–661
Tan C, Liu GP, Duan GR (2011) Group consensus of networked multi-agent systems with directed topology. In: Proceedings of the 18th IFAC World congress, Milano, pp 8878–8893
Tsitsiklis JN, Bertsekas DP, Athans M (1986) Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans Autom Control 31(9):803–812
Vicsek T, Czirok A, Ben-Jacob E, Cohen I, Shochet O (1995) Novel type of phase transition in a system of self-driven particles. Phys Rev Lett 75(6):1226
Xia W, Cao M (2011) Clustering in diffusively coupled networks. Automatica 47(11):2395–2405
Yu C, Qin J (2014) Synchronization for interacting clusters of generic linear agents and nonlinear oscillators: a unified analysis. World Congr Int Fed Autom Control 19(1):1965–1970
Yu J, Wang L (2012) Group consensus of multi-agent systems with directed information exchange. Int J Syst Sci 43(2):334–348
Acknowledgements
This work was sponsored by Scientific and Technical Research Council of Turkey (TUBITAK) under Grant 114E613.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper has been presented at TECIS 2015.
Appendix
Appendix
Lemma 3
(Erkan and Akar 2016) Let \({W_{\text{1}}}, \ldots ,{W_j}\) be a finite set of row stochastic matrices that correspond to equivalent K connected graphs. Suppose that for each sequence \({W_{{i_{\text{1}}}}}, \ldots {\text{ }},{W_{{i_j}}}\) of positive length, the graph associated with the product is also equivalent K connected. Then, for each infinite sequence \({W_{{i_{\text{1}}}}}{\text{ }},{W_{{i_{\text{2}}}}}{\text{ }}, \ldots ,\) there exist vectors \({c_{\text{1}}}, \ldots ,{c_K}\) such that
where C K is in the form
Lemma 4
(Erkan and Akar (2015) If the union of a set of undirected graphs \(\{ {\mathcal{G}_{{t_1}}}, \ldots ,{\mathcal{G}_{{t_m}}}\}\) has K connected components and \({\mathcal{L}_{{t_j}}},\;j\,=\,1, \ldots ,m\) is the Laplacian matrix corresponding to each graph \({\mathcal{G}_{{t_j}}}\) in (3), then the matrix product satisfies
where C K = \({\text{diag}}\{ {{\mathbf{1}}_n}_{{_{1}}}{c_1}^{ \top }, \ldots ,{{\mathbf{1}}_n}_{{_{K}}}{c_K}^{ \top }\}\)and ∆t j >0 are bounded.
Proof
Suppose that the union of the graphs \({\mathcal{G}_{{t_1}}}, \ldots ,{\mathcal{G}_{{t_m}}}\) has K connected components. Note that \(- {\mathcal{L}_{{t_j}}}\), \(j\,=\,{\text{1}}, \ldots ,m\) can be expressed as \({M_{{t_j}}} - {\eta _{{t_j}}}{I_n}\)where \({\eta _{{t_j}}}\)is the maximum value of diagonal entries of \({\mathcal{L}_{t_j}}\) and \({M_{{t_j}}}\)is a matrix with non-negative elements. It can be written \({{\text{e}}^{ - \mathcal{L}{t_j}\Delta {t_j}}}={{\text{e}}^{{M_{{t_j}}}\Delta {t_j}}}\)\({{\text{e}}^{ - {\eta _{{t_j}}}\Delta {t_j}}}\), which implies that \({{\text{e}}^{ - {\mathcal{L}_t}_{{_{j}}}}}\) is a stochastic matrix with positive diagonal elements. Then following the proof of Lemma 6 in Erkan and Akar (2016), it can be shown that (9) holds.\(\square\)
Proof of Theorem 2
The set of all possible matrices \({{\text{e}}^{ - \mathcal{L}({t_i})}}\) can be chosen from the finite set \(\bar {F}=\{ {{\text{e}}^{ - \mathcal{L}({t_i})}},{\tau _i} \in \bar {\tau }\}\). Suppose \([{t_{{i_j}+{l_j}}},{t_{{i_j}+1}})\) is uniformly bounded, i.e., there exists a constant B such that \(\left| {{t_{{i_j}+1}} - {t_{{i_j}+{l_j}}}} \right|<B\) for all i, j. Consider the j-th time interval \([{t_{{i_j}}},{t_{{i_j}+1}})\) which is bounded due to fact that both \([{t_{{i_j}}},{t_{{i_j}+{l_j}}})\) and \([{t_{{i_j}+{l_j}}},{t_{{i_j}+1}})\)are bounded. The union of the graphs across \([{t_{{i_j}}},{t_{{i_j}+1}}),\)denoted as \(\bar {G}({t_{{i_j}}}),\) has K connected components since the union of graphs across \([{t_{{i_j}}},{t_{{i_j}+{l_j}}})\) has K connected components. Let \(\{ \mathcal{L}({t_{{i_j}}}),\mathcal{L}({t_{{i_j}+1}}), \ldots ,\mathcal{L}({t_{{i_{j+1}} - 1}})\}\) be the set of Laplacian matrices corresponding to each graph in the union \(\bar {G}({t_{{i_j}}}).\)
From Lemma 4, the matrix product \({{\text{e}}^{ - \mathcal{L}({t_{{i_{j+1}} - 1}})({\tau _{{i_{j+1}} - 1}})}} \ldots {{\text{e}}^{ - \mathcal{L}({t_{{i_{j+1}}}})({\tau _{{i_{j+1}}}})}}{{\text{e}}^{ - \mathcal{L}({t_{{i_j}}})({\tau _{{i_j}}})}},\) j ≥ 1 is K connected. Then by Lemma 3, we conclude that a network of agents utilizing consensus protocol (2) achieves K consensus equilibria.\(\square\)
Rights and permissions
About this article
Cite this article
Erkan, Ö.F., Akar, M. Cluster consensus in multi-agent networks with mutual information exchange. AI & Soc 33, 197–205 (2018). https://doi.org/10.1007/s00146-018-0814-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00146-018-0814-z