Robust Distributed Kalman filtering with Event-Triggered Communication
Abstract
We consider the problem of distributed Kalman filtering for sensor networks in the case there are constraints in data transmission and there is model uncertainty. More precisely, we propose two distributed filtering strategies with event-triggered communication where the state estimators are computed according to the least favorable model. The latter belongs to a ball about the nominal model. We also show that both the methods are stable in the sense that the mean-square of the state estimation error is bounded in all the nodes.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.