Fusion estimation for multi-rate linear repetitive processes under weighted try-once-discard protocol

被引:112
作者
Shen, Yuxuan [1 ,5 ]
Wang, Zidong [2 ]
Shen, Bo [1 ,5 ]
Alsaadi, Fawaz E. [3 ]
Alsaadi, Fuad E. [4 ]
机构
[1] Donghua Univ, Coll Informat Sci & Technol, Shanghai 200051, Peoples R China
[2] Brunel Univ London, Dept Comp Sci, Uxbridge UB8 3PH, Middx, England
[3] King Abdulaziz Univ, Fac Comp & Informat Technol, Dept Informat Technol, Jeddah 21589, Saudi Arabia
[4] King Abdulaziz Univ, Fac Engn, Dept Elect & Comp Engn, Jeddah 21589, Saudi Arabia
[5] Minist Educ, Engn Res Ctr Digitalized Text & Fash Technol, Shanghai 201620, Peoples R China
基金
上海市自然科学基金; 中国国家自然科学基金;
关键词
Fusion estimation; Linear repetitive processes; Multi-rate sampling; Weighted try-once-discard protocol; Sequential covariance intersection fusion; COMMUNICATION PROTOCOLS; NONLINEAR-SYSTEMS; KALMAN FILTER; STATE; FAULT; SATURATIONS;
D O I
10.1016/j.inffus.2019.08.013
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, the fusion estimation problem is studied for a class of discrete time-varying multi-rate linear repetitive processes (LRPs) under weighted try-once-discard protocol. The LRPs are measured by multiple sensors that are allowed to have different sampling periods, and the state updating period of the LRPs is also allowed to be different from the sampling periods of the asynchronous sensors. To facilitate the estimator design, the lifting technique is applied to transform the multi-rate LRPs to single-rate ones. Moreover, due to limited communication capability, the weighted try-once-discard protocol is adopted to schedule the asynchronous sensors. A set of local estimators is designed such that the upper bounds on the local estimation error covariances are guaranteed, and such upper bounds are then minimized by appropriately designing the estimator gains. Furthermore, the estimates from the local estimators are fused by recurring to the sequential covariance intersection fusion method. Finally, a simulation example is given to demonstrate the effectiveness of the proposed fusion estimation scheme.
引用
收藏
页码:281 / 291
页数:11
相关论文
共 48 条
[1]   Two-Dimensional Peak-to-Peak Filtering for Stochastic Fornasini-Marchesini Systems [J].
Ahn, Choon Ki ;
Shi, Peng ;
Basin, Michael V. .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2018, 63 (05) :1472-1479
[2]   Reliable Data Fusion of Hierarchical Wireless Sensor Networks With Asynchronous Measurement for Greenhouse Monitoring [J].
Bai, Xingzhen ;
Wang, Zidong ;
Sheng, Li ;
Wang, Zhen .
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2019, 27 (03) :1036-1046
[3]   Detecting Prosumer-Community Groups in Smart Grids From the Multiagent Perspective [J].
Cao, Jie ;
Bu, Zhan ;
Wang, Yuyao ;
Yang, Huan ;
Jiang, Jiuchuan ;
Li, Hui-Jia .
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2019, 49 (08) :1652-1664
[4]   Similarity based leaf image retrieval using multiscale R-angle description [J].
Cao, Jie ;
Wang, Bin ;
Brown, Douglas .
INFORMATION SCIENCES, 2016, 374 :51-64
[5]   Scaling up cosine interesting pattern discovery: A depth-first method [J].
Cao, Jie ;
Wu, Zhiang ;
Wu, Junjie .
INFORMATION SCIENCES, 2014, 266 :31-46
[6]   SAIL: Summation-bAsed Incremental Learning for Information-Theoretic Text Clustering [J].
Cao, Jie ;
Wu, Zhiang ;
Wu, Junjie ;
Xiong, Hui .
IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (02) :570-584
[7]   Iterative learning Kalman filter for repetitive processes [J].
Cao, Zhixing ;
Lu, Jingyi ;
Zhang, Ridong ;
Gao, Furong .
JOURNAL OF PROCESS CONTROL, 2016, 46 :92-104
[8]   Discrete-Time Robust Iterative Learning Kalman Filtering for Repetitive Processes [J].
Cao, Zhixing ;
Zhang, Ridong ;
Yang, Yi ;
Lu, Jingyi ;
Gao, Furong .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2016, 61 (01) :270-275
[9]  
Cervigni R, 2013, WOR BANK STUD, P121
[10]   Regional Stabilization for Discrete Time-Delay Systems With Actuator Saturations via A Delay-Dependent Polytopic Approach [J].
Chen, Yonggang ;
Wang, Zidong ;
Fei, Shumin ;
Han, Qing-Long .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (03) :1257-1264