Square‐root cubature Kalman filter‐based vector tracking algorithm in GPS signal harsh environments
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In a vector tracking loop (VTL) architecture, non‐linearities exist in discriminator functions and pseudo‐range/pseudo‐range rate measurement expressions. Generally, normalisation functions are used in discriminators to export the desired code phase or carrier frequency error and the extended Kalman filter is adopted to estimate receiver's states. This process could be accurate enough when the code phase or carrier frequency error approaches zero in the signal moderate environment but begins to distort due to non‐linearity when the tracking errors become large in harsh situations. This finally narrows the applicable range of VTL. To overcome this issue, a square‐root cubature Kalman filter (CKF)‐based VTL is designed in this study. The discriminator functions are employed directly as measurements of navigation filter, and the non‐linear expressions of discriminator functions in terms of the receiver's position, velocity, and time states are derived without normalisation. Then the CKF, which is competitive in high‐dimensional non‐linear systems, is employed in its square‐root version to estimate the position, velocity, acceleration, and time states of the receiver. Comparison trial results between traditional and proposed VTL illustrate that the proposed algorithm can not only keep a superior tracking accuracy but also improves the tracking stability of VTL in <20 dB‐Hz signal harsh circumstances.
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.
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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 it