Distributed Robust Filtering over Sensor Networks with Quantized Measurement and Switching Topologies

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.

Probabilistic solutions to DAEs learning from physical data

The nonlinear chaotic differential/algebraic equation (DAE) has been established to simulate the nonuniform oscillations of the motion of a falling sphere in the non-Newtonian fluid. The DAE is obtained only by learning the experimental data with sparse optimization method. However, the deterministic solution will become increasingly inaccurate for long time approximation of the continuous system. In this paper, we introduce two probabilistic solutions to compute the totally DAE, the Random branch selection iteration (RBSI) and Random switching iteration (RSI). The samples are also taken as the reference trajectory to learn random parameter. The proposed probabilistic solutions can be regarded as the discrete analogues of differential inclusion and switching DAEs, respectively. They have been also compared with the deterministic method, i.e. backward differentiation formula (BDF). The deterministic methods only give limited candidates of all the probability solutions, while the RSI can include all the possible trajectories. The numerical results and statistical information criterion show that RSI can successfully reveal the sustaining instabilities of the motion itself and long time chaotic behavior.

The consensus of non-linear agents under switching topology using dynamic inversion in the presence of communication noise and delay

In this study, a consensus protocol for non-linear multi-agent systems using the non-linear dynamic inversion (NDI) technique is presented. It is named as distributed NDI or DNDI. The agents are considered to be working in a randomly changing environment which is realistic. The randomness in the operating environment is introduced by random switching communication topology, delays, and noise. The consensus protocol is obtained as a closed-form expression, which is a critical requirement for real-time implementation. Also, various cases regarding the communication issues have been considered to study the performance of the DNDI controller. The simulation results are found to be satisfactory.

A $$2~{\times }~2$$ random switching model and its dual risk model

In this article, a special case of two coupled M/G/1-queues is considered, where two servers are exposed to two types of jobs that are distributed among the servers via a random switch. In this model, the asymptotic behavior of the workload buffer exceedance probabilities for the two single servers/both servers together/one (unspecified) server is determined. Hereby, one has to distinguish between jobs that are either heavy-tailed or light-tailed. The results are derived via the dual risk model of the studied coupled M/G/1-queues for which the asymptotic behavior of different ruin probabilities is determined.