Sequential Track Fusion in UKF-based Multi-Sensor Networks: A Case of Slip Estimation in Wheeled Mobile Robots
Bibliographic record
Abstract
Accurate wheel slip estimation facilitates Wheeled Mobile Robots (WMRs) with improved localization and traversability monitoring which are crucial to their autonomy in challenging environments. Although distributed track-level fusion offers better computational efficiency, often sensor-level fusion is adopted in slip estimators. Extending upon our earlier work, we develop a novel explicit track-to-track fusion algorithm for UKF-based multi-sensor networks that has immediate application to slip ratio estimation in WMRs. The algorithm demonstrates better consistency compared to the existing fusion techniques, since it implements an optimal fusion rule to sequentially combine local tracks. It also saves computational power due to the recursive propagation of cross-covariance matrices based on the statistical linearization technique, instead of performing online optimizations. We prove that this recursion only requires the information of the first and last tracks in a sequence if all local tracks are unbiased. We rigorously study various key properties of the developed fusion algorithm and show its superior level of confidence when compared to the two prominent fusion methods of sequential and batch covariance intersection. The slip ratio estimation in a six-wheel WMR is considered as a case study, where the steerable wheel sets act as a network of sensors. The proposed slip estimator works based on the rigid body kinematics and readings of purely proprioceptive sensors, i.e., an inertial measurement unit and encoders. The slip estimator's performance is evaluated in a high-fidelity software-in-the-loop simulation environment connecting MATLAB and CM Lab's Vortex Studio software. In a comparison study that considers four rival strategies, we show the superiority of the proposed fusion method offering a balance between consistency, accuracy, and speed in real-time slip estimations.
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.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 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.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 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".