Synchronizing nonlinear complex networks via switching disconnected topology

Chen, Yao; Yu, Wenwu; Tan, Shaolin; Zhu, Henghui

doi:10.1016/j.automatica.2016.03.033

Cited by 64 publications

(21 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [44], any Lipschitz function is a one-sided Lipschitz function, but the converse is not true. This means that for some nonlinear functions with a big Lipschitz constant, the corresponding one-sided Lipschitz constant matrix Ξ may be a non-positive definite matrix (see the example given in [45]).…”

Section: Resultsmentioning

confidence: 99%

Adaptive Pinning Synchronization of Fractional Complex Networks with Impulses and Reaction–Diffusion Terms

Hai

Ren

et al. 2019

Mathematics

View full text Add to dashboard Cite

In this paper, a class of fractional complex networks with impulses and reaction–diffusion terms is introduced and studied. Meanwhile, a class of more general network structures is considered, which consists of an instant communication topology and a delayed communication topology. Based on the Lyapunov method and linear matrix inequality techniques, some sufficient criteria are obtained, ensuring adaptive pinning synchronization of the network under a designed adaptive control strategy. In addition, a pinning scheme is proposed, which shows that the nodes with delayed communication are good candidates for applying controllers. Finally, a numerical example is given to verify the validity of the main results.

show abstract

Section: Resultsmentioning

confidence: 99%

Adaptive Pinning Synchronization of Fractional Complex Networks with Impulses and Reaction–Diffusion Terms

Hai

Ren

et al. 2019

Mathematics

View full text Add to dashboard Cite

show abstract

“…The distributed consensus of second-order multi-agent systems was also discussed in [41], [42], and higher order consensus protocol for multi-agent systems was further considered in [43]. In addition, the switching communication topologies were taken into account to discuss the consensus problems of multi-agent systems [44], [45].…”

Section: The Vicsek Particle Swarmmentioning

confidence: 99%

Nonlinear Merging Consensus for Multi-Agent Systems on Directed and Weighted Signed Graph

et al. 2020

View full text Add to dashboard Cite

This paper settles the nonlinear merging consensus for multi-agent systems on a directed and weighted signed network. A novel nonlinear merging control protocol is proposed to drive the states of all agents to arrive at the same state. To be consistent with the reality, the interactions among agents can be either cooperative or competitive and the information flow is considered to be directed. Particularly, the protocol can still ensure the states of all agents to reach an agreement, even though the corresponding directed network is not strongly connected. Besides, to guarantee the efficiency of multi-agent systems, the convergence rate of agents can be sped up by adjusting the parameter of the protocol. Finally, the theoretical analysis and simulation results are provided to verify the effectiveness of this protocol. The current results are instructive for us to comprehend and design an efficient consensus protocol within multi-agent systems. INDEX TERMS Nonlinear merging consensus, multi-agent systems, signed graph, weighted and directed network.

show abstract

“…They have extensive applications in various fields, such as power engineering and secure communication [1][2][3][4][5][6]. Therein, synchronization, as one of the most important dynamic characteristics of coupled networks, plays a significant role in many fields such as biological systems, chemical reactions, and information technology [7][8][9][10][11][12][13][14]. As is well known, when coupled networks are not synchronized by themselves, some controllers are always designed to ensure the synchronization of coupled networks.…”

Section: Introductionmentioning

confidence: 99%

Synchronization of stochastic multiple weighted coupled networks with Markovian switching

2020

View full text Add to dashboard Cite

We investigate the synchronization of stochastic multiple weighted coupled networks with Markovian switching (SMWCNMS). By designing an appropriate controller, we obtain several sufficient criteria ensuring the pth moment exponential synchronization and almost surely exponential synchronization for SMWCNMS based on graph theory. Moreover, we also investigate the pth moment asymptotical synchronization and almost surely asymptotical synchronization for SMWCNMS. Finally, we provide a numerical example to illustrate the availability of the proposed synchronization criteria.

show abstract

Synchronizing nonlinear complex networks via switching disconnected topology

Cited by 64 publications

References 20 publications

Adaptive Pinning Synchronization of Fractional Complex Networks with Impulses and Reaction–Diffusion Terms

Adaptive Pinning Synchronization of Fractional Complex Networks with Impulses and Reaction–Diffusion Terms

Nonlinear Merging Consensus for Multi-Agent Systems on Directed and Weighted Signed Graph

Synchronization of stochastic multiple weighted coupled networks with Markovian switching

Contact Info

Product

Resources

About