No abstract

This paper develops a distributed adaptive event-triggered iterative learning controller over a filtering network for a class of tracking control systems. The proposed distributed control method is more robust than centralized control in terms of node failure and transmission constraints. In view of the limited network bandwidth, adaptive event-triggered mechanisms (AETMs) have been considered in the network communication process. The proposed AETM is characterized by introducing the dynamic threshold parameter, which provides benefits in data scheduling. The existence of filters and controllers is analyzed by Lyapunov stability theory and linear matrix inequality techniques, and their parameters are finally obtained. Moreover, some simulation results on a numerical example and a irrigation canal are presented to show the applicability of the obtained results.

No abstract

This paper is concerned with the distributed full- and reduced-order l 2 - l ∞ state estimation issue for a class of discrete time-invariant systems subjected to both randomly occurring switching topologies and deception attacks over wireless sensor networks. Firstly, a switching topology model is proposed which uses homogeneous Markov chain to reflect the change of filtering networks communication modes. Then, the sector-bound deception attacks among the communication channels are taken into consideration, which could better characterize the filtering network communication security. Additionally, a random variable obeying the Bernoulli distribution is used to describe the phenomenon of the randomly occurring deception attacks. Furthermore, through an adjustable parameter E, we can obtain full- and reduced-order l 2 - l ∞ state estimator over sensor networks, respectively. Sufficient conditions are established for the solvability of the addressed switching topology-dependent distributed filtering design in terms of certain convex optimization problem. The purpose of solving the problem is to design a distributed full- and reduced-order filter such that, in the presence of deception attacks, stochastic external interference and switching topologies, the resulting filtering dynamic system is exponentially mean-square stable with prescribed l 2 - l ∞ performance index. Finally, a simulation example is provided to show the effectiveness and flexibility of the designed approach.

No abstract

This article deals with the distributed filtering problem for a class of discrete-time Markov jump systems over sensor networks. First, in the distributed filtering network, each local filter simultaneously fuses the estimation and measurement from itself and neighboring nodes to achieve the system state estimation. And each sensor intelligent node is embedded with an event-triggered sampling mechanism, which can reduce the computation load or saving limited network bandwidth. Then, we use Bernoulli stochastic variables to describe whether the filtering network can successfully receive the system jump modes. Next, based on the Lyapunov stability theory, we design a distributed filter dependent on partial system modes, which has the exponential stability in mean square and [Formula: see text] performance. Finally, all desired estimator parameters can be obtained by solving a set of linear matrix inequalities. Moreover, two numerical examples are given to illustrate the effectiveness of the distributed [Formula: see text] filtering design approach.

This paper aims at exploring the theoretical research and distributed filtering design of state estimation for sensor networked systems with quantized measurement and switching topologies. In a sensor network, each sensor node has an independent static logarithmic quantizer function, and the quantized measurement is transmitted to the filtering network via the wireless network. In the corresponding filtering network, each local estimator achieves distributed consistent state estimation of the plant based on the local measurement and the neighboring shared information. In particular, the design of the distributed filter fully takes into account the fact that the communication links between the nodes are not fixed. That is, the communication topology has random switching, and such random switching behavior is described using Markov chains with partially unknown transition probabilities. A set of linear matrix inequalities gives the sufficient conditions for the existence of the distributed filter, while ensuring that the filter error system has the desired H∞ performance. Finally, two numerical simulations show the effectiveness of the design method.

No abstract