Skip to main navigation Skip to search Skip to main content

A Weightedly Uniform Detectability for Sensor Networks

  • Wangyan Li
  • , Guoliang Wei*
  • , Daniel W. C. Ho
  • , Derui Ding
  • *Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

Abstract

In this brief, we study the detectability issues in the context of distributed state estimation problems for a class of locally undetectable sensor networks. First, we introduce a novel detectability condition, i.e., weightedly uniform detectability (WUD), which is a sufficient condition to prove that the error covariances of the consensus filtering are uniformly bounded even though the local sensor nodes are undetectable. Different from the existing detectability (or observability) conditions, our condition includes the interacting weights which could further optimize the lower detectability Gramian bound. Hence, a new weights selection method is derived in term of the criterion of WUD. This new rule of selecting weights provides a new framework for distributed state estimation. The advantages of this approach lead to a better performance in estimation without extra computational burden to the filtering process. Finally, an example shows the effectiveness of the proposed method.
Original languageEnglish
Pages (from-to)5790-5796
JournalIEEE Transactions on Neural Networks and Learning Systems
Volume29
Issue number11
Online published11 Apr 2018
DOIs
Publication statusPublished - Nov 2018

Research Keywords

  • Sensor networks
  • time-varying systems
  • weightedly uniform detectability (WUD)
  • weights selection

Fingerprint

Dive into the research topics of 'A Weightedly Uniform Detectability for Sensor Networks'. Together they form a unique fingerprint.

Cite this