Joint Dynamic Lane Reversal and Variable Speed Limit Control: A Graphormer-Based Approach
Read the original on Hugging Face Trending Papers →The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The Flow has not summarised this story yet — read it at Hugging Face Trending Papers.
The paper proposes a graph-based method for jointly controlling dynamic lane reversal and variable speed limits in traffic networks, ensuring the network remains strongly connected during lane changes. It introduces a transformer model with Global Endpoint Relation-Aware Spatio-Temporal Self-Attention (GERASTSA) that is pretrained on traffic forecasting and fine-tuned with proximal policy optimization. Experiments on a 6×6 grid show the learned policy can make two-thirds of roads one-way during peak hours, reducing daily delay by up to 90% compared to a fixed configuration.
arXiv:2412.02520v4 Announce Type: replace-cross Abstract: Connected automated vehicles (CAVs) equipped with adaptive cruise control (ACC) create new opportunities for highway congestion mitigation. T...
arXiv:2607. 09740v1 Announce Type: new Abstract: Safe motion planning in advanced driver-assistance systems and autonomous vehicles requires an accurate understanding of how the surrounding traffic scene is likely to evolve.
GRID‑Planner introduces a graph‑structured relational reward shaping framework for diffusion‑based autonomous driving planning. By integrating graph‑aware importance weighting, a time‑indexed relational reward surrogate, and an advantage‑weighted diffusion objective with on‑policy self‑distillation, it forms a rollout‑return‑advantage‑update loop that eliminates explicit likelihoods. Experiments on nuPlan and interPlan demonstrate significant reductions in collision rate, lane deviation, and jerk, along with a 3.4% improvement in overall planning score.
arXiv:2607. 03703v1 Announce Type: new Abstract: Reinforcement Learning (RL) has emerged as a powerful paradigm for adaptive traffic signal control.
The paper introduces a gated graph attention network (GAT) to better explain spatial information flow in short‑term traffic forecasting models. By adding a gate that learns how much of a sensor’s updated state comes from its neighbors versus itself, the authors can progressively withdraw neighbor information and observe its impact on accuracy. Applied to the ST‑MetaNet architecture on data from 498 loop detectors in England, the gated GAT shows that neighbor influence is higher for busy sensors, improves accuracy slightly with mild regularisation, and reveals that the two GAT layers are largely redundant.