Online INS/GPS integration with a radial basis function neural network
Bibliographic record
Abstract
Most of the present navigation systems rely on Kalman filtering to fuse data from global positioning system (GPS) and the inertial navigation system (INS). In general, INS/GPS integration provides reliable navigation solutions by overcoming each of their shortcomings, including signal blockage for GPS and growth of position errors with time for INS. Present Kalman filtering INS/GPS integration techniques have some inadequacies related to the stochastic error models of inertial sensors, immunity to noise, and observability. This paper aims to introduce a multi-sensor system integration approach for fusing data from INS and GPS utilizing artificial neural networks (ANN). A multi-layer perceptron ANN has been recently suggested to fuse data from INS and differential GPS (DGPS). Although being able to improve the positioning accuracy, the complexity associated with both the architecture of multi-layer perceptron networks and its online training algorithms limit the real-time capabilities of this technique. This article, therefore, suggests the use of an alternative ANN architecture. This architecture is based on radial basis function (RBF) neural networks, which generally have simpler architecture and faster training procedures than multi-layer perceptron networks. The INS and GPS data are first processed using wavelet multi-resolution analysis (WRMA) before being applied to the RBF network. The WMRA is used to compare the INS and GPS position outputs at different resolution levels. The RBF-ANN module is then trained to predict the INS position errors and provide accurate positioning of the moving platform. Field-test results have demonstrated that substantial improvement in INS/GPS positioning accuracy could be obtained by applying the combined WRMA and RBF-ANN modules.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 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.001 | 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".