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

Design and implementation of predictive control for networked multi-process systems

This thesis is concerned with the design and application of the prediction method in the NMAS (networked multi-agent system) external consensus problem. The prediction method has been popular in networked single agent systems due to its capability of actively compensating for network-related constraints. This characteristic has motivated researchers to apply the prediction method to closed-loop multi-process controls over network systems. This thesis conducts an in-depth analysis of the suitability of the prediction method for the control of NMAS. In the external consensus problem, NMAS agents must achieve a common output (e.g. water level) that corresponds to the designed consensus protocol. The output is determined by the external reference input, which is provided to only one agent in the NMAS. This agreement is achieved through data exchanges between agents over network communications. In the presence of a network, the existence of network delay and data loss is inevitable. The main challenge in this thesis is thus to design an external consensus protocol with an efficient capability for network constraints compensation. The main contribution of this thesis is the enhancement of the prediction algorithm’s capability in NMAS applications. The external consensus protocol is presented for heterogeneous NMAS with four types of network constraints by utilising the developed prediction algorithm. The considered network constraints are constant network delay, asymmetric constant network delay, bounded random network delay, and large consecutive data losses. In the first case, this thesis presents the designed algorithm, which is able to compensate for uniform constant network delay in linear heterogeneous NMAS. The result is accompanied by stability criteria of the whole NMAS, an optimal coupling gains selection analysis, and empirical data from the experimental results. ‘Uniform network delay’ in this context refers to a situation in which the agent experiences a delay in accessing its own information, which is identical to the delay in data transfer from its neighbouring agent(s) in the network In the second case, this thesis presents an extension of the designed algorithm in the previous chapter, with the enhanced capability of compensating for asymmetric constant network delay in the NMAS. In contrast with the first case—which required the same prediction length as each neighbouring agent, subject to the same values of constant network delay—this case imposed varied constant network delays between agents, which required multi-prediction lengths for each agent. Thus, to simplify the computation, we selected a single prediction length for all agents and determined the possible maximum value of the constant network delay that existed in the NMAS. We tested the designed control algorithm on three heterogeneous pilotscale test rig setups. In the third case, we present a further enhancement of the designed control algorithm, which includes the capability of compensating for bounded random network delay in the NMAS. We achieve this by adding delay measurement signal generator within each agent control system. In this work, the network delay is considered to be half of the measured total delay in the network loop, which can be measured using a ramp signal. This method assumes that the duration for each agent to receive data from its neighbouring agent is equal to the time for the agent’s own transmitted data to be received by its neighbouring agent(s). In the final case, we propose a novel strategy for combining the predictive control with a new gain error ratio (GER) formula. This strategy is not only capable of compensating for a large number of consecutive data losses (CDLs) in the external consensus problem; it can also compensate for network constraints without affecting the consensus convergence time of the whole system. Thus, this strategy is not only able to solve the external consensus problem but is also robust to the number of CDL occurrences in NMAS. In each case, the designed control algorithm is compared with a Proportional-Integral (PI) controller. The evaluation of the NMAS output performance is conducted for each by simulations, analytical calculations, and practical experiments. In this thesis, the research work is accomplished through the integration of basic blocks and a bespoke Networked Control toolbox in MATLAB Simulink, together with NetController hardware

Distributed filtering of networked dynamic systems with non-gaussian noises over sensor networks: A survey

summary:Sensor networks are regarded as a promising technology in the field of information perception and processing owing to the ease of deployment, cost-effectiveness, flexibility, as well as reliability. The information exchange among sensors inevitably suffers from various network-induced phenomena caused by the limited resource utilization and complex application scenarios, and thus is required to be governed by suitable resource-saving communication mechanisms. It is also noteworthy that noises in system dynamics and sensor measurements are ubiquitous and in general unknown but can be bounded, rather than follow specific Gaussian distributions as assumed in Kalman-type filtering. Particular attention of this paper is paid to a survey of recent advances in distributed filtering of networked dynamic systems with non-Gaussian noises over sensor networks. First, two types of widely employed structures of distributed filters are reviewed, the corresponding analysis is systematically addressed, and some interesting results are provided. The inherent purpose of adding consensus terms into the distributed filters is profoundly disclosed. Then, some representative models characterizing various network-induced phenomena are reviewed and their corresponding analytical strategies are exhibited in detail. Furthermore, recent results on distributed filtering with non-Gaussian noises are sorted out in accordance with different network-induced phenomena and system models. Another emphasis is laid on recent developments of distributed filtering with various communication scheduling, which are summarized based on the inherent characteristics of their dynamic behavior associated with mathematical models. Finally, the state-of-the-art of distributed filtering and challenging issues, ranging from scalability, security to applications, are raised to guide possible future research

Control law and state estimators design for multi-agent system with reduction of communications by event-triggered approach

A large amount of research work has been recently dedicated to the study of Multi-Agent System and cooperative control. Applications to mobile robots, like unmanned air vehicles (UAVs), satellites, or aircraft have been tackled to insure complex mission such as exploration or surveillance. However, cooperative tasking requires communication between agents, and for a large number of agents, the number of communication exchanges may lead to network saturation, increased delays or loss of transferred packets, from the interest in reducing them. In event-triggered strategy, a communication is broadcast when a condition, based on chosen parameters and some threshold, is fulfilled. The main difficulty consists in determining the communication triggering condition (CTC) that will ensure the completion of the task assigned to the MAS. In a distributed strategy, each agent maintains an estimate value of others agents state to replace missing information due to limited communication. This thesis focuses on the development of distributed control laws and estimators for multi-agent system to limit the number of communication by using event-triggered strategy in the presence of perturbation with two main topics, i.e. consensus and formation control. The first part addresses the problem of distributed event-triggered communications for consensus of a multi-agent system with both general linear dynamics and state perturbations. To decrease the amount of required communications, an accurate estimator of the agent states is introduced, coupled with an estimator of the estimation error, and adaptation of communication protocol. By taking into account the control input of the agents, the proposed estimator allows to obtain a consensus with fewer communications than those obtained by a reference method. The second part proposes a strategy to reduce the number of communications for displacement-based formation control while following a desired reference trajectory. Agent dynamics are described by Euler-Lagrange models with perturbations and uncertainties on the model parameters. Several estimator structures are proposed to rebuilt missing information. The proposed distributed communication triggering condition accounts for inter-agent displacements and the relative discrepancy between actual and estimated agent states. A single a priori trajectory has to be evaluated to follow the desired path. Effect of state perturbations on the formation and on the communications are analyzed. Finally, the proposed methods have been adapted to consider packet dropouts and communication delays. For both type

Distributed Optimal Control and Application to Consensus of Multi-Agent Systems

This paper develops a novel approach to the consensus problem of multi-agent systems by minimizing a weighted state error with neighbor agents via linear quadratic (LQ) optimal control theory. Existing consensus control algorithms only utilize the current state of each agent, and the design of distributed controller depends on nonzero eigenvalues of the communication topology. The presented optimal consensus controller is obtained by solving Riccati equations and designing appropriate observers to account for agents' historical state information. It is shown that the corresponding cost function under the proposed controllers is asymptotically optimal. Simulation examples demonstrate the effectiveness of the proposed scheme, and a much faster convergence speed than the conventional consensus methods. Moreover, the new method avoids computing nonzero eigenvalues of the communication topology as in the traditional consensus methods