Optimized path planning and scheduling strategies for connected and automated vehicles at single-lane roundabouts.
DOI: 10.1371/journal.pone.0309732
archive: archived pipeline: cataloged verified
Get this paper ↗ (DOI — opens at the source; we link to it, we don't host it)
Summary
This study addresses the challenge of cooperative driving for connected and automated vehicles (CAVs) at single-lane roundabouts, aiming to improve traffic efficiency and reduce fuel consumption while ensuring safety. While roundabouts generally offer lower accident rates than signalized intersections, their limited capacity and driver unfamiliarity often lead to delays. Existing research has largely focused on individual vehicle navigation or simple first-come, first-served scheduling, neglecting integrated multi-vehicle coordination and comprehensive path planning. This paper proposes a centralized optimization method that combines geometric path planning with speed control strategies to manage complex multi-vehicle interactions. The methodology begins with a geometric path planning approach to define vehicle trajectories and identify conflict points within the roundabout. The authors establish a roundabout model divided into detection, pre-control, and control areas, assuming ideal communication conditions with no delay or packet loss. Vehicle dynamics are modeled as second-order linear systems considering longitudinal motion only, with constraints on acceleration, deceleration, and a maximum entry speed of 10 m/s. The core innovation involves mapping the optimal arrival times at conflict points to optimal entry times, thereby simplifying multi-vehicle coordination into a speed control problem. Using the Pontryagin minimum principle, the authors develop two speed optimization strategies. They analyze four potential traffic scenarios to determine optimal arrival times, incorporating a minimum safety time interval of 0.2 seconds to prevent collisions. The system identifies conflicts by comparing vehicle arrival times and adjusts the speed of trailing vehicles to maintain safe intervals. Simulation analysis conducted in MATLAB demonstrates that the proposed control strategy effectively identifies potential conflicts and implements optimal speed adjustments. The results indicate that vehicles can navigate the roundabout efficiently in terms of both time and fuel consumption without collisions. The strategy successfully handles rear-end collision risks for vehicles in the same lane and side-swipe risks for vehicles from different lanes by enforcing the 0.2-second minimum time interval. The study extends the fusion problem from two vehicles at a single conflict point to multiple vehicles at multiple conflict points, realizing efficient scheduling for complex traffic scenarios. The significance of this work lies in its provision of a practical, centralized optimization framework for CAVs at single-lane roundabouts. By transforming complex spatial coordination into temporal speed control, the method reduces computational complexity while ensuring safety and efficiency. This approach offers a viable solution for enhancing roundabout capacity through cooperative driving technologies, addressing gaps in previous studies that failed to integrate path planning with multi-vehicle scheduling. The findings support the broader application of CAVs in urban traffic management, particularly in intersections where traditional signaling is inefficient or costly.
Provenance
The full processing record for this entry. Every stage of this paper's journey through the pipeline is logged — what ran, with which tool and model, how many attempts it took, and when it last completed.
| Stage | Outcome | Tool | Model | Prompt | Attempts | Completed |
|---|---|---|---|---|---|---|
| discover | success | DOAJ | — | — | 1 | 2026-06-25 |
| archive | success | unpaywall | — | — | 1 | 2026-06-26 |
| extract | success | cached | — | — | 2 | 2026-06-26 |
| clean | success | clean | — | — | 1 | 2026-06-25 |
| chunk | success | chunk | — | — | 1 | 2026-06-25 |
| embed | success | embed | Qwen/Qwen3-Embedding-8B | — | 1 | 2026-06-25 |
| promote | success | — | — | — | 1 | 2026-06-25 |
| summarize | success | llm | qwen3.6-27b-prismaquant | summ-v5 | 1 | 2026-06-26 |
| tag | success | vector_similarity | — | — | 6 | 2026-06-25 |
| verify | success | — | — | — | 1 | 2026-06-26 |
Summary generated by qwen3.6-27b-prismaquant on 2026-06-26; verification: verified.
Topics
Ranked by relevance to this paper. Hover a topic for its definition.