Impulsive Control of Dynamical Networks

Dynamical networks (DNs) consist of a large set of interconnected nodes with each node being a fundamental unit with detailed contents. A great number of natural and man-made networks such as social networks, food networks, neural networks, WorldWideWeb, electrical power grid, etc., can be effectively modeled by DNs. The main focus of the present thesis is on delay-dependent impulsive control of DNs. To study the impulsive control problem of DNs, we firstly construct stability results for general nonlinear time-delay systems with delayed impulses by using the method of Lyapunov functionals and Razumikhin technique. Secondly, we study the consensus problem of multi-agent systems with both fixed and switching topologies. A hybrid consensus protocol is proposed to take into consideration of continuous-time communications among agents and delayed instant information exchanges on a sequence of discrete times. Then, a novel hybrid consensus protocol with dynamically changing interaction topologies is designed to take the time-delay into account in both the continuous-time communication among agents and the instant information exchange at discrete moments. We also study the consensus problem of networked multi-agent systems. Distributed delays are considered in both the agent dynamics and the proposed impulsive consensus protocols. Lastly, stabilization and synchronization problems of DNs under pinning impulsive control are studied. A pinning algorithm is incorporated with the impulsive control method. We propose a delay-dependent pinning impulsive controller to investigate the synchronization of linear delay-free DNs on time scales. Then, we apply the pinning impulsive controller proposed for the delay-free networks to stabilize time-delay DNs. Results show that the delay-dependent pinning impulsive controller can successfully stabilize and synchronize DNs with/without time-delay. Moreover, we design a type of pinning impulsive controllers that relies only on the network states at history moments (not on the states at each impulsive instant). Sufficient conditions on stabilization of time-delay networks are obtained, and results show that the proposed pinning impulsive controller can effectively stabilize the network even though only time-delay states are available to the pinning controller at each impulsive instant. We further consider the pinning impulsive controllers with both discrete and distributed time-delay effects to synchronize the drive and response systems modeled by globally Lipschitz time-delay systems. As an extension study of pinning impulsive control approach, we investigate the synchronization problem of systems and networks governed by PDEs

A new framework for consensus for discrete-time directed networks of multi-agents with distributed delays

Copyright @ 2012 Taylor & FrancisIn this article, the distributed consensus problem is considered for discrete-time delayed networks of dynamic agents with fixed topologies, where the networks under investigation are directed and the time-delays involved are distributed time delays including a single or multiple time delay(s) as special cases. By using the invariance principle of delay difference systems, a new unified framework is established to deal with the consensus for the discrete-time delayed multi-agent system. It is shown that the addressed discrete-time network with arbitrary distributed time delays reaches consensus provided that it is strongly connected. A numerical example is presented to illustrate the proposed methods.This work was supported in part by City University of Hong Kong under Grant 7008114, the Royal Society of the UK, the National Natural Science Foundation of China under Grants 60774073 and 61074129, and the Natural Science Foundation of Jiangsu Province of China under Grant BK2010313

Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Average Consensus in the Presence of Delays and Dynamically Changing Directed Graph Topologies

Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions are not necessarily valid in practical settings due to varying delays that might affect transmissions at different times, as well as possible changes in the underlying interconnection topology (e.g., due to component mobility). In this work, we propose protocols to overcome these limitations. We first consider a fixed interconnection topology (captured by a - possibly directed - graph) and propose a discrete-time protocol that can reach asymptotic average consensus in a distributed fashion, despite the presence of arbitrary (but bounded) delays in the communication links. The protocol requires that each component has knowledge of the number of its outgoing links (i.e., the number of components to which it sends information). We subsequently extend the protocol to also handle changes in the underlying interconnection topology and describe a variety of rather loose conditions under which the modified protocol allows the components to reach asymptotic average consensus. The proposed algorithms are illustrated via examples.Comment: 37 page