Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Compressive Origin-Destination Matrix Estimation (1404.3263v3)

Published 12 Apr 2014 in cs.SY and math.DS

Abstract: The paper presents an approach to estimate Origin-Destination (OD) flows and their path splits, based on traffic counts on links in the network. The approach called Compressive Origin-Destination Estimation (CODE) is inspired by Compressive Sensing (CS) techniques. Even though the estimation problem is underdetermined, CODE recovers the unknown variables exactly when the number of alternative paths for each OD pair is small. Noiseless, noisy, and weighted versions of CODE are illustrated for synthetic networks, and with real data for a small region in East Providence. CODE's versatility is suggested by its use to estimate the number of vehicles and the Vehicle-Miles Traveled (VMT) using link counts.

Citations (5)

Summary

We haven't generated a summary for this paper yet.