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

Full description

Bibliographic Details

Published in:	Automatica (Oxford) Vol. 136; p. 110083
Main Authors:	Mao, Yanwen, Mitra, Aritra, Sundaram, Shreyas, Tabuada, Paulo
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.02.2022
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!