Local pinning of networks of multi-agent systems with transmission and pinning delays

We study the stability of networks of multi-agent systems with local pinning strategies and two types of time delays, namely the transmission delay in the network and the pinning delay of the controllers. Sufficient conditions for stability are derived under specific scenarios by computing or estimating the dominant eigenvalue of the characteristic equation. In addition, controlling the network by pinning a single node is studied. Moreover, perturbation methods are employed to derive conditions in the limit of small and large pinning strengths.Numerical algorithms are proposed to verify stability, and simulation examples are presented to confirm the efficiency of analytic results.Comment: 6 pages, 3 figure

Control of coupled oscillator networks with application to microgrid technologies

The control of complex systems and network-coupled dynamical systems is a topic of vital theoretical importance in mathematics and physics with a wide range of applications in engineering and various other sciences. Motivated by recent research into smart grid technologies we study here control of synchronization and consider the important case of networks of coupled phase oscillators with nonlinear interactions--a paradigmatic example that has guided our understanding of self-organization for decades. We develop a method for control based on identifying and stabilizing problematic oscillators, resulting in a stable spectrum of eigenvalues, and in turn a linearly stable synchronized state. Interestingly, the amount of control, i.e., number of oscillators, required to stabilize the network is primarily dictated by the coupling strength, dynamical heterogeneity, and mean degree of the network, and depends little on the structural heterogeneity of the network itself

Consensus analysis of multiagent networks via aggregated and pinning approaches

This is the post-print version of of the Article - Copyright @ 2011 IEEEIn this paper, the consensus problem of multiagent nonlinear directed networks (MNDNs) is discussed in the case that a MNDN does not have a spanning tree to reach the consensus of all nodes. By using the Lie algebra theory, a linear node-and-node pinning method is proposed to achieve a consensus of a MNDN for all nonlinear functions satisfying a given set of conditions. Based on some optimal algorithms, large-size networks are aggregated to small-size ones. Then, by applying the principle minor theory to the small-size networks, a sufficient condition is given to reduce the number of controlled nodes. Finally, simulation results are given to illustrate the effectiveness of the developed criteria.This work was jointly supported by CityU under a research grant (7002355) and GRF funding (CityU 101109)

Impulsive mean square exponential synchronization of stochastic dynamical networks with hybrid time-varying delays

This paper investigates the mean square exponential synchronization problem for complex dynamical networks with stochastic disturbances and hybrid time-varying delays, both internal delay and coupling delay are considered in the model. At the same time, the coupled time-delay is also probabilistic in two time interval. Impulsive control method is applied to force all nodes synchronize to a chaotic orbit, and impulsive input delay is also taken into account. Based on the theory of stochastic differential equation, an impulsive differential inequality and some analysis techniques, several simple and useful criteria are derived to ensure mean square exponential synchronization of the stochastic dynamical networks. Furthermore, pinning impulsive strategy is studied. An effective method is introduced to select the controlled nodes at each impulsive constants. Numerical simulations are exploited to demonstrate the effectiveness of the theory results in this paper

Adaptive Synchronization of Complex Dynamical Networks with State Predictor

This paper addresses the adaptive synchronization of complex dynamical networks with nonlinear dynamics. Based on the Lyapunov method, it is shown that the network can synchronize to the synchronous state by introducing local adaptive strategy to the coupling strengths. Moreover, it is also proved that the convergence speed of complex dynamical networks can be increased via designing a state predictor. Finally, some numerical simulations are worked out to illustrate the analytical results

Partial containment control over signed graphs

In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals. In this scenario, we study the problem of selecting the nodes where control signals have to be injected to maximize the number of contained nodes. Leveraging graph condensations, we find a suboptimal and computationally efficient solution to this problem, which can be implemented by solving an integer linear problem. The effectiveness of the selection strategy is illustrated through representative simulations.Comment: 6 pages, 3 figures, accepted for presentation at the 2019 European Control Conference (ECC19), Naples, Ital