ICAART 2010 - 2nd International Conference on Agents and Artificial Intelligence, Proceedings
- Volumen: 1
- Fecha: 09 septiembre 2010
- Páginas: 560-567
- ISBN: 9789896740221
- Tipo de fuente: Ponencia
- Tipo de documento: Documento de conferencia
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.