Pinning dynamic systems of networks with Markovian switching couplings and controller-node set

In this paper, we study pinning control problem of coupled dynamical systems with stochastically switching couplings and stochastically selected controller-node set. Here, the coupling matrices and the controller-node sets change with time, induced by a continuous-time Markovian chain. By constructing Lyapunov functions, we establish tractable sufficient conditions for exponentially stability of the coupled system. Two scenarios are considered here. First, we prove that if each subsystem in the switching system, i.e. with the fixed coupling, can be stabilized by the fixed pinning controller-node set, and in addition, the Markovian switching is sufficiently slow, then the time-varying dynamical system is stabilized. Second, in particular, for the problem of spatial pinning control of network with mobile agents, we conclude that if the system with the average coupling and pinning gains can be stabilized and the switching is sufficiently fast, the time-varying system is stabilized. Two numerical examples are provided to demonstrate the validity of these theoretical results, including a switching dynamical system between several stable sub-systems, and a dynamical system with mobile nodes and spatial pinning control towards the nodes when these nodes are being in a pre-designed region.Comment: 9 pages; 3 figure

Almost sure consensus for multi-agent systems with two level switching

In most literatures on the consensus of multi-agent systems (MASs), the agents considered are time-invariant. However in many cases, for example in airplane formation, the agents have switching dynamics and the connections between them are also changing. This is called two-level switching in this paper. We study almost sure (AS) consensus for a class of two-level switching systems. At the low level of agent dynamics, switching is determin- istic and controllable. The upper level topology switching is random and follows a Markov chain. The transition probability of the Markov chain is not fixed, but varies when low level dynamics changes. For this class of MASs, a sufficient condition for AS consensus is developed in this paper

Robust Performance Analysis for Time-Varying Multi-Agent Systems with Stochastic Packet Loss

Recently, a scalable approach to system analysis and controller synthesis for homogeneous multi-agent systems with Bernoulli distributed packet loss has been proposed. As a key result of that line of work, it was shown how to obtain upper bounds on the $H_2$-norm that are robust with respect to uncertain interconnection topologies. The main contribution of the current paper is to show that the same upper bounds hold not only for uncertain but also time-varying topologies that are superimposed with the stochastic packet loss. Because the results are formulated in terms of linear matrix inequalities that are independent of the number of agents, multi-agent systems of any size can be analysed efficiently. The applicability of the approach is demonstrated on a numerical first-order consensus example, on which the obtained upper bounds are compared to estimates from Monte-Carlo simulations.Comment: 8 pages, 4 figures. Extended version of a paper to be published at IFAC World Congress 202