Papers › Data-Driven Models for Traffic Flow at Junctions
Data-Driven Models for Traffic Flow at Junctions
Michael Herty, Niklas Kolbe
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The simulation of traffic flow on networks requires knowledge on the behavior across traffic intersections. For macroscopic models based on hyperbolic conservation laws there exist nowadays many ad-hoc models describing this behavior. Based on real-world car trajectory data we propose a new class of data-driven models with the requirements of being consistent to networked hyperbolic traffic flow models. To this end the new models combine artificial neural networks with a parametrization of the solution space to the half-Riemann problem at the junction. A method for deriving density and flux corresponding to the traffic close to the junction for data-driven models is presented. The models parameter are fitted to obtain suitable boundary conditions for macroscopic first and second-order traffic flow models. The prediction of various models are compared considering also existing coupling rules at the junction. Numerical results imposing the data-fitted coupling models on a traffic network are presented exhibiting accurate predictions of the new models.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections