Complexity reduction for resilient state estimation of uniformly observable nonlinear systems
원문 초록
A resilient state estimation scheme for uniformly observable nonlinear systems, based on a method for local identification of sensor attacks, is presented. The estimation problem is combinatorial in nature, and so many methods require substantial computational and storage resources as the number of sensors increases. To reduce the complexity, the proposed method performs the attack identification with local subsets of the measurements, not with the set of all measurements. A condition for nonlinear attack identification is introduced as a relaxed version of existing redundant observability condition. It is shown that an attack identification can be performed even when the state cannot be recovered from the measurements. As a result, although a portion of measurements are compromised, they can be locally identified and excluded from the state estimation, and thus the true state can be recovered. Simulation results demonstrate the effectiveness of the proposed scheme.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Models To Experiments: Shallow Recurrent Decoder Networks on the DYNASTY Experimental Facility
Recursive KalmanNet: Deep Learning-Augmented Kalman Filtering for State Estimation with Consistent Uncertainty Quantification
Benchmarking Spatiotemporal Reasoning in LLMs and Reasoning Models: Capabilities and Challenges
UMotion: Uncertainty-driven Human Motion Estimation from Inertial and Ultra-wideband Units
Contrastive Cross-Course Knowledge Tracing via Concept Graph Guided Knowledge Transfer
Secure Safety Filter Design for Sampled-data Nonlinear Systems under Sensor Spoofing Attacks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.