TD3 Tuned PID Controller for Autonomous Vehicle Platooning
Bibliographic record
Abstract
The main objective of platoon control is coordinated motion of autonomous vehicle platooning with small intervehicle spacing while maintaining the same speed and acceleration as the leading vehicle, which can save energy consumption and improve traffic throughput. The conventional platoon control methods are confronted with the problem of manual parameter tuning. In order to addres this isue, a novel bifold platoon control approach leveraging a deep reinforcement learning-based model is proposed, which enables the platoon adapt to the complex traffic environment, and guarantees the safety of platoon. The upper layer controller based on the TD3 tuned PID algorithm outputs the desired acceleration. This integration mitigates the inconvenience of frequent manual parameter tuning asociated with the conventional PID algorithm. The lower layer controller tracks the desired acceleration based on the inverse vehicle dynamics model and feedback control. Through this dynamic inverse model, the desired acceleration of the platoon vehicle is transformed into a feedforward control input. This input is then supplemented by feedback from a PID controller. A comprehensive validation of the proposed approach is conducted through a collaborative simulation experiment using Carmaker/Simulink. The results show the trajectory of the desired acceleration is smooth, indicating a ride comfort of vehicle. Moreover, the platoon vehicle is able to make a quick response to the speed change of the predecesor. The maximum error in the distance between vehicles in the platoon is 2.5m. In summary, the proposed control method of connected and automated vehicle platoon based on TD3 tuned PID effectively realizes cooperative control of platoon vehicles.
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.000 | 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.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".