2016
DOI: 10.1109/tac.2015.2492159
|View full text |Cite
|
Sign up to set email alerts
|

Event-Triggered State Observers for Sparse Sensor Noise/Attacks

Abstract: This paper describes two algorithms for state reconstruction from sensor measurements that are corrupted with sparse, but otherwise arbitrary, "noise". These results are motivated by the need to secure cyber-physical systems against a malicious adversary that can arbitrarily corrupt sensor measurements.The first algorithm reconstructs the state from a batch of sensor measurements while the second algorithm is able to incorporate new measurements as they become available, in the spirit of a Luenberger observer.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
257
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
4

Relationship

1
7

Authors

Journals

citations
Cited by 356 publications
(259 citation statements)
references
References 24 publications
2
257
0
Order By: Relevance
“…Definition 1 ( [19]): An LTI system from (1) is said to be s-sparse observable if for every set K ⊂ S of size s (i.e., |K| = s), the pair (A, P K C) is observable.…”
Section: Attack-resilient State Estimatorsmentioning
confidence: 99%
See 1 more Smart Citation
“…Definition 1 ( [19]): An LTI system from (1) is said to be s-sparse observable if for every set K ⊂ S of size s (i.e., |K| = s), the pair (A, P K C) is observable.…”
Section: Attack-resilient State Estimatorsmentioning
confidence: 99%
“…Finally, if we consider systems that can deal with up to q attacks when there is no noise, from (19) and (20) it follows that the feasible set for the state estimation vector ∆x l1 can be described as the set where ∆x l1 = 0 or it satisfies…”
Section: Attack-resilient State Estimatorsmentioning
confidence: 99%
“…The particular assumption is that the pair (A, C) remains observable after removing any set of 2 |K| rows of C (that is, any set of 2 |K| sensors) [12,Propositions 3.2 and 3.3]. If this strong observability assumption is not met, or in case of state attacks on (regular or singular) systems, the problem remains computationally hard.…”
Section: Lemma 22 (Complexity Of the Attack Identification Problem)mentioning
confidence: 99%
“…Convex relaxation techniques are employed in [11] to derive an efficient (yet incomplete and without guarantees) identification algorithm for the case of attacks against the system measurements. Finally, [12] shows that certain instances of the identification problem can in fact be solved efficiently. In this work we derive decentralized and distributed identification monitors with performance guarantees.…”
Section: Introductionmentioning
confidence: 99%
“…Here, we assume that control design for no-attack case has been developed and concentrate on techniques for state estimation and sensor fusion under external attacks. Note that since previously developed methods for attackresilient state estimation (e.g., [15,39,48]) require the unpractical assumption of the exact knowledge of the controlled plant's dynamics, resilience-to-attack guarantees do not hold when these assumptis are violated.…”
Section: Platform-aware Control Design For Secure Cpsmentioning
confidence: 99%