Freeway Congestion Management With Reinforcement Learning Headway Control of Connected and Autonomous Vehicles
Bibliographic record
Abstract
Adaptive cruise control (ACC) systems are increasingly offered in new vehicles in the market today, and they form a core building block for future full autonomous driving. ACC systems allow vehicles to maintain a desired headway to a leading vehicle automatically. Recent research demonstrates that (1) shorter headways lead to higher throughput, and (2) the effective use of ACC can improve traffic flow by adapting the desired time headway in response to changing traffic conditions. In this paper we show that, although shorter headways result in higher capacity, flow breakdown still occurs if traffic densities at bottlenecks are allowed to exceed the critical density. Therefore, dynamic traffic control near bottlenecks is still necessary to avoid bottleneck activation and capacity loss. We propose an adaptive reinforcement learning (RL) headway controller that uses ACC headways to optimize traffic flow and minimize delay. Based on state measurements, the controller dynamically assigns an optimal headway value for each freeway section within a control cycle. In a freeway simulation example, we first demonstrate that different nondynamic headway assignment strategies failed to avoid congestion and traffic breakdown. We then present a dynamic headway control strategy based on deep reinforcement learning (DRL) that adapts the desired headway according to the changing traffic conditions on both the freeway and the ramp to effectively maximize traffic flow and minimize system delay. We quantitatively demonstrate that our DRL dynamic headway control strategy improved traffic and reduced system delay by up to 57% compared with the examined nondynamic headways.
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.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 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".