Analysis and Design of Adaptive Synchronization of a Complex Dynamical Network with Time-Delayed Nodes and Coupling Delays

This paper is devoted to the study of synchronization problems in uncertain dynamical networks with time-delayed nodes and coupling delays. First, a complex dynamical network model with time-delayed nodes and coupling delays is given. Second, for a complex dynamical network with known or unknown but bounded nonlinear couplings, an adaptive controller is designed, which can ensure that the state of a dynamical network asymptotically synchronizes at the individual node state locally or globally in an arbitrary specified network. Then, the Lyapunov-Krasovskii stability theory is employed to estimate the network coupling parameters. The main results provide sufficient conditions for synchronization under local or global circumstances, respectively. Finally, two typical examples are given, using the M-G system as the nodes of the ring dynamical network and second-order nodes in the dynamical network with time-varying communication delays and switching communication topologies, which illustrate the effectiveness of the proposed controller design methods

Exponential Synchronization of Complex Delayed Dynamical Networks With Switching Topology

This paper studies the local and global exponential synchronization of a complex dynamical network with switching topology and time-varying coupling delays. By using stability theory of switched systems and the network topology, the synchronization of such a network under some special switching signals is investigated. Firstly, under the assumption that all subnetworks are self-synchronizing, a delay-dependent sufficient condition is given in terms of linear matrix inequalities, which guarantees the solvability of the local synchronization problem under an average dwell time scheme. Then this result is extended to the situation that not all subnetworks are self-synchronizing. For the latter case, in addition to average dwell time, an extra condition on the ratio of the total activation time of self-synchronizing and nonsynchronizing subnetworks is needed to achieve synchronization of the entire switched network. The global synchronization of a network whose isolate dynamics is of a particular form is also studied. Three different examples of delayed dynamical networks with switching topology are given, which demonstrate the effectiveness of obtained results. © 2006 IEEE.published_or_final_versio

Distributed Decision Through Self-Synchronizing Sensor Networks in the Presence of Propagation Delays and Asymmetric Channels

In this paper we propose and analyze a distributed algorithm for achieving globally optimal decisions, either estimation or detection, through a self-synchronization mechanism among linearly coupled integrators initialized with local measurements. We model the interaction among the nodes as a directed graph with weights (possibly) dependent on the radio channels and we pose special attention to the effect of the propagation delay occurring in the exchange of data among sensors, as a function of the network geometry. We derive necessary and sufficient conditions for the proposed system to reach a consensus on globally optimal decision statistics. One of the major results proved in this work is that a consensus is reached with exponential convergence speed for any bounded delay condition if and only if the directed graph is quasi-strongly connected. We provide a closed form expression for the global consensus, showing that the effect of delays is, in general, the introduction of a bias in the final decision. Finally, we exploit our closed form expression to devise a double-step consensus mechanism able to provide an unbiased estimate with minimum extra complexity, without the need to know or estimate the channel parameters.Comment: To be published on IEEE Transactions on Signal Processin

Bounded synchronization of a heterogeneous complex switched network

This paper investigates synchronization issues of a heterogeneous complex network with a general switching topology in the sense of boundedness, when no complete synchronization manifold exists. Several sufficient conditions are established with the Lyapunov method and the differential analysis of convergence to determine the existence and estimate the convergence domain for the local and global bounded synchronization of a heterogeneous complex network. By using the consensus convergence of a switched linear system associated with the switching topology, explicit bounds of the maximum deviation between nodes are obtained in the form of a scalar inequality involving the property of the consensus convergence, the homogeneous and heterogeneous dynamics of individual nodes for the local and global cases. These analytical results are simple yet generic, which can be used to explore synchronization issues of various complex networks. Finally, a numerical simulation illustrates their effectiveness.postprin

Consensus problems in networks of agents with switching topology and time-delays

In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results

Synchronisation of linear continuous multi-agent systems with switching topology and communication delay

A distributed dynamic output feedback control is designed by Scardovi and Sepulchre for the synchronization of a network of identical linear systems, known as agents in literature. The design is based on some mild conditions allowing switching topology. But it assumes that there is no time delay in signal transfer between the neighbouring agents. In this paper we extend their work to include known time delay in communications. Furthermore, our design has some special features: (a) the delay can be arbitrary and only need to be uniformly bounded by a constant, (b) the conditions that time delay should be the same and sufficiently small in some literature are not required here, and (c) no local buffer is required to store past data due to time-delay effect

Event-triggered pinning control of switching networks

This paper investigates event-triggered pinning control for the synchronization of complex networks of nonlinear dynamical systems. We consider networks described by time-varying weighted graphs and featuring generic linear interaction protocols. Sufficient conditions for the absence of Zeno behavior are derived and exponential convergence of a global normed error function is proven. Static networks are considered as a special case, wherein the existence of a lower bound for interevent times is also proven. Numerical examples demonstrate the effectiveness of the proposed control strategy