Abstract
The emergence of the graphical characterization of multiagent controllability has raised several issues concerning how to directly establish controllability from topology structures. Arguably, one of the most serious challenges to this research field is the means through which equivalent partition, which plays an important role in graphical characterization, obtains sufficient controllability conditions; hence, how equivalent partition influences controllability has garnered considerable attention. This article specifically focuses on the sufficient conditions and limitations of equivalent partition in multiagent controllability. We provide two sufficient conditions: (i) the absence of the system matrix’s eigenvectors that make the equation formed by the eigenvalues and eigenvectors hold and (ii) the addition of leaders by reducing the same number of followers. The first condition particularly exhibits a relation between two apparently unrelated parts: Tao’s equation and controllability. We further propose a necessary and sufficient condition for controllability under n-node graphs (n ⩽ 5) by taking advantage of iso-neighbor nodes, and analyze the resulting difficulties when n is greater than 5. Immediate corollaries of our results are obtained. Finally, we reveal the limitation of equivalent partition in controllability analysis. Several constructive examples demonstrate our results.
Similar content being viewed by others
References
Cai N, He M, Wu Q X, et al. On almost controllability of dynamical complex networks with noises. J Syst Sci Complex, 2019, 32: 1125–1139
Jadbabaie A, Lin J, Morse A S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans Autom Control, 2003, 48: 988–1001
Liu S, Ji Z J, Ma H Z. Jordan form-based algebraic conditions for controllability of multiagent systems under directed graphs. Complexity, 2020, 2020: 1–15
Fax J A, Murray R M. Information flow and cooperative control of vehicle formations. IEEE Trans Autom Control, 2004, 49: 1465–1476
Sun H, Liu Y G, Li F Z, et al. Distributed LQR optimal protocol for leader-following consensus. IEEE Trans Cybern, 2019, 49: 3532–3546
Sun H, Liu Y G, Li F Z. Distributed optimal consensus of second-order multi-agent systems. Sci China Inf Sci, 2021, 64: 209201
Ren W, Beard R W. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Trans Autom Control, 2015, 50: 655–661
Tanner H. On the controllability of nearest neighbor interconnections. In: Proceedings of IEEE Conference on Decision and Control, 2004. 2467–2472
Wang L, Jiang F C, Xie G M, et al. Controllability of multi-agent systems based on agreement protocols. Sci China Ser F-Inf Sci, 2009, 52: 2074–2088
Ji Z J, Wang Z D, Lin H, et al. Interconnection topologies for multi-agent coordination under leader-follower framework. Automatica, 2009, 45: 2857–2863
Chao Y C, Ji Z J. Necessary and sufficient conditions for multi-agent controllability of path and star topologies by exploring the information of second-order neighbours. IMA J Math Control Inform, 2021, 38: 1–14
Qi Q Y, Qiu Z H, Ji Z J. Optimal continuous/impulsive LQ control with quadratic constraints. IEEE Access, 2019, 7: 52955–52963
Tan Z Y, Cai N, Zhou J, et al. On performance of peer review for academic journals: analysis based on distributed parallel system. IEEE Access, 2019, 7: 19024–19032
Liu X Z, Ji Z J. Controllability of multiagent systems based on path and cycle graphs. Int J Robust Nonlinear Control, 2018, 28: 296–309
Guan Y Q, Kong X L. Stabilisability of discrete-time multi-agent systems under fixed and switching topologies. Int J Syst Sci, 2019, 50: 294–306
Xi J X, Wang C, Liu H, et al. Completely distributed guaranteed-performance consensualization for high-order multiagent systems with switching topologies. IEEE Trans Syst Man Cybern Syst, 2019, 49: 1338–1348
Xi J X, Wang C, Liu H, et al. Dynamic output feedback guaranteed-cost synchronization for multiagent networks with given cost budgets. IEEE Access, 2018, 6: 28923–28935
Ji Z J, Lin H, Yu H S. Leaders in multi-agent controllability under consensus algorithm and tree topology. Syst Control Lett, 2012, 61: 918–925
Aguilar O, Gharesifard B. On almost equitable partitions and network controllability. In: Proceedings of American Control Conference (ACC), Boston, 2016. 179–184
Ji Z J, Yu H. A new perspective to graphical characterization of multiagent controllability. IEEE Trans Cybern, 2017, 47: 1471–1483
Liu K E, Ji Z J, Xie G M, et al. Event-based broadcasting containment control for multi-agent systems under directed topology. Int J Control, 2016, 89: 2360–2370
Guan Y Q, Ji Z J, Zhang L, et al. Controllability of heterogeneous multi-agent systems under directed and weighted topology. Int J Control, 2016, 89: 1009–1024
Li Z Q, Ji Z J, Chao Y C, et al. Graph controllability classes of networked multi-agent systems with multi-signal inputs. CAAI Trans Intell Syst, 2016, 11: 783–790
Ji Z J, Lin H, Yu H S. Protocols design and uncontrollable topologies construction for multi-agent networks. IEEE Trans Autom Control, 2015, 60: 781–786
Ji Z J, Lin H, Feng G, et al. Controllability structure decomposition for switched linear systems. Trans Inst Meas Control, 2010, 32: 736–755
Aguilar C O. Strongly uncontrollable network topologies. IEEE Trans Control Netw Syst, 2020, 7: 878–886
Cai N, Diao C, Khan M J. A novel clustering method based on quasi-consensus motions of dynamical multiagent systems. Complexity, 2017, 2017: 1–15
Guan Y Q, Ji Z J, Zhang L, et al. A survey on controllability of multi-agent systems. Control Theory Appl, 2015, 32: 421–431
Liu B, Ping Y Y, Wu L C, et al. Controllability of discrete-time multi-agent systems based on absolute protocol with time-delays. Neurocomputing, 2020, 409: 316–328
Liu B, Su H, Wu L, et al. Fractional-order controllability of multi-agent systems with time-delay. Neurocomputing, 2021, 424: 268–277
Liu B, Su H S, Wu L C, et al. A new perspective to algebraic characterization on controllability of multiagent systems. Complexity, 2020, 2020: 1–12
Lu J Q, Sun L J, Liu Y, et al. Stabilization of Boolean control networks under aperiodic sampled-data control. SIAM J Control Optim, 2018, 56: 4385–4404
Lu J Q, Zhong J, Ho D W C, et al. On controllability of delayed Boolean control networks. SIAM J Control Optim, 2016, 54: 475–494
Guan Y Q, Wang L L. Target controllability of multiagent systems under fixed and switching topologies. Int J Robust Nonlinear Control, 2019, 29: 2725–2741
Guan Y Q, Tian L L, Wang L. Controllability of switching signed networks. IEEE Trans Circ Syst II, 2020, 67: 1059–1063
Shang Y L, Ye Y M. Fixed-time group tracking control with unknown inherent nonlinear dynamics. IEEE Access, 2017, 5: 12833–12842
Rahmani A, Ji M, Mesbahi M, et al. Controllability of multi-agent systems from a graph-theoretic perspective. SIAM J Control Optim, 2009, 48: 162–186
Aguilar C O, Gharesifard B. Graph controllability classes for the laplacian leader-follower dynamics. IEEE Trans Autom Control, 2015, 60: 6
She B K, Mehta S, Ton C, et al. Controllability ensured leader group selection on signed multiagent networks. IEEE Trans Cybern, 2020, 50: 222–232
Cardoso D M, Delorme C, Rama P. Laplacian eigenvectors and eigenvalues and almost equitable partitions. Eur J Combin, 2007, 28: 665–673
Lou Y H, Ji Z J, Qu J J. New results of multi-agent controllability under equitable partitions. IEEE Access, 2020, 8: 73523–73535
Qu J J, Ji Z J, Shi Y. The graphical conditions for controllability of multi-agent systems under equitable partition. IEEE Trans Cybern, 2021, 51: 4661–4672
Ji Z J, Lin H, Cao S, et al. The complexity in complete graphic characterizations of multiagent controllability. IEEE Trans Cybern, 2020, 51: 64–76
Denton P, Parke S, Tao T, et al. Eigenvectors from eigenvalues. 2019. ArXiv:1906.03795v1
Zhang A H, Zhang S J, Chen J, et al. Graph theoretic characterization of controllability for multi-agent systems. Control Dec, 2011, 26: 1621–1626
Zheng D Z. Linear System Theory. Beijing: Tsinghua University Press, 2002
Shang Y L. Group pinning consensus under fixed and randomly switching topologies with acyclic partition. Netw Heterog Media, 2014, 9: 553–573
Acknowledgements
This work was supported by the National Natural Science Foundation of China (Grant Nos. 61873136, 62033007, 61873146, 61703237) and Taishan Scholars Climbing Program of Shandong Province and Taishan Scholar Project of Shandong Province of China (Grant No. ts20190930).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guo, J., Ji, Z. & Liu, Y. Sufficient conditions and limitations of equivalent partition in multiagent controllability. Sci. China Inf. Sci. 65, 132204 (2022). https://doi.org/10.1007/s11432-020-3159-9
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11432-020-3159-9