Answers are grounded in this paper and cite their sources.
In this letter we consider the distributed consensus-based filtering problem for linear time-invariant systems over sensor networks subject to random link failures when the failure sequence is not known at the receiving side. We assume that the information exchanged, traveling along the channel, is corrupted by a noise and hence, it is no more possible to discriminate with certainty if a link failure has occurred. Therefore, in order to process the only significant information, we endow each sensor with detectors which decide on the presence of link failures. At each sensor the proposed approach consists of three steps: 1) failure detection; 2) local data aggregation; and 3) Kalman consensus filtering. Numerical examples show the effectiveness of this method.
No takes yet. Share an insight, caveat, or question.
Battilotti et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: