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

DOI10.1109/TAC.2020.3007383MaRDI QIDQ4990218

Lintao Ye, Sandip Roy, Unnamed Author, 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)

Related Items (6)

Intermittent control for synchronization of discrete-delayed complex cyber-physical networks under mixed attacks ⋮ Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Maximization of nonsubmodular functions under multiple constraints with applications ⋮ Optimal resilient sensor placement problem for secure state estimation ⋮ Distributed filtering based on Cauchy-kernel-based maximum correntropy subject to randomly occurring cyber-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