Design of a tracking controller for autonomous articulated heavy vehicles using a nonlinear model predictive control technique
Bibliographic record
Abstract
This article proposes a design of a tracking controller for autonomous articulated heavy vehicles (AAHVs) using a nonlinear model predictive control (NLMPC) technique. Despite economic and environmental benefits in freight transportation, articulated heavy vehicles (AHVs) exhibit poor directional performance due to their large sizes, multi-unit vehicle configurations, and high centers of gravity (CGs). AHVs represent a 7.5 times higher risk of traffic accidents than single-unit vehicles (e.g. rigid trucks, cars, etc.) in highway operations. Human driver errors cause about 94% of traffic collisions. However, little attention has been paid to autonomous driving control of AHVs. To increase the safety of AHVs, we design a novel NLMPC-based tracking controller for an AHV, that is, a tractor/semi-trailer combination, and this tracking controller is distinguished from others with the feature of controlling both the lateral and longitudinal motions for both the leading and trailing units. To design the tracking controller, a new prediction AHV model is developed, which represents both the lateral and longitudinal dynamics of the vehicle and captures its rearward amplification feature over high-speed evasive maneuvers. With the proposed tracking controller, the AAHV tracks the predefined reference path and follows a planned forward-speed scheme. Co-simulation demonstrates the effectiveness and robustness of the proposed NLMPC tracking controller.
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.000 |
| 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".