A polynomial-time algorithm for the secure state estimation problem under sparse sensor attacks via state decomposition technique

This paper investigates the secure state estimation problem for cyber-physical systems (CPSs) under sparse sensor attacks. In the existing results, the secure state estimation is usually established as an NP-hard problem where combinatorial candidates should be checked since the set of attacked chan...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 68; číslo 12; s. 1 - 14
Hlavní autori:	Lu, An-Yang, Yang, Guang-Hong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Combinatorial analysis Cyber-physical systems Decoding Decomposition Effectiveness Eigenvalues Force Matrix decomposition Observability Observability (systems) polynomial-time algorithm Polynomials secure state estimation Security Sparse matrices sparse sensor attack state decomposition technique State estimation
ISSN:	0018-9286, 1558-2523
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!