.png){kind=icon}
.png){kind=icon}
Return
The observability problem in traffic network models
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1467-8667.2008.00531.x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
ORIGIN-DESTINATION MATRICES
STATE ESTIMATION
IDENTIFICATION
ALGORITHM
LOCATIONS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
9.1
Papers:
2.0K
Citations:
10.0K