A Study on Minimum Sigma Set SRUKF Based GPS/INS Tightly-Coupled System
Bibliographic record
Abstract
In this paper, firstly, some questionable formulas and conceptual oversights of previous reduced sigma set unscented transformation (UT) methods are revised through theoretical analysis. Then the revised UT methods based Kalman filters are used in a GPS/INS tightly-coupled system. The Kalman filter flows are the kind of square-root, since the square-root unscented Kalman filters (SRUKFs) can guarantee the stability of the system. By using the reduced sigma set SRUKFs (which contain simplex sigma set square-root unscented Kalman filter (S-SRUKF), spherical simplex sigma set square-root unscented Kalman filter (SS-SRUKF) and minimum sigma set square-root unscented Kalman filter (M-SRUKF)), the computation cost is greatly saved compared with the standard SRUKF, while the accuracy of the GPS/INS tightly-coupled system still maintained. The structure of the GPS/INS tightly-coupled system is in the form of error state, and the time updates of the state and the state covariance of SRUKFs are directly estimated without using UT, thus the computational time is also greatly saved. The pseudo-satellite is introduced to aid the system when the observation information is deficient, for example, when the GPS signal is deficient in the maneuver environment. By using the pseudo-satellite, the optimal performance of the system is guaranteed. Experiment of unmanned aerial vehicle (UAV) showed that the pseudo-satellite aided mechanism worked well.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| 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.002 | 0.001 |
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".