A Two-Level Model for Traffic Signal Timing and Trajectories Planning of Multiple CAVs in a Random Environment
Bibliographic record
Abstract
Connected and automated vehicles (CAVs) trajectories not only provide more real-time information by vehicles to infrastructure but also can be controlled and optimized, to further save travel time and gasoline consumption. This paper proposes a two-level model for traffic signal timing and trajectories planning of multiple connected automated vehicles considering the random arrival of vehicles. The proposed method contains two levels, i.e., CAVs’ arrival time and traffic signals optimization, and multiple CAVs trajectories planning. The former optimizes CAVs’ arrival time and traffic signals in a random environment, to minimize the average vehicle’s delay. The latter designs multiple CAVs trajectories considering average gasoline consumption. The dynamic programming (DP) and the General Pseudospectral Optimal Control Software (GPOPS) are applied to solve the two-level optimization problem. Numerical simulation is conducted to compare the proposed method with a fixed-time traffic signal. Results show that the proposed method reduces both average vehicle’s delay and gasoline consumption under different traffic demand significantly. The average reduction of vehicle’s delay and gasoline consumption are 26.91% and 10.38%, respectively, for a two-phase signalized intersection. In addition, sensitivity analysis indicates that the minimum green time and free-flow speed have a noticeable effect on the average vehicle’s delay and gasoline consumption.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| 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.000 | 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 teacher head, 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".