Robust weighted H∞ filtering for networked systems with intermittent measurements of multiple sensors

2010 ◽  
Vol 25 (4) ◽  
pp. 313-330 ◽  
Author(s):  
Hui Zhang ◽  
Yang Shi ◽  
Aryan Saadat Mehr
2020 ◽  
Author(s):  
Babak Tavassoli ◽  
Parisa Joshaghani

Kalman filtering of measurement data from multiple sensors with time-varying delays and missing measurements is considered in this work. Two existing approaches to Kalman filtering with delays are extended by removing some assumptions in order to have equivalent filtering methods and making comparisons between them. The computational loads of the two methods are compared in terms of the average number of floating point operations required by each method for different system dimensionalities and delay upper bounds. The results show that the superiority of the methods over each other depends on the comparison conditions.


2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Bu Xuhui ◽  
Zhang Hongwei ◽  
Song YunZhong ◽  
Yu Fashan

AnH∞iterative learning controller is designed for networked systems with intermittent measurements and iteration-varying disturbances. By modeling the measurement dropout as a stochastic variable satisfying the Bernoulli random binary distribution, the design can be transformed intoH∞control of a 2D stochastic system described by Roesser model. A sufficient condition for mean-square asymptotic stability andH∞disturbance attenuation performance for such 2D stochastic system is established by means of linear matrix inequality (LMI) technique, and formulas can be given for the control law design simultaneously. A numerical example is given to illustrate the effectiveness of the proposed results.


2020 ◽  
Author(s):  
Babak Tavassoli ◽  
Parisa Joshaghani

Kalman filtering of measurement data from multiple sensors with time-varying delays and missing measurements is considered in this work. Two existing approaches to Kalman filtering with delays are extended by removing some assumptions in order to have equivalent filtering methods and making comparisons between them. The computational loads of the two methods are compared in terms of the average number of floating point operations required by each method for different system dimensionalities and delay upper bounds. The results show that the superiority of the methods over each other depends on the comparison conditions.


2015 ◽  
Vol 135 (12) ◽  
pp. 749-755
Author(s):  
Taiyo Matsumura ◽  
Ippei Kamihira ◽  
Katsuma Ito ◽  
Takashi Ono

Sign in / Sign up

Export Citation Format

Share Document