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

DOI10.1109/TAC.2020.3007383MaRDI QIDQ4990218FDOQ4990218

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)

• On the Optimality of Linear Signaling to Deceive Kalman Filters over Finite/Infinite Horizons
• Approximate Supermodularity of Kalman Filter Sensor Selection
• Optimal resilient sensor placement problem for secure state estimation
• Intermittent control for synchronization of discrete-delayed complex cyber-physical networks under mixed attacks
• Distributed filtering based on Cauchy-kernel-based maximum correntropy subject to randomly occurring cyber-attacks
• Parameter Estimation in Epidemic Spread Networks Using Limited Measurements
• Maximization of nonsubmodular functions under multiple constraints with applications
• 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

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)