Merging Sequence Optimization Based on Reverse Auction Theory and Merging Strategy with Active Trajectory Adjustment of Heterogeneous Vehicles
Bibliographic record
Abstract
This paper investigates the optimized merging sequence (MS) and on-ramp merging strategy in mixed traffic with vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I). To this end, a cooperative merging sequence optimization method is first proposed based on the reverse auction. In the method, a hybrid optimized computing structure is proposed to provide the foundation for connected and human-driving vehicles (CHVs) and connected and automated vehicles (CAVs) to obtain the MS more efficiently. And a cooperative merging strategy based on all cooperative merging vehicles under mixed traffic conditions is proposed. In particular, the downstream vehicles in the strategy can change their original velocities to actively participate in the cooperative merging process according to the merging requirements of on-ramp vehicles. And the vehicles in this strategy are all subject to state constraints to avoid the adverse effects of cooperative merging behavior on the following traffic on the main road. Results of numerical experiments illustrate that the merging sequence optimization method can reduce the time to obtain the optimal MS, and the increased computational efficiency is affected by CAV penetration. In addition, in mixed traffic conditions, the cooperative merging strategy can reduce fuel consumption and the time required for merging.
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.000 |
| 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.002 | 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".