Advertisement

Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Controllability analysis of multi-agent systems with switching topology over finite fields

Abstract

In this paper, we investigate the controllability problem of multi-agent systems with switching topology over finite fields. The multi-agent system is defined over finite fields, where agents process only values from a finite alphabet. Under leader-follower structure, one agent is selected as a leader for each subsystem. First, we prove that a multi-agent system with switching topology is controllable over a finite field if the graph of the subsystem is a spanning forest, and the size of the field is sufficiently large. Second, we show that, by appropriately selecting leaders, the multi-agent system with switching topology can be controllable over a finite field even if each of its subsystems is not controllable. Specifically, we show that the number of leaders for ensuring controllability of the switched multi-agent system is less than the minimum number of leaders for ensuring the controllability of all subsystems. Finally, it is proved that the multi-agent system is controllable over a finite field if the union of the graphs is a directed path graph or a star graph.

This is a preview of subscription content, log in to check access.

References

  1. 1

    Cheng D Z, He F H, Qi H S, et al. Modeling, analysis and control of networked evolutionary games. IEEE Trans Automat Contr, 2015, 60: 2402–2415

  2. 2

    Cheng D Z, Qi H S. Controllability and observability of Boolean control networks. Automatica, 2009, 45: 1659–1667

  3. 3

    Xu X R, Hong Y G. Leader-following consensus of multi-agent systems over finite fields. In: Proceedings of the 53rd IEEE Conference on Decision and Control, California, 2014. 2999–3004

  4. 4

    Pasqualetti F, Borra D, Bullo F. Consensus networks over finite fields. Automatica, 2014, 50: 349–358

  5. 5

    Zhao Y, Cheng D Z. On controllability and stabilizability of probabilistic Boolean control networks. Sci China Inf Sci, 2014, 57: 012202

  6. 6

    Wang L, Xiao F. Finite-time consensus problems for networks of dynamic agents. IEEE Trans Automat Contr, 2010, 55: 950–955

  7. 7

    Jing G S, Zheng Y S, Wang L. Consensus of multiagent systems with distance-dependent communication networks. IEEE Trans Neural Netw Learning Syst, 2017, 28: 2712–2726

  8. 8

    Wang L, Shi H, Chu T G, et al. Aggregation of foraging swarms. In: Advances in Artificial Intelligence. Berlin: Springer, 2004. 3339: 766–777

  9. 9

    Zhang Z Q, Hao F, Zhang L, et al. Consensus of linear multi-agent systems via event-triggered control. Int J Control, 2014, 87: 1243–1251

  10. 10

    Duan G, Xiao F, Wang L. Asynchronous periodic edge-event triggered control for double-integrator networks with communication time delays. IEEE Trans Cybern, 2018, 48: 675–688

  11. 11

    Ma J Y, Zheng Y S, Wu B, et al. Equilibrium topology of multi-agent systems with two leaders: a zero-sum game perspective. Automatica, 2016, 73: 200–206

  12. 12

    Wang L, Xiao F. A new approach to consensus problems in discrete-time multiagent systems with time-delays. Sci China Ser F-Inf Sci, 2007, 50: 625–635

  13. 13

    Shang Y, Ye Y. Leader-follower fixed-time group consensus control of multiagent systems under directed topology. Complexity, 2017, 2017: 1–9

  14. 14

    Guan Y Q, Ji Z J, Zhang L, et al. Decentralized stabilizability of multi-agent systems under fixed and switching topologies. Syst Control Lett, 2013, 62: 438–446

  15. 15

    Guan Y Q, Ji Z J, Zhang L, et al. Quadratic stabilisability of multi-agent systems under switching topologies. Int J Control, 2014, 87: 2657–2668

  16. 16

    Tanner H. On the controllability of nearest neighbor interconnections. In: Proceedings of the 43rd IEEE Conference on Decision and Control, Bahamas, 2004. 2467–2472

  17. 17

    Parlangeli G, Notarstefano G. On the reachability and observability of path and cycle graphs. IEEE Trans Automat Contr, 2012, 57: 743–748

  18. 18

    Guan Y Q, Ji Z J, Zhang L, et al. Controllability of multi-agent systems under directed topology. Int J Robust Nonlinear Control, 2017, 27: 4333–4347

  19. 19

    Wang L, Jiang F C, Xie G M, et al. Controllability of multi-agent systems based on agreement protocols (in Chinese). Sci China Ser F-Inf Sci, 2009, 52: 2074–2088

  20. 20

    Xie G M, Wang L. Reachability realization and stabilizability of switched linear discrete-time systems. J Math Anal Appl, 2003, 280: 209–220

  21. 21

    Guan Y Q, Wang L. Structural controllability of multi-agent systems with absolute protocol under fixed and switching topologies. Sci China Inf Sci, 2017, 60: 092203

  22. 22

    Zhao B, Guan Y Q, Wang L. Non-fragility of multi-agent controllability. Sci China Inf Sci, 2018, 61: 052202

  23. 23

    Liu B, Chu T G, Wang L, et al. Controllability of a leader-follower dynamic network with switching topology. IEEE Trans Automat Contr, 2008, 53: 1009–1013

  24. 24

    Liu B, Chu T G, Wang L, et al. Controllability of switching networks of multi-agent systems. Int J Robust Nonlinear Control, 2012, 22: 630–644

  25. 25

    Lu Z H, Zhang L, Wang L. Observability of multi-agent systems with switching topology. IEEE Trans Circuits Syst II, 2017, 64: 1317–1321

  26. 26

    Sundaram S, Hadjicostis C N. Distributed function calculation via linear iterative strategies in the presence of malicious agents. IEEE Trans Automat Contr, 2011, 56: 1495–1508

  27. 27

    Sundaram S, Hadjicostis C N. Structural controllability and observability of linear systems over finite fields with applications to multi-agent systems. IEEE Trans Automat Contr, 2013, 58: 60–73

  28. 28

    Shang Y. Subspace confinement for switched linear systems. Forum Mathematicum, 2017, 29: 693–699

  29. 29

    Lu Z H, Zhang L, Wang L. Structural controllability of multi-agent systems with general linear dynamics over finite fields. In: Proceedings of the 35th Chinese Control Conference, Chengdu, 2016. 8230–8235

  30. 30

    Lidl R, Niederreiter H. Finite Fields. Cambridge: Cambridge University Press, 1996

  31. 31

    Masuda N, Klemm K, Eguíluz V M. Temporal networks: slowing down diffusion by long lasting interactions. Phys Rev Lett, 2013, 111: 188701

  32. 32

    Lou Y C, Hong Y G. Controllability analysis of multi-agent systems with directed and weighted interconnection. Int J Control, 2012, 85: 1486–1496

  33. 33

    Blahut R. Algebraic Codes for Data Transmission. Cambridge: Cambridge University Press, 2003

  34. 34

    Singla P. On representations of general linear groups over principal ideal local rings of length two. J Algebra, 2010, 324: 2543–2563

  35. 35

    Reger J. Linear systems over finite fields-modeling, analysis and synthesis. Automatisierungstechnik, 2005, 53: 45

  36. 36

    Horn R, Johnson C. Matrix Analysis. Cambridge: Cambridge University Press, 1985

Download references

Acknowledgements

This work was supported by National Natural Science Foundation of China (Grant Nos. 61375120, 61533001, 61374199).

Author information

Correspondence to Long Wang.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Lu, Z., Zhang, L. & Wang, L. Controllability analysis of multi-agent systems with switching topology over finite fields. Sci. China Inf. Sci. 62, 12201 (2019). https://doi.org/10.1007/s11432-017-9284-4

Download citation

Keywords

  • multi-agent systems
  • leader-follower structure
  • controllability
  • finite fields
  • switching topology