An Integrated Terrain Identification Framework for Mobile Robots: System Development, Analysis, and Verification
Bibliographic record
Abstract
Terrain identification is essential to autonomous control algorithm development for mobile robots. This article proposes an integrated framework to identify terrain parameters based on inertial, and driving current signals. Multiple sources are combined to reduce the instability caused by single signals. A dynamic model of the track-soil system is established as the theoretical basis of identification. All signals are processed in the time, frequency, and time-frequency domains. The features of each domain are generated by statistical methods. To analyze, and select superior feature categories, a maximum-relevance, and minimum-redundancy criterion based on Pearson's correlation is proposed to evaluate the priority of features. A probabilistic neural network is used to identify the category of terrain. All results are analyzed with two factors, source, and input, to find the most effective rule of the proposed framework. The crossing combination analysis is taken into consideration to explore all potential improvement. The results show that the driving current yields comparative identification accuracy as inertial signals. Compared to the single signal source, the method using the combined signal source can effectively improve the accuracy of terrain identification.
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.001 | 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.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".