Clustering-Assisted Observation Domain Optimization for GNSS Multi-Fault Detection and Correction
Bibliographic record
Abstract
With the rise of autonomous and semi-autonomous vehicles, effective fault detection and mitigation (FDM) methods have become essential in meeting the integrity requirements for precise and reliable Global Navigation Satellite System (GNSS)-based positioning. The existing GNSS-only FDM methods are ineffective in scenarios involving multiple faulty observations due to either their theoretical model limitations or high computational costs. In this paper, a novel GNSS multi-fault detection and correction method is developed <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">that achieves a balance between computational complexity and performance</b>. The proposed method incorporates an Expectation Maximization (EM) framework to jointly estimate an approximate maximum likelihood of states and latent model parameters in the presence of observation outliers, i.e., faults. However, the EM algorithm is known for its high computational complexity. To reduce the computational complexity of EM, an importance sampling step based on unsupervised clustering is introduced. As demonstrated by the results and analysis herein, the proposed method outperforms the existing Least-squares Residuals method, achieving an average improvement of up to 48% in positioning accuracy. Additionally, the computational complexity of the proposed method is an order of magnitude lower than the state-of-the-art Solution Separation method. <bold xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The method enhances positioning reliability at a lower computational cost and does not require additional infrastructure, hence, can be readily integrated into standalone real-time GNSS applications</b>
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".