4.7 Article

Recursive state estimation based-on the outputs of partial nodes for discrete-time stochastic complex networks with switched topology

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.jfranklin.2018.04.029

Keywords

-

Funding

  1. National Natural Science Foundation of China [61773017, 61374010, 61503328, 11671008]
  2. Top Talent Plan of Yangzhou University

Ask authors/readers for more resources

In this paper, the state estimation problem is studied for a class of discrete-time stochastic complex networks with switched topology. In the network under consideration, we assume that measurement outputs can be got from only partial nodes, besides, the switching rule of this network is characterized by a sequence of Bernoulli random variables. The aim of the presented estimation problem is to develop a recursive estimator based on the framework of extended Kalman filter (EKF), such that the upper bound for the filtering error convariance is optimized In order to address the nonlinear functions, the Taylor series expansion is utilized and the high-order terms of linearization errors are expressed in an exact way. Furthermore, by solving two Ricatti-like difference equations, the gain matrix can be acquired at each time instant. It is shown that the filtering error is bounded in mean square under some conditions with the aid of stochastic analysis techniques. A numerical example is given to demonstrate the validity of the proposed estimator. (C) 2018 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available