A Mixed Equilibrium Model and Optimal Path Platooning Method for CAV Platoons in Heterogeneous Traffic Flow
Bibliographic record
Abstract
As the emergence of the connected and autonomous vehicles (CAVs), the platooning technology is believed to play a key role in the future intelligent transportation system. However, current studies mainly focus on the beneficial sides of CAV platoons, and less attention is given to their negative effects. This study develops a mixed equilibrium model for CAV platoons and human-driven vehicles (HDVs), which consider both the positive and negative sides of CAV platooning. On the positive side, CAV platoons are assumed to follow user equilibrium (UE) route choice for their information advantages, while HDVs to follow stochastic user equilibrium (SUE). CAV platoons are also presumed to improve the road capacity. On the negative side, the speed of CAV platoons is slower than that of HDVs for safety stakes, which will impede the latter to overtake. The HDVs is split up into overtaking and nonovertaking flows with different speeds. Furthermore, the model is built up as a mixed UE-SUE equilibrium problem and reformulated as a nonlinear complementarity problem. In addition, an optimal path platooning method is proposed to reduce the negative effects, by integrating travel costs of both CAV platoons and HDVs into its objective function. Numerical results show that the introduction of CAV platoons may increase the travel cost at the initial stage, and the proposed method can effectively reduce the platooning disturbance, thus helps promoting the wider applications of CAV platoons.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.005 | 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".