Sparse Bayesian Learning Assisted Approaches for Road Network Traffic State Estimation

被引:16
作者
Babu, C. Narendra [1 ]
Sure, Pallaviram [2 ]
Bhuma, Chandra Mohan [3 ]
机构
[1] MS Ramaiah Univ Appl Sci, Fac Engn & Technol, Dept Comp Sci Engn, Bengaluru 560058, India
[2] MS Ramaiah Univ Appl Sci, Fac Engn & Technol, Dept Elect & Commun Engn, Bengaluru 560058, India
[3] Acharya Nagarjuna Univ, Bapatla Engn Coll, Guntur 522102, Andhra Pradesh, India
关键词
Roads; State estimation; Sparse matrices; Kernel; Probes; Sensors; Relevance vector machine; sparse Bayesian learning; block sparsity; traffic state estimation; FLOW;
D O I
10.1109/TITS.2020.2971031
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
Real-time (online) road network traffic state estimation plays a vital role in enhancing the services offered by Intelligent Transportation Systems (ITS). Spatio-temporal data vacancies of contemporary acquisition systems considerably limit the reliability of online traffic state estimation. Online estimation insists smaller temporal frame widths inhibiting the accuracies of low rank matrix reconstruction approaches, while matrix imputation methods do not capture the non-trivial traffic data relationships. Alternatively, this paper investigates traffic state estimation by constructing sparse representations via Sparse Bayesian Learning (SBL) and Block SBL (BSBL) approaches to accommodate under-sampled data, independent of the acquisition type. Appropriate kernel matrices are determined by leveraging historical spatio-temporal correlations among the road network traffic data. Subsequently, unavailable traffic states are estimated from predictive distributions. The estimates are further pruned by kalman filter that corroborates online processing. With the SBL approach, experiments on PeMS traffic data demonstrate less than 6% Normalized Mean Absolute Error (NMAE) for a Signal Integrity (SI) of 0.5. Compared to the state-of-the-art approaches, this value is significantly better. BSBL approach gives similar error performance as SBL despite a SI of 0.26, at the cost of increased computational time. The NMAE from kalman filtered SBL (SBL+K) approach is less than 3.5% in contrast to 4.5% from kalman filtered BSBL (KBSBL) approach, thus demonstrating SBL+K approach as a good compromise between NMAE and computational time, facilitating more accurate online traffic state estimation.
引用
收藏
页码:1733 / 1741
页数:9
相关论文
共 25 条
[1]  
[Anonymous], 2010, P IEEE GLOB TEL C GL
[2]  
Bishop C. M., 2006, PATTERN RECOGN
[3]  
California Department of Transportation, CALTR PERF MEAS SYST
[4]   Low-Dimensional Models for Traffic Data Processing Using Graph Fourier Transform [J].
Chindanur, Narendra Babu ;
Sure, Pallaviram .
COMPUTING IN SCIENCE & ENGINEERING, 2018, 20 (02) :24-37
[5]   NEAREST NEIGHBOR PATTERN CLASSIFICATION [J].
COVER, TM ;
HART, PE .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1967, 13 (01) :21-+
[6]  
Hayes M. H., 2009, Statistical digital signal processing and modeling
[7]  
Imani M., 2018, ADV NEURAL DYN, P8146
[8]   Particle filters for partially-observed Boolean dynamical systems [J].
Imani, Mandi ;
Braga-Neto, Ulisses M. .
AUTOMATICA, 2018, 87 :238-250
[9]   On Particle Methods for Parameter Estimation in State-Space Models [J].
Kantas, Nikolas ;
Doucet, Arnaud ;
Singh, Sumeetpal S. ;
Maciejowski, Jan ;
Chopin, Nicolas .
STATISTICAL SCIENCE, 2015, 30 (03) :328-351
[10]   Compressive Sensing Approach to Urban Traffic Sensing [J].
Li, Zhi ;
Zhu, Yanmin ;
Zhu, Hongzi ;
Li, Minglu .
31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, :889-898