Adaptive H-infinity extended Kalman filtering for a navigation system in presence of high uncertainties
Bibliographic record
Abstract
The optimal performance of the Kalman filters is highly dependent on the measurement and process noise characteristics, making the whole system unable to achieve the desired estimation in the presence of non-Gaussian mean noise distribution and high initial uncertainties. Recently, the H-infinity filter, as a robust algorithm, has been broadly used, as it is not being dependent on the pre-knowledge of the noise nature; however, making a balance between high robustness and estimation accuracy is a challenging issue. Hence, to overcome this problem, a new adaptive H-infinity extended Kalman filter (AHEKF) was designed in this paper, which benefits from both high robustness and precision. The suggested algorithm contains two adaptive sections to achieve high accuracy as well as controlling the effects of time-varying noise characteristics, high initial uncertainties, and abnormal data that can degrade the accuracy of state estimation in an integrated navigation system. The presented algorithm was used to integrate data from two independent sensors data. The simulation results for an inertial navigation system (INS)/global positioning system (GPS) sensor fusion are presented and compared with the standard H-infinity filter, extended Kalman filter (EKF), and unscented Kalman filter (UKF) to show the effectiveness of the proposed algorithm. Evaluations demonstrate that the AHEKF achieves over 50% higher accuracy and robustness, and over 2.5 times faster convergence of estimation errors than the standard H-infinity filter.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 source (direct Gemma or distilled Codex), 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".