Deriving the Upper Bound of the Number of Sensors Required to Know All Link Flows in a Traffic Network
- 16 January 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 14 (2), 761-771
- https://doi.org/10.1109/tits.2012.2233474
Abstract
It is demonstrated that the minimum number of sensors required to know all link flows in a traffic network can be determined only if path information is available. However, not all paths need to be enumerated but, at most, a small subset defining the rank rw of the link-path incidence matrix W. If this rank for a reduced subset of paths is already m - n , where m and n are the number of links and noncentroid nodes, respectively, we can conclude that m - n sensors are sufficient. It is also shown that the formulas providing the dependent link flows in terms of the independent link flows can be obtained by the node-based or path-based approaches with the same results only when rw = m - n . Finally, an algorithm to obtain the small subsets of linearly independent path vectors is given. The methods are shown by a parallel network example and the Ciudad Real and Cuenca networks, for which the savings in link counts with respect to the m - n bound are larger than 16%. The corresponding savings in path enumeration are larger than 80%.Keywords
This publication has 22 references indexed in Scilit:
- Synergistic sensor location for link flow inference without path enumeration: A node-based approachTransportation Research Part B: Methodological, 2012
- Matrix Tools for General Observability Analysis in Traffic NetworksIEEE Transactions on Intelligent Transportation Systems, 2010
- Sensor Coverage and Location for Real-Time Traffic Prediction in Large-Scale NetworksTransportation Research Record: Journal of the Transportation Research Board, 2007
- The optimisation of traffic count locations in road networksTransportation Research Part B: Methodological, 2006
- Number and Location of Sensors for Real-Time Network Traffic Estimation and Prediction: Sensitivity AnalysisTransportation Research Record: Journal of the Transportation Research Board, 2006
- Estimation of Multiclass Origin-Destination Matrices from Traffic CountsJournal of Urban Planning and Development, 2005
- Fixed Point Approaches to the Estimation of O/D Matrices Using Traffic Counts on Congested NetworksTransportation Science, 2001
- Evaluation of Count Location Selection Methods for Estimation of O-D MatricesJournal of Transportation Engineering, 1998
- Optimal traffic counting locations for origin–destination matrix estimationTransportation Research Part B: Methodological, 1998
- A unified framework for estimating or updating origin/destination matrices from traffic countsTransportation Research Part B: Methodological, 1988