Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries

Takumi Shinohara, Toru Namerikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider the problem of secure state estimation in an adversarial environment with the presence of bounded noises. We assume the adversary has the knowledge of the healthy measurements and system parameters. To countervail the dangerous attacker, the problem is given as a min-max optimization, that is, the system operator seeks an estimator which minimizes the worst-case estimation error due to the manipulation by the attacker. On the proposed estimator, the estimation error is bounded at all times even if the system removing an arbitrary set of 2l sensors is not observable, where l is the number of the compromised sensors. To this end, taking the reach set of the system into account, we first show the feasible set of the state can be represented as a union of polytopes, and the optimal estimate is given as the Chebyshev center of the union. Then, for calculating the optimal state estimate, we provide a convex optimization problem that utilizes the vertices of the union. Additionally, the upper bound of the worst-case estimation error is derived theoretically, and we also show a rigorous analytical bound under a certain condition. The attacked sensor identification algorithm is further provided. A simple numerical example finally shows to illustrate the effectiveness of the proposed estimator.

Original languageEnglish
Title of host publication2018 Annual American Control Conference, ACC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5813-5818
Number of pages6
Volume2018-June
ISBN (Print)9781538654286
DOIs
Publication statusPublished - 2018 Aug 9
Event2018 Annual American Control Conference, ACC 2018 - Milwauke, United States
Duration: 2018 Jun 272018 Jun 29

Other

Other2018 Annual American Control Conference, ACC 2018
CountryUnited States
CityMilwauke
Period18/6/2718/6/29

Fingerprint

State estimation
Error analysis
Sensors
Convex optimization
Mathematical operators

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Shinohara, T., & Namerikawa, T. (2018). Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries. In 2018 Annual American Control Conference, ACC 2018 (Vol. 2018-June, pp. 5813-5818). [8431213] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ACC.2018.8431213

Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries. / Shinohara, Takumi; Namerikawa, Toru.

2018 Annual American Control Conference, ACC 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. p. 5813-5818 8431213.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shinohara, T & Namerikawa, T 2018, Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries. in 2018 Annual American Control Conference, ACC 2018. vol. 2018-June, 8431213, Institute of Electrical and Electronics Engineers Inc., pp. 5813-5818, 2018 Annual American Control Conference, ACC 2018, Milwauke, United States, 18/6/27. https://doi.org/10.23919/ACC.2018.8431213
Shinohara T, Namerikawa T. Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries. In 2018 Annual American Control Conference, ACC 2018. Vol. 2018-June. Institute of Electrical and Electronics Engineers Inc. 2018. p. 5813-5818. 8431213 https://doi.org/10.23919/ACC.2018.8431213
Shinohara, Takumi ; Namerikawa, Toru. / Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries. 2018 Annual American Control Conference, ACC 2018. Vol. 2018-June Institute of Electrical and Electronics Engineers Inc., 2018. pp. 5813-5818
@inproceedings{68cd863c7d8c42c9a5e7ff105d4e0ff7,
title = "Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries",
abstract = "We consider the problem of secure state estimation in an adversarial environment with the presence of bounded noises. We assume the adversary has the knowledge of the healthy measurements and system parameters. To countervail the dangerous attacker, the problem is given as a min-max optimization, that is, the system operator seeks an estimator which minimizes the worst-case estimation error due to the manipulation by the attacker. On the proposed estimator, the estimation error is bounded at all times even if the system removing an arbitrary set of 2l sensors is not observable, where l is the number of the compromised sensors. To this end, taking the reach set of the system into account, we first show the feasible set of the state can be represented as a union of polytopes, and the optimal estimate is given as the Chebyshev center of the union. Then, for calculating the optimal state estimate, we provide a convex optimization problem that utilizes the vertices of the union. Additionally, the upper bound of the worst-case estimation error is derived theoretically, and we also show a rigorous analytical bound under a certain condition. The attacked sensor identification algorithm is further provided. A simple numerical example finally shows to illustrate the effectiveness of the proposed estimator.",
author = "Takumi Shinohara and Toru Namerikawa",
year = "2018",
month = "8",
day = "9",
doi = "10.23919/ACC.2018.8431213",
language = "English",
isbn = "9781538654286",
volume = "2018-June",
pages = "5813--5818",
booktitle = "2018 Annual American Control Conference, ACC 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Reach Set-based Attack Resilient State Estimation against Omniscient Adversaries

AU - Shinohara, Takumi

AU - Namerikawa, Toru

PY - 2018/8/9

Y1 - 2018/8/9

N2 - We consider the problem of secure state estimation in an adversarial environment with the presence of bounded noises. We assume the adversary has the knowledge of the healthy measurements and system parameters. To countervail the dangerous attacker, the problem is given as a min-max optimization, that is, the system operator seeks an estimator which minimizes the worst-case estimation error due to the manipulation by the attacker. On the proposed estimator, the estimation error is bounded at all times even if the system removing an arbitrary set of 2l sensors is not observable, where l is the number of the compromised sensors. To this end, taking the reach set of the system into account, we first show the feasible set of the state can be represented as a union of polytopes, and the optimal estimate is given as the Chebyshev center of the union. Then, for calculating the optimal state estimate, we provide a convex optimization problem that utilizes the vertices of the union. Additionally, the upper bound of the worst-case estimation error is derived theoretically, and we also show a rigorous analytical bound under a certain condition. The attacked sensor identification algorithm is further provided. A simple numerical example finally shows to illustrate the effectiveness of the proposed estimator.

AB - We consider the problem of secure state estimation in an adversarial environment with the presence of bounded noises. We assume the adversary has the knowledge of the healthy measurements and system parameters. To countervail the dangerous attacker, the problem is given as a min-max optimization, that is, the system operator seeks an estimator which minimizes the worst-case estimation error due to the manipulation by the attacker. On the proposed estimator, the estimation error is bounded at all times even if the system removing an arbitrary set of 2l sensors is not observable, where l is the number of the compromised sensors. To this end, taking the reach set of the system into account, we first show the feasible set of the state can be represented as a union of polytopes, and the optimal estimate is given as the Chebyshev center of the union. Then, for calculating the optimal state estimate, we provide a convex optimization problem that utilizes the vertices of the union. Additionally, the upper bound of the worst-case estimation error is derived theoretically, and we also show a rigorous analytical bound under a certain condition. The attacked sensor identification algorithm is further provided. A simple numerical example finally shows to illustrate the effectiveness of the proposed estimator.

UR - http://www.scopus.com/inward/record.url?scp=85052561910&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85052561910&partnerID=8YFLogxK

U2 - 10.23919/ACC.2018.8431213

DO - 10.23919/ACC.2018.8431213

M3 - Conference contribution

SN - 9781538654286

VL - 2018-June

SP - 5813

EP - 5818

BT - 2018 Annual American Control Conference, ACC 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -