Name
Abstract | ||
|---|---|---|
This article deals with the problem of observability of traffic networks, understanding as such the problem of identifying if a set of available flow measurements is sufficient to estimate the remaining flows in the network, OD-pair or link flows. An algebraic method for solving the observability problems is given. Specifically, a step by step procedure allowing updating the information once each item of information (OD-pair or link flow) becomes available. The method is illustrated by its application to a simple network. The results show that the proposed method provide useful information on which OD pair or link flows are informative on other OD pair and link flows, and that the method is applicable to large networks due to its numerical robustness and stability. |
Year | Venue | Keywords |
|---|---|---|
2010 | ICAART 2010: PROCEEDINGS OF THE 2ND INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1: ARTIFICIAL INTELLIGENCE | Traffic model, Link flow estimation, OD flow estimation, Algebraic methods, Artificial intelligence |
Field | DocType | Citations |
Observability,Mathematical optimization,Algebraic number,Computer science | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pilar Jiménez | 1 | 40 | 3.93 |
| Santos Sánchez-Cambronero | 2 | 79 | 6.52 |
| Inmaculada Gallego | 3 | 32 | 3.31 |
| Ana Rivas | 4 | 31 | 3.23 |