Trajectory Tracking Control of Autonomous Ground Vehicles Using Adaptive Learning MPC
Bibliographic record
Abstract
In this work, an adaptive learning model predictive control (ALMPC) scheme is proposed for the trajectory tracking of perturbed autonomous ground vehicles (AGVs) subject to input constraints. In order to estimate the unknown system parameter, we propose a set-membership-based parameter estimator based on the recursive least-squares (RLS) technique with the ensured nonincreasing estimation error. Then, the estimated system parameter is employed in MPC to improve the prediction accuracy. In the proposed ALMPC scheme, a robustness constraint is introduced into the MPC optimization to handle parametric and additive uncertainties. For the designed robustness constraint, its shape is decided off-line based on the invariant set, whereas its shrinkage rate is updated online according to the estimated upper bound of the estimation error, leading to further reduced conservatism and slightly increased computational complexity compared with the robust MPC methods. Furthermore, it is theoretically shown that the proposed ALMPC algorithm is recursively feasible under some derived conditions, and the closed-loop system is input-to-state stable (ISS). Finally, a numerical example and comparison study are conducted to illustrate the efficacy of the proposed method.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| 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".