Time-and event-driven communication process for networked control systems: A survey

Copyright © 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

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

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