ℓ1-minimization method for link flow correction

Abstract A computational method, based on l 1 -minimization, is proposed for the problem of link flow correction, when the available traffic flow data on many links in a road network are inconsistent with respect to the flow conservation law. Without extra information, the problem is generally ill-posed when a large portion of the link sensors are unhealthy. It is possible, however, to correct the corrupted link flows accurately with the proposed method under a recoverability condition if there are only a few bad sensors which are located at certain links. We analytically identify the links that are robust to miscounts and relate them to the geometric structure of the traffic network by introducing the recoverability concept and an algorithm for computing it. The recoverability condition for corrupted links is simply the associated recoverability being greater than 1. In a more realistic setting, besides the unhealthy link sensors, small measurement noises may be present at the other sensors. Under the same recoverability condition, our method guarantees to give an estimated traffic flow fairly close to the ground-truth data and leads to a bound for the correction error. Both synthetic and real-world examples are provided to demonstrate the effectiveness of the proposed method.

[1]  Ali Mekky.  Forecasting Balanced Highway Volumes Using Modeling Packages and Spreadsheets , 1996 .

[2]  Jack Xin,et al.  Iterative $\ell_1$ minimization for non-convex compressed sensing , 2016 .

[3]  Jack Xin,et al.  Point Source Super-resolution Via Non-convex $$L_1$$L1 Based Methods , 2016, J. Sci. Comput..

[4]  Srinivas Peeta,et al.  Identification of vehicle sensor locations for link-based network traffic applications , 2009 .

[5]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[6]  Matthias Hein,et al.  An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA , 2010, NIPS.

[7]  Zhe Sun,et al.  Network sensor health problem , 2016 .

[8]  Enrique F. Castillo,et al.  Link Flow Estimation in Traffic Networks on the Basis of Link Flow Observations , 2011, J. Intell. Transp. Syst..

[9]  Junfeng Yang,et al.  Alternating Direction Algorithms for 1-Problems in Compressive Sensing , 2009, SIAM J. Sci. Comput..

[10]  Dragana Miljkovic,et al.  Examination of Methods That Adjust Observed Traffic Volumes on a Network , 2000 .

[11]  Stephen P. Boyd,et al.  Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers , 2011, Found. Trends Mach. Learn..

[12]  Ao Tang,et al.  Sparse Error Correction From Nonlinear Measurements With Applications in Bad Data Detection for Power Networks , 2013, IEEE Transactions on Signal Processing.

[13]  Henk J van Zuylen,et al.  CONSISTENT LINK FLOW ESTIMATION FROM COUNTS , 1982 .

[14]  Jack Xin,et al.  Minimization of ℓ1-2 for Compressed Sensing , 2015, SIAM J. Sci. Comput..

[15]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[16]  Michael G. McNally,et al.  The Four Step Model , 2007 .

[17]  Cade Braud,et al.  Traffic signal timing manual. , 2008 .

[18]  Jack Xin,et al.  Iterative ℓ1 minimization for non-convex compressed sensing , 2016, ArXiv.

[19]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[20]  Manwo Ng.  Synergistic sensor location for link flow inference without path enumeration: A node-based approach , 2012 .

[21]  E. Candès.  The restricted isometry property and its implications for compressed sensing , 2008 .

[22]  Shinya Kikuchi,et al.  Method for Balancing Observed Boarding and Alighting Counts on a Transit Line , 2006 .

[23]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[24]  E. Candès,et al.  Error correction via linear programming , 2005, FOCS 2005.

[25]  Anthony Chen,et al.  Norm approximation method for handling traffic count inconsistencies in path flow estimator , 2009 .

[26]  Fred L. Mannering,et al.  The statistical analysis of crash-frequency data: A review and assessment of methodological alternatives , 2010 .

[27]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[28]  C. Lindsey.  Do Economists Reach A Conclusion on Road Pricing? The Intellectual History of an Idea , 2006 .

[29]  M J Lighthill,et al.  On kinematic waves II. A theory of traffic flow on long crowded roads , 1955, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[30]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[31]  Lelitha Vanajakshi,et al.  Loop Detector Data Diagnostics Based on Conservation-of-Vehicles Principle , 2004 .

[32]  P. I. Richards.  Shock Waves on the Highway , 1956 .

[33]  H. Weinberger.  Variational Methods for Eigenvalue Approximation , 1974 .