New conditions for synchronization in dynamical communication networks

This paper investigates synchronization in a typical multi-agent system in which the communication network changes according to the system state. Through building new relationships between a matrix and its associated graph and estimating the diameter of the communication network, we prove that synchronization can be achieved if the speed of agents is bounded by O(n−β)O(n−β), where nn is the number of agents and ββ is bounded by a constant independent of nn, which is much better than the existing bound O(n−n)O(n−n). Some simulations are provided to illustrate the theoretical results.