Real-Time Hardware-in-the-Loop Emulation of Path Tracking in Low-Cost Agricultural Robots
Bibliographic record
Abstract
Reducing costs and time spent in experiments in the early development stages of vehicular technology such as off-road and agricultural semi-autonomous robots could help progress in this research area. In particular, evaluating path tracking strategies in the semi-autonomous operation of robots becomes challenging because of hardware costs, the time required for preparation and tests, and constraints associated with external aspects such as meteorological or weather conditions or limited space in research laboratories. This paper proposes a methodology for the real-time hardware-in-the-loop emulation of path tracking strategies in low-cost agricultural robots. This methodology enables the real-time validation of path tracking strategies before their implementation on the robot. To validate this, we propose implementing a path tracking strategy using only the information of motor’s angular speed and robot yaw velocity obtained from encoders and a low-cost inertial measurement unit (IMU), respectively. This paper provides a simulation with MATLAB/Simulink, hardware-in-the-loop with Qube-servo (Quanser), and experimental results with an Agribot platform to confirm its validity.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".