Implementation of Parallel Cascade Identification at Various Phases for Integrated Navigation System
Bibliographic record
Abstract
Global navigation satellite systems (GNSS) are widely used for the navigation of land vehicles. However, the positioning accuracy of GNSS, such as the global positioning system (GPS), deteriorates in urban areas due to signal blockage and multipath effects. GNSS can be integrated with a micro-electro-mechanical system (MEMS)–based inertial navigation system (INS), such as a reduced inertial sensor system (RISS) using a Kalman filter (KF) to enhance the performance of the integrated navigation solution in GNSS challenging environments. The linearized KF cannot model the low-cost and small-size sensors due to relatively high noise levels and compound error characteristics. This paper reviews two approaches to employing parallel cascade identification (PCI), a non-linear system identification technique, augmented with KF to enhance the navigational solution. First, PCI models azimuth errors for a loosely coupled 2D RISS integrated system with GNSS to obtain a navigation solution. The experimental results demonstrated that PCI improved the integrated 2D RISS/GNSS performance by modeling linear, non-linear, and other residual azimuth errors. For the second scenario, PCI is utilized for modeling residual pseudorange correlated errors of a KF-based tightly coupled RISS/GNSS navigation solution. Experimental results have shown that PCI enhances the performance of the tightly coupled KF by modeling the non-linear pseudorange errors to provide an enhanced and more reliable solution. For the first algorithm, the results demonstrated that PCI can enhance the performance by 77% as compared to the KF solution during the GNSS outages. For the second algorithm, the performance improvement for the proposed PCI technique during the availability of three satellites was 39% compared to the KF solution.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 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.005 | 0.002 |
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".