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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 68; no. 12; pp. 1 - 14
Main Authors:	Lu, An-Yang, Yang, Guang-Hong
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.12.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!