TY - JOUR
T1 - Probability-Guaranteed Distributed Filtering for Nonlinear Systems With Innovation Constraints Over Sensor Networks
AU - Ma, Lifeng
AU - Wang, Zidong
AU - Chen, Yun
AU - Yi, Xiaojian
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/6/1
Y1 - 2021/6/1
N2 - In this article, the distributed filtering problem is investigated for a class of nonlinear systems. Each individual sensing node provides the state estimate by using not only its own measurements but also its neighbors' information propagated according to the communication topology. With the purpose of mitigating the effects from possible abnormal data during the signal transmission, an innovation constraint with adaptively determined threshold is imposed on the transmitted innovation during the filter process. The aim of the addressed problem is to design a distributed filtering algorithm, which is capable of confining all the estimation errors within certain ellipsoidal regions with prescribed probability and achieving the required average disturbance attenuation specification. By virtue of a convex optimization method, sufficient conditions are derived for the existence of the requested filtering algorithm, and the desired filtering parameters are then obtained by iteratively solving the corresponding matrix inequalities. Within the established framework, two optimization problems are put forward to seek locally optimal filtering parameters. Finally, an illustrative numerical example is provided to demonstrate the applicability of the proposed filtering paradigm.
AB - In this article, the distributed filtering problem is investigated for a class of nonlinear systems. Each individual sensing node provides the state estimate by using not only its own measurements but also its neighbors' information propagated according to the communication topology. With the purpose of mitigating the effects from possible abnormal data during the signal transmission, an innovation constraint with adaptively determined threshold is imposed on the transmitted innovation during the filter process. The aim of the addressed problem is to design a distributed filtering algorithm, which is capable of confining all the estimation errors within certain ellipsoidal regions with prescribed probability and achieving the required average disturbance attenuation specification. By virtue of a convex optimization method, sufficient conditions are derived for the existence of the requested filtering algorithm, and the desired filtering parameters are then obtained by iteratively solving the corresponding matrix inequalities. Within the established framework, two optimization problems are put forward to seek locally optimal filtering parameters. Finally, an illustrative numerical example is provided to demonstrate the applicability of the proposed filtering paradigm.
KW - Distributed filtering
KW - innovation constraints
KW - probability-guaranteed filtering
KW - set-membership filtering
UR - http://www.scopus.com/inward/record.url?scp=85099203389&partnerID=8YFLogxK
U2 - 10.1109/TCNS.2021.3049361
DO - 10.1109/TCNS.2021.3049361
M3 - Article
AN - SCOPUS:85099203389
SN - 2325-5870
VL - 8
SP - 951
EP - 963
JO - IEEE Transactions on Control of Network Systems
JF - IEEE Transactions on Control of Network Systems
IS - 2
ER -