Papers
Topics
Authors
Recent
Search
2000 character limit reached

Resilient Distributed Recovery of Large Fields

Published 19 Oct 2019 in math.OC and cs.MA | (1910.08841v1)

Abstract: This paper studies the resilient distributed recovery of large fields under measurement attacks, by a team of agents, where each measures a small subset of the components of a large spatially distributed field. An adversary corrupts some of the measurements. The agents collaborate to process their measurements, and each is interested in recovering only a fraction of the field. We present a field recovery consensus+innovations type distributed algorithm that is resilient to measurement attacks, where an agent maintains and updates a local state based on its neighbors states and its own measurement. Under sufficient conditions on the attacker and the connectivity of the communication network, each agent's state, even those with compromised measurements, converges to the true value of the field components that it is interested in recovering. Finally, we illustrate the performance of our algorithm through numerical examples.

Citations (1)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.