Development and Evaluation of Connected-Vehicle-Enabled Optimal Dynamic Path Planning with Bus Stops
Bibliographic record
Abstract
The frequent stops of transit buses significantly block lanes on roads and generate vehicle queues behind. The passenger cars traveling behind buses may be stuck in the queues and miss the green light in the downstream intersection. They will be very tempted to make lane changes to avoid the stopping vehicles efficiently. However, without knowing the information of bus stations and traffic signals, it is very difficult and dangerous for the queued vehicles to make lane changes at last minute. In this paper, an optimal dynamic path planning system will be developed to assist passenger cars avoid buses so as to improve their mobility on local roads. The system utilizes connected vehicles to receive stop information, including times, duration, and locations, of buses, and the signal timing information from intersections. The information is applied to predict the delay of connected vehicles caused by the buses and intersections. The system also estimate optimal paths for the target vehicles to make lane changes and overpass the buses and the downstream intersection to minimize its travel time delay. In this paper, both synthetic and realistic examples are designed with microscopic traffic simulations to evaluate the performance of the proposed system. The results indicate that the travel time delay for connected vehicles can be reduced by up to 35%. In addition, a sensitivity analysis of the market penetration rates of connected vehicles and demand levels is conducted to understand the benefits and reliability of the system under different stages of the connected environment.
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.006 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".