Sign inGet started
Paper · arXiv

Simulation-Free Estimation of Traffic Flows from Sparse Count Data

We propose a method for estimating time-varying traffic flow patterns from sparse aggregated vehicle counts. The method partitions the study area into spatial regions, constructs a set of feasible region-to-region routes, and solves a weighted least-squares optimization problem to determine the number of vehicles to allocate on each route. A weighted contribution matrix encodes sensor coverage, steering the optimizer toward flow configurations that are directly observable by sensors. Edge-level trajectories are then derived by scoring candidate routes against the temporal and volumetric profiles of aggregated regional sensor counts. The method is evaluated on the Brussels road network usi...

AuthorsDavide Guastella, Gianluca Bontempi
Primary categorycs.LG
Published22 June 2026
Last updated at source22 June 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f04dafd9-95d5-41e4-931f-7dcac029224c" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.