Recursive state estimation for complex networks with random coupling strength

详细信息    查看全文

• 作者：Wenling Li^a ; ^b ; ^c ; ^{lwlmath@buaa.edu.cn}Author Vitae ; Yingmin Jia^a ; ^b ; ^c ; ^{ymjia@buaa.edu.cn}Author Vitae ; Junping Du^d ; ^{junpingdu@126.com}Author Vitae
• 关键词：State estimation ; Complex networks ; Extended Kalman filter ; Random coupling strength
• 刊名：Neurocomputing
• 出版年：2017
• 出版时间：5 January 2017
• 年：2017
• 卷：219
• 期：Complete
• 页码：1-8
• 全文大小：650 K
• 卷排序：219

文摘

This paper studies the state estimation problem for complex networks with random coupling strength. Unlike the constant coupling strength used in the existing models, the coupling strength is assumed to be chosen from a uniform random distribution with non-negative mean. By employing the structure of the extended Kalman filter (EKF), a recursive state estimator is developed where the gain matrix is determined by optimizing an upper bound matrix despite the random coupling terms and linearization errors. Compared with the augmented approach for state estimation of complex networks, an important feature of the proposed estimator is that the gain matrix can be derived for each node separately. By using the stochastic analysis techniques, sufficient conditions are established to guarantee that the estimation error is bounded in mean square. Simulation results are provided to show the effectiveness and applicability of the proposed estimator.