Optimal resilient sensor placement problem for secure state estimation
From MaRDI portal
Publication:6152574
DOI10.1016/j.automatica.2023.111454OpenAlexW4389637397MaRDI QIDQ6152574
Takumi Shinohara, Toru Namerikawa
Publication date: 13 February 2024
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2023.111454
polynomial time algorithmoptimal sensor placementsecure state estimationeigenvalue and sparse observability
Estimation and detection in stochastic control theory (93E10) Observability (93B07) Networked control (93B70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of approximating extremal determinants in matrices
- On the computational complexity of the secure state-reconstruction problem
- Strategic sensor placement on graphs
- A secure control framework for resource-limited adversaries
- The robust minimal controllability problem
- Event-Triggered State Observers for Sparse Sensor Noise/Attacks
- Observability With Random Observations
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
- Secure Control Systems: A Quantitative Risk Management Approach
- Control-Theoretic Methods for Cyberphysical Security: Geometric Principles for Optimal Cross-Layer Resilient Control Systems
- Attack-Resilient <inline-formula> <tex-math notation="LaTeX">$\mathcal H_2$</tex-math> </inline-formula>, <inline-formula> <tex-math notation="LaTeX">$\mathcal H_\infty$</tex-math> </inline-formula>, and <inline-formula> <tex-math notation="LaTeX">$\ell _1$</tex-math> </inline-formula> State Estimator
- Secure State Estimation for Cyber-Physical Systems Under Sensor Attacks: A Satisfiability Modulo Theory Approach
- On Redundant Observability: From Security Index to Attack Detection and Resilient State Estimation
- On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
- Design and Implementation of Attack-Resilient Cyberphysical Systems: With a Focus on Attack-Resilient State Estimators
- A Game-Theoretic Framework for Security-Aware Sensor Placement Problem in Networked Control Systems
- Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
- Secure State Estimation With Byzantine Sensors: A Probabilistic Approach
- Actuator Security Indices Based on Perfect Undetectability: Computation, Robustness, and Sensor Placement
- Secure Switched Observers for Cyber-Physical Systems Under Sparse Sensor Attacks: A Set Cover Approach
- Resilient Reinforcement in Secure State Estimation Against Sensor Attacks With A Priori Information
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Information Flow and Cooperative Control of Vehicle Formations
- Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
- Attack Detection and Identification in Cyber-Physical Systems
- Minimal Controllability Problems
- On Submodularity and Controllability in Complex Dynamical Networks
- Attack-Resilient State Estimation for Noisy Dynamical Systems
- Control theory for linear systems
This page was built for publication: Optimal resilient sensor placement problem for secure state estimation