Variable Wheelbase Control of Wheeled Mobile Robots With Worm-Inspired Creeping Gait Strategy
Bibliographic record
Abstract
Wheeled mobile robots (WMRs) with variable wheelbases are capable of traveling on deformable terrains and handling complex detection tasks. While the variable wheelbase length of WMR allows it to interact with the terrains adaptively, enhancing its mobility, it brings a control challenge. Inspired by the worm's movement of stretching body at different lengths under different environmental resistance, a creeping gait (CG) strategy is proposed in this work to enable the WMR to be controlled in dual modes: wheeled following mode (WFM) and specified length mode (SLM). WFM adjusts the wheelbase's length by the wheels' movements freely to minimize the internal force and torque between wheels. SLM adjusts the wheelbase's length using a proposed fuzzy logic based algorithm to stabilize the body's posture on rough terrain and overcome specific motion challenges, like escaping wheel sinking. A state-adaptive mode-switching controller is then developed using the dwell time approach to smooth the output velocities during the switching phase, and a Lyapunov analysis is performed to verify its stability. According to the results of physical experiments, three-wheeled mobile robot movements with CG enable more precise path following by 37% and faster response by 11% compared to fixed wheelbase movements, and the dwell time approach achieves smoother speed transitions between the modes than the direct switching method, especially when moving from flat to slope terrain.
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.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 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".