Trajectory Tracking Control of an Orchard Robot Based on Improved Integral Sliding Mode Algorithm
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
To address the problems of insufficient trajectory tracking accuracy, pronounced jitter over undulating terrain, and limited disturbance rejection in orchard mobile robots, this paper proposes a trajectory tracking control strategy based on a double-loop adaptive sliding mode. Firstly, a kinematic model of the orchard robot is constructed and a time-varying integral terminal sliding surface is designed to achieve global fast finite-time convergence. Secondly, a sinusoidal saturation switching function with a variable boundary is employed to suppress the high-frequency chattering inherent in sliding mode control. Thirdly, an improved double-power reaching law (Improved DPRL) is introduced to enhance disturbance rejection in the inner loop while ensuring continuity of the outer-loop output. Finally, Lyapunov stability theory is used to prove the asymptotic stability of the double-loop system. The experimental results show that attitude angle error settles within 0.01 rad after 0.144 s, while the position errors in both the x-axis and y-axis directions settle within 0.01 m after 0.966 s and 0.753 s, respectively. Regarding position error convergence, the Integral of Absolute Error (IAE)/Integral of Squared Error (ISE)/Integral of Time-Weighted Absolute Error (ITAE) are 0.7629 m, 0.7698 m, and 0.2754 m, respectively; for the attitude angle error, the IAE/ISE/ITAE are 0.0484 rad, 0.0229 rad, and 0.1545 rad, respectively. These results indicate faster convergence of both position and attitude errors, smoother control inputs, and markedly reduced chattering. Overall, the findings satisfy the real-time and accuracy requirements of fast trajectory tracking for orchard mobile robots.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it