Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

↓ Direkt till sidans innehåll
↓ Direkt till sidans sekundära innehåll (sidomenyn)

Search: WFRF:(Niazi Umar) > Secure State Estima...

Details
MARC

Li, ZishuoDepartment of Automation, Tsinghua University, Beijing, 100084, China (author)

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

Article/chapterEnglish2023

Publisher, publication year, extent ...

Elsevier BV,2023
printrdacarrier

Numbers

LIBRIS-ID:oai:DiVA.org:kth-343688
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-343688URI
https://doi.org/10.1016/j.ifacol.2023.10.1580DOI

Supplementary language notes

Language:English
Summary in:English

Part of subdatabase

SwePubSwePub

Classification

Subject category:ref swepub-contenttype
Subject category:kon swepub-publicationtype

Notes

QC 20240223Part of ISBN 9781713872344
This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. At each time, the attacker has the freedom to choose an arbitrary set of no more than p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error irrespective of the attack signals subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observers for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. We show that our proposed scheme can effectively tolerate sparse attacks on an unknown set of sensors, ensuring a bounded estimation error and effectively detecting and resetting the attacked sensors.

Subject headings and genre

TEKNIK OCH TEKNOLOGIER Elektroteknik och elektronik Reglerteknik hsv//swe
ENGINEERING AND TECHNOLOGY Electrical Engineering, Electronic Engineering, Information Engineering Control Engineering hsv//eng
Design of fault tolerant/reliable systems
Estimation
Estimation and filtering
fault detection

Added entries (persons, corporate bodies, meetings, titles ...)

Niazi, Muhammad Umar B.KTH,Reglerteknik,Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA, 77 Massachusetts Avenue,Digital Futures(Swepub:kth)u1hzqtz7 (author)
Liu, ChangxinKTH,Reglerteknik,Digital Futures(Swepub:kth)u1xs2gr3 (author)
Mo, YilinDepartment of Automation, Tsinghua University, Beijing, 100084, China (author)
Johansson, Karl H.,1967-KTH,Reglerteknik,Digital Futures(Swepub:kth)u1h0d9k2 (author)
Department of Automation, Tsinghua University, Beijing, 100084, ChinaReglerteknik (creator_code:org_t)

Related titles

In:IFAC-PapersOnLine: Elsevier BV, s. 270-275

Internet link

To the university's database

Find more in SwePub

By the author/editor: Li, Zishuo; Niazi, Muhammad ...; Liu, Changxin; Mo, Yilin; Johansson, Karl ...

About the subject

ENGINEERING AND TECHNOLOGY: ENGINEERING AND ...; and Electrical Engin ...; and Control Engineer ...

Articles in the publication: IFAC-PapersOnLin ...

By the university: Royal Institute of Technology

Search outside SwePub

Extend your search to:: Google; Google Book Search; Google Scholar

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

LIBRIS.kb.se