TY - CHAP
T1 - Identification of network sensor locations for estimation of traffic flow
AU - Zhu, Senlai
AU - Cheng, Lin
AU - Chu, Zhaoming
AU - Chen, Anthony
AU - Chen, Jingxu
PY - 2014/1/1
Y1 - 2014/1/1
N2 - This paper addresses the network sensor location prohlem (NSLP) for identifying the set of sensor locations that minimizes the variability in estimation of traffic flow given budget constraints. The trace of the covariance matrix is adopted as a measure of variability in traffic flow. On the basis of the trace of the covariance matrix in the posterior estimation of traffic flow conditional on a given set of sensor locations, the general form of the NSLP is derived. As an illustration, the multivariate normal distribution for the prior estimation of traffic flow is assumed. In this case, the actual value of the counted flows is not required. Furthermore, an incremental method that can avoid matrix inversion and give priorities of the identified sensor locations is presented to solve the NSLP. Finally, a numerical example based on the Nguyen-Dupuis network illustrates the NSLP approach and clarifies some of its implementation details.
AB - This paper addresses the network sensor location prohlem (NSLP) for identifying the set of sensor locations that minimizes the variability in estimation of traffic flow given budget constraints. The trace of the covariance matrix is adopted as a measure of variability in traffic flow. On the basis of the trace of the covariance matrix in the posterior estimation of traffic flow conditional on a given set of sensor locations, the general form of the NSLP is derived. As an illustration, the multivariate normal distribution for the prior estimation of traffic flow is assumed. In this case, the actual value of the counted flows is not required. Furthermore, an incremental method that can avoid matrix inversion and give priorities of the identified sensor locations is presented to solve the NSLP. Finally, a numerical example based on the Nguyen-Dupuis network illustrates the NSLP approach and clarifies some of its implementation details.
UR - http://www.scopus.com/inward/record.url?scp=84938564389&partnerID=8YFLogxK
U2 - 10.3141/2443-04
DO - 10.3141/2443-04
M3 - Chapter in an edited book (as author)
T3 - Transportation Research Record
SP - 32
EP - 39
BT - Transportation Research Record
PB - National Research Council
ER -