On the computational complexity of the secure state-reconstruction problem

In this paper, we discuss the computational complexity of reconstructing the state of a linear system from sensor measurements that have been corrupted by an adversary. The first result establishes that the problem is, in general, NP-hard. We then introduce the notion of eigenvalue observability and...

Celý popis

Podrobná bibliografia

Vydané v:	Automatica (Oxford) Ročník 136; s. 110083
Hlavní autori:	Mao, Yanwen, Mitra, Aritra, Sundaram, Shreyas, Tabuada, Paulo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.02.2022
Predmet:	Eigenvalue and sparse observability Polynomial time algorithm Resilient state secure state-reconstruction Eigenvalue and sparse observability Resilient state secure state-reconstruction Polynomial time algorithm
ISSN:	0005-1098, 1873-2836
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!