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

Type: Article

Publication Date: 2020-07-07

Citations: 22

DOI: https://doi.org/10.1109/tac.2020.3007383

Locations

  • IEEE Transactions on Automatic Control - View
  • arXiv (Cornell University) - View - PDF
  • DataCite API - View

Similar Works

Action Title Year Authors
+ On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering 2017 Lintao Ye
Sandip Roy
Shreyas Sundaram
+ PDF Chat On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering 2018 Lintao Ye
Sandip Roy
Shreyas Sundaram
+ Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms 2020 Lintao Ye
Sandip Roy
Shreyas Sundaram
+ PDF Chat Sensor placement for optimal Kalman filtering: Fundamental limits, submodularity, and algorithms 2016 Vasileios Tzoumas
Ali Jadbabaie
George J. Pappas
+ Sensor Placement for Optimal Kalman Filtering: Fundamental Limits, Submodularity, and Algorithms 2015 Vasileios Tzoumas
Ali Jadbabaie
George J. Pappas
+ Sensor Selection via Randomized Sampling 2017 Shaunak D. Bopardikar
+ Sensor Placement for Optimal Kalman Filtering: Fundamental Limits, Submodularity, and Algorithms ✩ 2015 Vasileios Tzoumas
Ali Jadbabaie
George J. Pappas
+ A Concentration-Based Approach for Optimizing the Estimation Performance in Stochastic Sensor Selection 2023 Christopher I. Calle
Shaunak D. Bopardikar
+ PDF Chat A Concentration-Based Approach for Optimizing the Estimation Performance in Stochastic Sensor Selection 2023 Christopher I. Calle
Shaunak D. Bopardikar
+ PDF Chat A Unified Approach to Optimally Solving Sensor Scheduling and Sensor Selection Problems in Kalman Filtering 2023 Shamak Dutta
Nils Wilde
Stephen L. Smith
+ PDF Chat Approximate Supermodularity of Kalman Filter Sensor Selection 2020 Luiz F. O. Chamon
George J. Pappas
Alejandro Ribeiro
+ A Unified Approach to Optimally Solving Sensor Scheduling and Sensor Selection Problems in Kalman Filtering 2023 Shamak Dutta
Nils Wilde
Stephen L. Smith
+ PDF Chat Observability Robustness Under Sensor Failures: A Computational Perspective 2023 Yuan Zhang
Yuanqing Xia
Kun Liu
+ PDF Chat Matrix Concentration Inequalities for Sensor Selection 2024 Christopher I. Calle
Shaunak D. Bopardikar
+ Inverse Filtering for Hidden Markov Models With Applications to Counter-Adversarial Autonomous Systems 2020 Robert Mattila
Cristian R. Rojas
Vikram Krishnamurthy
Bo Wahlberg
+ PDF Chat Probabilistic Performance Bounds for Randomized Sensor Selection in Kalman Filtering 2021 Christopher I. Calle
Shaunak D. Bopardikar
+ Optimal Attack Strategies Subject to Detection Constraints Against Cyber-Physical Systems 2016 Yuan Chen
Soummya Kar
José M. F. Moura
+ PDF Chat Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds 2020 Milad Siami
Alexander Olshevsky
Ali Jadbabaie
+ Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds 2018 Milad Siami
Alex Olshevsky
Ali Jadbabaie
+ PDF Chat Regret-Optimal Defense Against Stealthy Adversaries: A System Level Approach 2024 Hiroyasu Tsukamoto
Joudi Hajar
Soon‐Jo Chung
Fred Y. Hadaegh