Papers
Topics
Authors
Recent
Search
2000 character limit reached

Compressive Origin-Destination Matrix Estimation

Published 12 Apr 2014 in cs.SY and math.DS | (1404.3263v3)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.