Synchronization of Colored Networks via Discrete Control

Abstract

We investigate the synchronization problem of two colored networks via discrete control based on the Lyapunov stability theory. First, intermittent control is adopted to synchronize two edge-colored networks, and the sufficient condition connecting the control width, control period and the network topology is established for reaching synchronization. Then, an impulsive controller is designed to ensure two general colored networks in synchronization, and the relation among the impulsive interval, impulsive gain and the network topology for synchronization is also discovered. Finally, two numerical examples are provided to demonstrate and verify the theoretical results.

Stochastic bounded consensus of second-order multi-agent systems in noisy environment

“…In recent years, the consensus of multi-agent systems has attracted much attention, due to its wide applications in many areas such as cooperative control of unmanned aerial vehicles (UAVs), formation control, distributed sensor network, and so on. [1][2][3] As is well known, consensus is the fundamental problem of cooperative control for multi-agent systems, which means that each agent tends to the common value in a team, and the value can be position, velocity, temperature or other physical quantities. Moreover, leader-following consensus problems is very interesting, which is also called tracking control for multi-agent systems.…”

Identifying the interactions in a colored dynamical network

“…Many large-scale physical systems consisting of interactive individuals are usually modelled by complex dynamical networks, in which the nodes denote the individuals and the edges denote the interactions among them. [1][2][3][4][5][6][7][8][9][10] Generally, the interactions are denoted by the outer and inner coupling matrices. The outer coupling matrix denotes the topology and the coupling strength of the network, from which one can know whether a pair of nodes affect each other.…”

“…For better describing this kind of network, namely a colored graph in mathematics, a colored network consisting of colored nodes and colored edges is proposed. [9,10] Two nodes with different colors have different node dynamics, and two edges with different colors denote the two pairs of nodes have different interactions.…”