Unknown Input Observers Design For Real-Time Mitigation of the False Data Injection Attacks
Bibliographic record
Abstract
This paper is devoted to studying the effect of false data injection attacks on the state estimation of discrete linear time-invariant systems in the presence of unknown disturbance. The proposed scheme firstly decouples the disturbance signal from the estimation error by exploiting the concepts of unknown input observers. Then, the observer gain has been designed based on the Kalman filter algorithm while a saturation term has been assigned to the output error in the update rule of the estimated states. Thanks to the saturation-limit dynamics introduced into the error dynamics of the Kalman filter-based estimation, the proposed method is applicable for the real-time applications. The effectiveness of the proposed scheme has been validated through a numerical example by taking two different scenarios into considerations. First, the comparative results show the superiority of the proposed scheme in state estimation under the presence of high-frequency measurement noise. Next, further to the high-frequency measurement noise, it is assumed that the sensed measurements are also manipulated by an adversary, leading to outliers in the measurements. As for this scenario, the attained results show how successfully the proposed scheme can mitigate the effect of the outliers in the presence of unknown disturbances.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".