Development of a Path-following and a Speed Control Driver Model for an Electric Vehicle
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
<div class="section abstract"><div class="htmlview paragraph">A two-passenger all-wheel-drive urban electric vehicle (AUTO21EV) with four in-wheel motors and an active steering system has been designed and developed at the University of Waterloo. In order to evaluate the handling and performance of such a vehicle in the design stage and analyze the effectiveness of different chassis control systems before implementing them in the real vehicle, the simulation of a large number of different open-loop and closed-loop test maneuvers is necessary. Thus, in the simulation environment, not only is a mathematical vehicle model needed for every test maneuver, but a driver model must also be designed to simulate the closed-loop test maneuvers. The role of the driver model is to calculate the control inputs required to successfully follow a predefined path. Such a driver model can be implemented as an inverse dynamics problem or by a representation of a driver that can look ahead, preview the path, and change the steering wheel angle and acceleration or brake pedal positions accordingly. In this regard, a path-following driver model is developed in this work with an advanced path previewing technique. In addition, a gain scheduling speed control driver model is developed for the AUTO21EV, which adjusts the drive torques of the wheels to minimize the deviation between the desired and actual vehicle speeds.</div></div>
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.001 | 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