2020
DOI: 10.1016/j.automatica.2020.108920
|View full text |Cite
|
Sign up to set email alerts
|

Securing state reconstruction under sensor and actuator attacks: Theory and design

Abstract: This paper discusses the problem of estimating the state of a linear time invariant system when some of its sensors and actuators are compromised by an adversarial agent. In the model considered in this paper, the malicious agent attacks an input (output) by manipulating its value arbitrarily, i.e., we impose no constraints (statistical or otherwise) on how control commands (sensor measurements) are changed by the adversary. In the first part of this paper, we introduce the notion of sparse strong observabilit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(13 citation statements)
references
References 40 publications
0
11
0
Order By: Relevance
“…For system (1), ψ(k), ϕ(k) and a(k) are uncertain. And in order to design a secure state observer, the following assumptions, which are frequently used in the literatures [14], [24], [25], [28], [29], [34], are essential. Assumption 1.…”
Section: Preliminaries and Problem Formulationmentioning
confidence: 99%
“…For system (1), ψ(k), ϕ(k) and a(k) are uncertain. And in order to design a secure state observer, the following assumptions, which are frequently used in the literatures [14], [24], [25], [28], [29], [34], are essential. Assumption 1.…”
Section: Preliminaries and Problem Formulationmentioning
confidence: 99%
“…Till now, there are two mainstream techniques, i.e., optimization relaxation (OR) and brute force search (BFS), to cope with the secure state estimation problem of CPSs. Several algorithms such as satisfiability modulo solvers [22], projected gradientdescent paradigms [23], optimal graph searching [24] and L 1 /L r decoders [25] belong to OR and the basic idea of which is to find the optimal solution in polynomial time. For BFS, a number of excellent results including observability Gramians [26], switched counteraction principle (SCP) [19] and identification filter [18] have been obtained.…”
Section: Introductionmentioning
confidence: 99%
“…For example, the target may be subject to arbitrary unknown disturbances which are difficult, if possible, to statistically interpret or model. Typical examples in applications include systems under fault/attacks [20]- [22], tracking/localisation of targets subject to abrupt maneuvers [23]- [27], advanced vehicle applications under complex tireground interactions [28]- [31], estimation of unmeasured forces in grasping/manipulation [32]- [33], etc. In fact, filtering and estimation under arbitrary unknown inputs have received much attention in the control literature [34]- [37], and have found numerous applications, including robustness/security analysis and synthesis of resilient autonomous robots and connected vehicle systems [38]- [41].…”
Section: Introductionmentioning
confidence: 99%