Optimal resilient sensor placement problem for secure state estimation

DOI10.1016/J.AUTOMATICA.2023.111454MaRDI QIDQ6152574zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

eigenvalue and sparse observabilityoptimal sensor placementpolynomial time algorithmsecure state estimation

Mathematics Subject Classification ID

Observability (93B07) Networked control (93B70) Estimation and detection in stochastic control theory (93E10)

Recommendations

• Strategic sensor placement on graphs
• An optimal graph-search method for secure state estimation
• Optimal linear attack for multi-sensor network against state estimation
• Distributed secure state estimation for cyber-physical systems under sensor attacks
• On the computational complexity of the secure state-reconstruction problem

Cites work

• A Game-Theoretic Framework for Security-Aware Sensor Placement Problem in Networked Control Systems
• A secure control framework for resource-limited adversaries
• Actuator Security Indices Based on Perfect Undetectability: Computation, Robustness, and Sensor Placement
• Attack Detection and Identification in Cyber-Physical Systems
• Attack-Resilient <inline-formula> <tex-math notation="LaTeX">$\mathcal H_2$</tex-math> </inline-formula>, <inline-formula> <tex-math notation="LaTeX">$\mathcal
• Attack-Resilient State Estimation for Noisy Dynamical Systems
• Control theory for linear systems
• Control-Theoretic Methods for Cyberphysical Security: Geometric Principles for Optimal Cross-Layer Resilient Control Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Design and Implementation of Attack-Resilient Cyberphysical Systems: With a Focus on Attack-Resilient State Estimators
• Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents
• Event-Triggered State Observers for Sparse Sensor Noise/Attacks
• scientific article; zbMATH DE number 3119876 (Why is no real title available?)
• scientific article; zbMATH DE number 47926 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Information Flow and Cooperative Control of Vehicle Formations
• Minimal Controllability Problems
• Observability With Random Observations
• On Redundant Observability: From Security Index to Attack Detection and Resilient State Estimation
• On Submodularity and Controllability in Complex Dynamical Networks
• On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering
• On the complexity of approximating extremal determinants in matrices
• On the computational complexity of the secure state-reconstruction problem
• Resilient Reinforcement in Secure State Estimation Against Sensor Attacks With A Priori Information
• Resilient Sensor Placement for Kalman Filtering in Networked Systems: Complexity and Algorithms
• Secure Control Systems: A Quantitative Risk Management Approach
• Secure Estimation and Control for Cyber-Physical Systems Under Adversarial Attacks
• Secure State Estimation for Cyber-Physical Systems Under Sensor Attacks: A Satisfiability Modulo Theory Approach
• Secure State Estimation With Byzantine Sensors: A Probabilistic Approach
• Secure Switched Observers for Cyber-Physical Systems Under Sparse Sensor Attacks: A Set Cover Approach
• Strategic sensor placement on graphs
• The robust minimal controllability problem

Cited in

(1)

• Optimal stealthy robust attacks on Stackelberg game

This page was built for publication: Optimal resilient sensor placement problem for secure state estimation

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