Answers are grounded in this paper and cite their sources.
The state estimation problem in the presence of malicious sensor attacks is commonly referred to as a secure state estimation problem. Central to addressing this problem is the concept of the sparse observability index, defined as the largest integer <tex-math notation="LaTeX">δ</tex-math> for which the system remains observable after the removal of any <tex-math notation="LaTeX">δ</tex-math> sensors. This index plays a critical role in quantifying the resilience of the system, as a higher <tex-math notation="LaTeX">δ</tex-math> enables unique state reconstruction despite the presence of more compromised sensors. In this study, for undirected multi-agent systems consisting of <tex-math notation="LaTeX">n</tex-math> agents, we analyze the relationship between the number of agents <tex-math notation="LaTeX">n</tex-math> and the sparse observability index <tex-math notation="LaTeX">δ</tex-math> for effective secure state estimation. In particular, we consider four typical graph structures: path, cycle, complete, and complete bipartite graphs. Our analysis reveals that <tex-math notation="LaTeX">δ</tex-math> does not increase monotonically with <tex-math notation="LaTeX">n</tex-math>, and that resilience is intricately tied to the underlying network structure. Notably, we demonstrate that the system exhibits enhanced resilience when the number of agents <tex-math notation="LaTeX">n</tex-math> is a prime number, although the specifics of this relationship vary depending on the graph topology.
No takes yet. Share an insight, caveat, or question.
Shinohara et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: