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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Automatica (Oxford) Jg. 136; S. 110083
Hauptverfasser:	Mao, Yanwen, Mitra, Aritra, Sundaram, Shreyas, Tabuada, Paulo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.02.2022
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!