A Universal Approach for Processing any MEMS Inertial Sensor Configuration for Land-Vehicle Navigation
Bibliographic record
Abstract
Recent navigation systems integrating GPS with Micro-Electro-Mechanical Systems (MEMS) Inertial Measuring Units (IMUs) have shown promising results for several applications based on low-cost devices such as vehicular and personal navigation. However, as a trend in the navigation market, some applications require further reductions in size and cost. To meet such requirements, a MEMS full IMU configuration (three gyros and three accelerometers) may be simplified. In this context, different partial IMU configurations such as one gyro plus three accelerometers or one gyro plus two accelerometers could be investigated. The main challenge in this case is to develop a specific navigation algorithm for each configuration since this is a time-consuming and costly task. In this paper, a universal approach for processing any MEMS sensor configuration for land vehicular navigation is introduced. The proposed method is based on the assumption that the omitted sensors provide relatively less navigation information and hence, their output can be replaced by pseudo constant signals plus noise. Using standard IMU/GPS navigation algorithms, signals from existing sensors and pseudo signals for the omitted sensors are processed as a full IMU. The proposed approach is tested using land-vehicle MEMS/GPS data and implemented with different sensor configurations. Compared to the full IMU case, the results indicate the differences are within the expected levels and that the accuracy obtained meets the requirements of several land-vehicle applications.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 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.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".