Abstract

Large-scale traffic systems require techniques that are able to 1) deal with high amounts of data and heterogenous data coming from different types of sensors, 2) provide robustness in the presence of sparse sensor data, 3) incorporate different models that can deal with various traffic regimes, and 4) cope with multimodal conditional probability density functions (pdfs) for the states. Often, centralized architectures face challenges due to high communication demands. This paper develops new estimation techniques that are able to cope with these problems of large traffic network systems. These are parallelized particle filters (PPFs) and a parallelized Gaussian sum particle filter (PGSPF) that are suitable for online traffic management. We show how complex pdfs of the high-dimensional traffic state can be decomposed into functions with simpler forms and how the whole estimation problem solved in an efficient way. The proposed approach is general, with limited interactions, which reduce the computational time and provide high estimation accuracy. The efficiency of the PPFs and PGSPFs is evaluated in terms of accuracy, complexity, and communication demands and compared with the case where all processing is centralized.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call