On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering

DOI10.1109/TAC.2020.3007383MaRDI QIDQ4990218FDO

Authors Lintao Ye, Sandip Roy, Shreyas Sundaram

Publication date 28 May 2021

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2003.11951

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(9)

• Distributed filtering based on Cauchy-kernel-based maximum correntropy subject to randomly occurring cyber-attacks
• Optimal resilient sensor placement problem for secure state estimation
• On the Optimality of Linear Signaling to Deceive Kalman Filters over Finite/Infinite Horizons
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• Real-time sensor selection for time-varying networks with guaranteed performance
• Maximization of nonsubmodular functions under multiple constraints with applications
• Approximate Supermodularity of Kalman Filter Sensor Selection
• Intermittent control for synchronization of discrete-delayed complex cyber-physical networks under mixed attacks
• Parameter estimation in epidemic spread networks using limited measurements

This page was built for publication: On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4990218)