643 research outputs found

    Robust synchronization of a class of coupled delayed networks with multiple stochastic disturbances: The continuous-time case

    Get PDF
    In this paper, the robust synchronization problem is investigated for a new class of continuous-time complex networks that involve parameter uncertainties, time-varying delays, constant and delayed couplings, as well as multiple stochastic disturbances. The norm-bounded uncertainties exist in all the network parameters after decoupling, and the stochastic disturbances are assumed to be Brownian motions that act on the constant coupling term, the delayed coupling term as well as the overall network dynamics. Such multiple stochastic disturbances could reflect more realistic dynamical behaviors of the coupled complex network presented within a noisy environment. By using a combination of the Lyapunov functional method, the robust analysis tool, the stochastic analysis techniques and the properties of Kronecker product, we derive several delay-dependent sufficient conditions that ensure the coupled complex network to be globally robustly synchronized in the mean square for all admissible parameter uncertainties. The criteria obtained in this paper are in the form of linear matrix inequalities (LMIs) whose solution can be easily calculated by using the standard numerical software. The main results are shown to be general enough to cover many existing ones reported in the literature. Simulation examples are presented to demonstrate the feasibility and applicability of the proposed results

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

    Get PDF
    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

    H-infinity state estimation for discrete-time complex networks with randomly occurring sensor saturations and randomly varying sensor delays

    Get PDF
    This is the post-print of the Article. The official published version can be accessed from the link below - Copyright @ 2012 IEEEIn this paper, the state estimation problem is investigated for a class of discrete time-delay nonlinear complex networks with randomly occurring phenomena from sensor measurements. The randomly occurring phenomena include randomly occurring sensor saturations (ROSSs) and randomly varying sensor delays (RVSDs) that result typically from networked environments. A novel sensor model is proposed to describe the ROSSs and the RVSDs within a unified framework via two sets of Bernoulli-distributed white sequences with known conditional probabilities. Rather than employing the commonly used Lipschitz-type function, a more general sector-like nonlinear function is used to describe the nonlinearities existing in the network. The purpose of the addressed problem is to design a state estimator to estimate the network states through available output measurements such that, for all probabilistic sensor saturations and sensor delays, the dynamics of the estimation error is guaranteed to be exponentially mean-square stable and the effect from the exogenous disturbances to the estimation accuracy is attenuated at a given level by means of an HinftyH_{infty}-norm. In terms of a novel Lyapunov–Krasovskii functional and the Kronecker product, sufficient conditions are established under which the addressed state estimation problem is recast as solving a convex optimization problem via the semidefinite programming method. A simulation example is provided to show the usefulness of the proposed state estimation conditions.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the U.K. under Grant GR/S27658/01, the Royal Society of the U.K., the National Natural Science Foundation of China under Grants 61028008, 61134009, 61104125 and 60974030, the Natural Science Foundation of Universities in Anhui Province of China under Grant KJ2011B030, and the Alexander von Humboldt Foundation of Germany

    Amplitude Death: The emergence of stationarity in coupled nonlinear systems

    Full text link
    When nonlinear dynamical systems are coupled, depending on the intrinsic dynamics and the manner in which the coupling is organized, a host of novel phenomena can arise. In this context, an important emergent phenomenon is the complete suppression of oscillations, formally termed amplitude death (AD). Oscillations of the entire system cease as a consequence of the interaction, leading to stationary behavior. The fixed points that the coupling stabilizes can be the otherwise unstable fixed points of the uncoupled system or can correspond to novel stationary points. Such behaviour is of relevance in areas ranging from laser physics to the dynamics of biological systems. In this review we discuss the characteristics of the different coupling strategies and scenarios that lead to AD in a variety of different situations, and draw attention to several open issues and challenging problems for further study.Comment: Physics Reports (2012

    Bounded synchronization of a heterogeneous complex switched network

    Get PDF
    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

    Coordination of multi-agent systems: stability via nonlinear Perron-Frobenius theory and consensus for desynchronization and dynamic estimation.

    Get PDF
    This thesis addresses a variety of problems that arise in the study of complex networks composed by multiple interacting agents, usually called multi-agent systems (MASs). Each agent is modeled as a dynamical system whose dynamics is fully described by a state-space representation. In the first part the focus is on the application to MASs of recent results that deal with the extensions of Perron-Frobenius theory to nonlinear maps. In the shift from the linear to the nonlinear framework, Perron-Frobenius theory considers maps being order-preserving instead of matrices being nonnegative. The main contribution is threefold. First of all, a convergence analysis of the iterative behavior of two novel classes of order-preserving nonlinear maps is carried out, thus establishing sufficient conditions which guarantee convergence toward a fixed point of the map: nonnegative row-stochastic matrices turns out to be a special case. Secondly, these results are applied to MASs, both in discrete and continuous-time: local properties of the agents' dynamics have been identified so that the global interconnected system falls into one of the above mentioned classes, thus guaranteeing its global stability. Lastly, a sufficient condition on the connectivity of the communication network is provided to restrict the set of equilibrium points of the system to the consensus points, thus ensuring the agents to achieve consensus. These results do not rely on standard tools (e.g., Lyapunov theory) and thus they constitute a novel approach to the analysis and control of multi-agent dynamical systems. In the second part the focus is on the design of dynamic estimation algorithms in large networks which enable to solve specific problems. The first problem consists in breaking synchronization in networks of diffusively coupled harmonic oscillators. The design of a local state feedback that achieves desynchronization in connected networks with arbitrary undirected interactions is provided. The proposed control law is obtained via a novel protocol for the distributed estimation of the Fiedler vector of the Laplacian matrix. The second problem consists in the estimation of the number of active agents in networks wherein agents are allowed to join or leave. The adopted strategy consists in the distributed and dynamic estimation of the maximum among numbers locally generated by the active agents and the subsequent inference of the number of the agents that took part in the experiment. Two protocols are proposed and characterized to solve the consensus problem on the time-varying max value. The third problem consists in the average state estimation of a large network of agents where only a few agents' states are accessible to a centralized observer. The proposed strategy projects the dynamics of the original system into a lower dimensional state space, which is useful when dealing with large-scale systems. Necessary and sufficient conditions for the existence of a linear and a sliding mode observers are derived, along with a characterization of their design and convergence properties
    corecore