The Observability Problem in Traffic Network Models

Enrique Castillo · Antonio J. Conejo · José María Menéndez · Pilar Jiménez

125 citations0/0 files storedComputer-Aided Civil and Infrastructure Engineering

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Traffic Prediction and Management Techniques

Abstract

Abstract: This article deals with the problem of observability of traffic networks, understanding as such the problem of identifying which is the subset of OD-pair and link flows that can be calculated based on a subset of observed OD-pair and link flows and related problems. Two algebraic methods for solving the observability problems are given, one global approach based on null-spaces and a step by step procedure allowing updating the information once each item of information (OD-pair or link flow) becomes available. In particular, seven different observability problems are stated and solved using the proposed methods, which are illustrated by their application to the Nguyen-Dupuis network problem. The results show that the proposed methods provide useful information on which OD-pair or link flows are informative on other OD-pair and link flows, and that the methods are applicable to large networks.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 125 citations exist upstream.

References

1992Estimation of origin-destination matrices from link traffic counts on congested networks 1998Optimal traffic counting locations for origin–destination matrix estimation 2007Trip matrix and path flow reconstruction and estimation based on plate scanning and link observations 2005The optimisation of traffic count locations in road networks

Cited by

2014Assessing partial observability in network sensor location problems 2008The Observability Problem in Traffic Models: Algebraic and Topological Methods 2013A graphical approach to identify sensor locations for link flow inference 2012Integration of Environmental Objectives in a System Optimal Dynamic Traffic Assignment Model 2016Heterogeneous sensor location model for path reconstruction 2014A generalized sensor location model for the estimation of network origin–destination matrices 2012A network sensor location procedure accounting for o–d matrix estimate variability 2018Statistical inference of probabilistic origin-destination demand using day-to-day traffic data

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.