4.7 Article

Set-membership filtering for time-varying complex networks with uniform quantisations over randomly delayed redundant channels

期刊

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
卷 51, 期 16, 页码 3364-3377

出版社

TAYLOR & FRANCIS LTD
DOI: 10.1080/00207721.2020.1814898

关键词

Complex networks; set-membership filtering; randomly delayed redundant channels; uniform quantisation; recursive matrix inequalities

资金

  1. National Natural Science Foundation of China [61873148, 61933007, 61703245]
  2. China Postdoctoral Science Foundation [2018T110702]
  3. Qingdao Postdoctoral Applied Research Project [2016117]
  4. Postdoctoral Special Innovation Foundation of Shandong [201701015]
  5. European Union [820776]
  6. Royal Society of the UK
  7. Alexander von Humboldt Foundation of Germany

向作者/读者索取更多资源

This paper investigates the set-membership filtering problem for a class of nonlinear time-varying complex networks with uniformly quantised measurements over redundant channels. The network output is subject to uniform quantisation and then the quantised signal is sent to the filter through redundant channels with random delays. The aim of the proposed problem is to design a set-membership filter such that, at each time instant, the filtering error dynamics is confined within a closed domain whose boundary is a hyper-ellipsoid. Sufficient conditions are proposed to guarantee the existence of addressed set-membership filter in terms of certain recursive matrix inequality. Subsequently, an optimisation problem is proposed to minimise the hyper-ellipsoid (containing the true network state) in the sense of trace and a computational algorithm is then provided. Finally, a simulation example is provided to demonstrate the effectiveness of our proposed method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据