arXiv:2607. 20549v1 Announce Type: new Abstract: Trajectory datasets used in ADAS evaluation are heavily biased toward routine driving; genuine vehicle-to-vehicle conflict events are rare, and the rarer the event, the higher the cost when an ADAS system fails to handle it.
By Eni Solomon Laughter
arXiv:2609.13941v1 Announce Type: new
Abstract: We present BLInD (Blind Learned Intent Distribution), a compact network that maps recent vehicle-state history (e.g. speed, curvature, indicator, and v...
By Flavian Pegado, Ronit Hire, Shreyas Rajesh, Soham Phade
The paper introduces the Markov Chain Car‑Following (MC‑CF) model, an empirical probabilistic approach that represents car‑following as a Markov process and samples accelerations from empirical distributions within discretized state bins. Evaluation on the Waymo Open Motion Dataset shows that MC‑CF variants outperform physics‑based baselines and compete with modern data‑driven methods in both one‑step and open‑loop trajectory prediction. Zero‑shot transfer to the Naturalistic Phoenix dataset and microscopic ring‑road simulations demonstrate cross‑domain generalization and scalability, with the model reducing collisions and reproducing naturalistic shockwave propagation.
By Sungyong Chung, Yanlin Zhang, Nachuan Li, Dana Monzer, Alireza Talebpour
arXiv:2606. 31209v1 Announce Type: new Abstract: Interactive traffic simulation is a vital world model for autonomous driving.
By Lingyu Xiao, Zexin Feng, Xintao Yan
The paper introduces Nomad, a transfer-and-ground framework for generating human mobility trajectories without target-city trajectory data. It learns relative transitions from source cities using POI attributes and then grounds these transitions onto a target city’s POI map via a behavior graph and exploration–return walk. Experiments across ten cities show Nomad improves trajectory fidelity and downstream utility by roughly 15% and 3% respectively over adaptation baselines.
By Yidi Wang, Yunhe Zhang, Bangchao Deng, Dingqi Yang, Pengyang Wang
The paper introduces Bridge Graphical Models (BGMs), a framework that decomposes continuous‑time generative models into independent design choices: endpoint coupling, bridge law, Markovian projection, and current‑preserving dynamics. It defines the Markovization gap as the time‑integrated conditional variance of bridge velocity given the Markov state, quantifying an irreducible loss before training. Experiments on synthetic, latent, and pixel‑space tasks (CIFAR‑10 and Fashion‑MNIST) show that a feature‑space proxy of this gap, estimated quickly before training, predicts downstream training loss and FID in the same direction as full training results.
By Tiantian Zhang