Optimal torque vectoring control for distributed drive electric vehicle
Bibliographic record
Abstract
A novel optimal torque vectoring control (TVC) strategy is proposed in this paper to enhance the lateral stability of a dual-motor rear-wheel drive electric vehicle. The structure of the optimal TVC consists of three parts, i.e., pre-processor, model following controller and post-processor. Unlike the commonly used linear single track vehicle model, an accurate nonlinear vehicle model is built in the pre-processor based on Magic Formula tyre model. The model following controller is responsible for producing the corrective yaw moment by a two-dimensional gain scheduling method related to the vehicle longitudinal velocity and lateral acceleration. This optimal yaw moment controller consisting of the steady-state control law and the optimal feedback control law is developed to compensate the nonlinear property induced by time-varying tyre cornering stiffness. In the post processor, torque vectoring allocation strategies are presented considering the constraints of motor peak torque and tyre friction. Co-simulation results of the CarSim and LabVIEW under two driving manoeuvres (step steering and skid pad track) illustrate that the lateral and longitudinal performance of the vehicle is greatly improved and experimental results of hardware-in-the-loop (HIL) proves that the control system can be well used in real-time.
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.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".