LQG Reference Tracking with Safety and Reachability Guarantees under False Data Injection Attacks

Niu, Luyao; Li, Zhouchi; Clark, Andrew

doi:10.23919/acc.2019.8814821

Cited by 8 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Second, we derive a closed-form solution of the controller for a special case of the problem where there is a unique attack pattern. The derived controller not only guarantees safety and reachability, but also achieves better approximation with respect to the expected cost, compared with our preliminary work [21].…”

Section: Introductionmentioning

confidence: 83%

“…At present, less attention has been paid to the design of closed-loop controllers with safety and reachability guarantees under FDI attacks. In the preliminary conference version of this work [21], we investigated the linear quadratic Gaussian (LQG) reference tracking problem, in which there was only one possible set of compromised sensors. In this paper, we generalize the problem so that multiple possible compromised sensor sets are given, each of which corresponds to a different attack scenario.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

LQG Reference Tracking with Safety and Reachability Guarantees under Unknown False Data Injection Attacks

Li,

Niu,

Clark

2021

Preprint

Self Cite

View full text Add to dashboard Cite

We investigate a linear quadratic Gaussian (LQG) tracking problem with safety and reachability constraints in the presence of an adversary who mounts an FDI attack on an unknown set of sensors. For each possible set of compromised sensors, we maintain a state estimator disregarding the sensors in that set, and calculate the optimal LQG control input at each time based on this estimate. We propose a control policy which constrains the control input to lie within a fixed distance of the optimal control input corresponding to each state estimate. The control input is obtained at each time step by solving a quadratically constrained quadratic program (QCQP). We prove that our policy can achieve a desired probability of safety and reachability using the barrier certificate method. Our control policy is evaluated via a numerical case study.

show abstract

Section: Introductionmentioning

confidence: 83%

Section: Introductionmentioning

confidence: 99%

LQG Reference Tracking with Safety and Reachability Guarantees under Unknown False Data Injection Attacks

Li,

Niu,

Clark

2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The authors of [33] used barrier functions to solve a reference tracking problem for a continuous-time linear system subject to possible false data injection attacks by an adversary, with additional constraints on the safety and reachability of the system. Probabilistic reachability over a finite time horizon for discretetime stochastic hybrid systems was presented in [1].…”

Section: Related Workmentioning

confidence: 99%

Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates

Ramasubramanian

Niu

Clark

et al. 2019

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This paper studies the satisfaction of a class of temporal properties for cyber-physical systems (CPSs) over a finite-time horizon in the presence of an adversary, in an environment described by discrete-time dynamics. The temporal logic specification is given in sa f e − LTL F , a fragment of linear temporal logic over traces of finite length. The interaction of the CPS with the adversary is modeled as a two-player zero-sum discretetime dynamic stochastic game with the CPS as defender. We formulate a dynamic programming based approach to determine a stationary defender policy that maximizes the probability of satisfaction of a sa f e − LTL F formula over a finite time-horizon under any stationary adversary policy. We introduce secure control barrier certificates (S-CBCs), a generalization of barrier certificates and control barrier certificates that accounts for the presence of an adversary, and use S-CBCs to provide a lower bound on the above satisfaction probability. When the dynamics of the evolution of the system state has a specific underlying structure, we present a way to determine an S-CBC as a polynomial in the state variables using sum-of-squares optimization. An illustrative example demonstrates our approach.

show abstract

Resilient Trajectory Planning in Adversarial Environments

Clark

2019

2019 IEEE 58th Conference on Decision and Control (CDC)

View full text Add to dashboard Cite

LQG Reference Tracking with Safety and Reachability Guarantees under False Data Injection Attacks

Cited by 8 publications

References 18 publications

LQG Reference Tracking with Safety and Reachability Guarantees under Unknown False Data Injection Attacks

LQG Reference Tracking with Safety and Reachability Guarantees under Unknown False Data Injection Attacks

Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates

Resilient Trajectory Planning in Adversarial Environments

Contact Info

Product

Resources

About