<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Future Transp.</journal-id>
<journal-title>Frontiers in Future Transportation</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Future Transp.</abbrev-journal-title>
<issn pub-type="epub">2673-5210</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">766951</article-id>
<article-id pub-id-type="doi">10.3389/ffutr.2021.766951</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Future Transportation</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Multi-Sensor Data Fusion for Accurate Traffic Speed and Travel Time Reconstruction</article-title>
<alt-title alt-title-type="left-running-head">Kessler&#x2009; et&#x20;al.</alt-title>
<alt-title alt-title-type="right-running-head">Multi-Sensor Data Fusion</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Kessler&#x2009;</surname>
<given-names>Lisa</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1456538/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Rempe&#x2009;</surname>
<given-names>Felix</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1514356/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Bogenberger&#x2009;</surname>
<given-names>Klaus</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1245966/overview"/>
</contrib>
</contrib-group>
<aff id="aff1">
<label>
<sup>1</sup>
</label>Chair of Traffic Engineering and Control, Technical University of Munich, <addr-line>Munich</addr-line>, <country>Germany</country>
</aff>
<aff id="aff2">
<label>
<sup>2</sup>
</label>BMW Group, Mobility Technologies, <addr-line>Munich</addr-line>, <country>Germany</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/820877/overview">Xiao Han</ext-link>, Beijing Jiaotong University, China</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1470920/overview">Bin Jia</ext-link>, Beijing Jiaotong University, China</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/977310/overview">Anastasios Kouvelas</ext-link>, ETH Z&#xfc;rich, Switzerland</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Lisa Kessler&#x2009;, <email>lisa.kessler@tum.de</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Transportation Systems Modeling, a section of the journal Frontiers in Future Transportation</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>21</day>
<month>10</month>
<year>2021</year>
</pub-date>
<pub-date pub-type="collection">
<year>2021</year>
</pub-date>
<volume>2</volume>
<elocation-id>766951</elocation-id>
<history>
<date date-type="received">
<day>30</day>
<month>08</month>
<year>2021</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>10</month>
<year>2021</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2021 Kessler&#x2009;, Rempe&#x2009; and Bogenberger&#x2009;.</copyright-statement>
<copyright-year>2021</copyright-year>
<copyright-holder>Kessler&#x2009;, Rempe&#x2009; and Bogenberger&#x2009;</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these&#x20;terms.</p>
</license>
</permissions>
<abstract>
<p>This paper studies the joint reconstruction of traffic speeds and travel times by fusing sparse sensor data. Raw speed data from inductive loop detectors and floating cars as well as travel time measurements are combined using different fusion techniques. A novel fusion approach is developed, which extends existing speed reconstruction methods to integrate low-resolution travel time data. Several state-of-the-art methods and the novel approach are evaluated on their performance in reconstructing traffic speeds and travel times using various combinations of sensor data. Algorithms and sensor setups are evaluated with real loop detector, floating car and Bluetooth data collected during severe congestion on German freeway A9. Two main aspects are examined: 1) which algorithm provides the most accurate result depending on the used data and 2) which type of sensor and which combination of sensors yields highest estimation accuracy. Results show that, overall, the novel approach applied to a combination of floating-car data and loop data provides the best speed and travel time accuracy. Furthermore, a fusion of sources improves the reconstruction quality in many, but not all cases. In particular, Bluetooth data only provide a benefit for reconstruction purposes if integrated subtly.</p>
</abstract>
<kwd-group>
<kwd>traffic state estimation</kwd>
<kwd>speed reconstruction</kwd>
<kwd>travel times</kwd>
<kwd>data fusion</kwd>
<kwd>floating car data</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>For various applications in traffic engineering, it is fundamental to know about the traffic conditions on a road stretch with high certainty and sufficient spatio-temporal accuracy. A complete representation of traffic conditions is especially crucial for understanding traffic flow, for the effectivity analysis of control measures and for training data-driven prediction models. In contrast to real-time or predictive state estimation, these applications are usually applied retrospectively.</p>
<p>The retrospective analysis often focuses on average vehicle speeds per time and space interval on a road since this provides benefits such as enabling the deduction of travel times for road users, providing jam tail warnings (<xref ref-type="bibr" rid="B29">Rempe et&#x20;al., 2017b</xref>) aiming at the reduction of rear-end collisions at jam tails, etc. However, using current sensor technology, average vehicle speeds are not measured for all times and places on a road stretch. Rather, various types of sensors are available that provide traffic-related data at different times for different places. Raw sensor data must therefore be processed in order to determine an accurate reconstruction of traffic conditions.</p>
<p>Nowadays, several sensor technologies are in place that gather data, each coming with advantages and limitations when applied. Induction loops, that are buried in the road surface, provide very exact and reliable speed information but are mainly limited to few road stretches since the installation and maintenance costs are high. Floating-Car Data (FCD), also called probe data, are gathered from vehicles or smartphones that determine their position <italic>via</italic> Global Navigation Satellite Systems (GNSS) and report this position on a regular basis to a central server. Time and space differences allow for reconstructing the probe&#x2019;s speed profile on a road. FCD are available wherever traffic is flowing, but represent only a sub-sample of the whole fleet. With WiFi/Bluetooth (BT) sensor technology, the unique hardware address of a device that passes two neighboring stations is registered, allowing the derivation of the travel time and therefore the average speed of devices that pass two neighboring stations (<xref ref-type="bibr" rid="B13">Haghani et&#x20;al., 2010</xref>; <xref ref-type="bibr" rid="B5">Barcelo et&#x20;al., 2010</xref>; <xref ref-type="bibr" rid="B26">Martchouk et&#x20;al., 2011</xref>; <xref ref-type="bibr" rid="B23">Lesani et&#x20;al., 2016</xref>; <xref ref-type="bibr" rid="B25">Margreiter, 2018</xref>). BT installation is not expensive but &#x2013; like FCD &#x2013; the receivers do not collect information from all vehicles and additionally, since they are conceivably placed several kilometers apart from each other, the average speed can be less granular.</p>
<p>Measuring traffic conditions with various sensors offers a great opportunity to increase the accuracy of traffic state estimates. However, the mentioned differences and characteristics of each technology challenge the fusion of the sources. The aim of an advanced fusion method is to make use of all information hidden in the data and compute a combined result that outperforms estimates based on a single source. Additionally, a combination of satisfactorily precise sensor combinations, which are available at lower costs, might be a reasonable compromise for decision makers, so knowing these combinations would be beneficial to&#x20;them.</p>
<p>Given various sensor technologies, and various algorithms to process collected data, it is difficult to decide, which technology one should adopt and which algorithm one should deploy. This paper seeks to support decision makers, practitioners and researchers in selecting the combination of sensor data and a reconstruction approach that provides the greatest benefit for their specific problem. Since a real-world application requires algorithms to cope with sparse and missing data, this paper studies approaches with high robustness that can be applied directly. Based on real data collected on a German freeway, various algorithms and combinations of sensor technologies are evaluated. Results comprise the accuracy of reconstructed space-time speeds as well as the accuracy of deduced travel&#x20;times.</p>
<p>The paper is structured as follows. <xref ref-type="sec" rid="s2">Section 2</xref> gives a literature review on the comparison of different traffic data detection systems and on information fusion approaches. <xref ref-type="sec" rid="s3">Section 3</xref> describes the study site and data that are used to evaluate subsequent approaches. In <xref ref-type="sec" rid="s4">section 4</xref>, existing applicable fusion methods are briefly summarized. Sub <xref ref-type="sec" rid="s3-4">section 4.3</xref> describes the adaption of the Phase-Based Smoothing Method (PSM) to consider BT data in a dynamic way. <xref ref-type="sec" rid="s5">Section 5</xref> presents the applied quality metrics and the obtained results applying the methods to varying sensor setups. The conclusion in <xref ref-type="sec" rid="s6">section 6</xref> wraps up the results and provides potential further research directions.</p>
</sec>
<sec id="s2">
<title>2 State of the Art</title>
<p>Comparisons of different traffic detection technologies have been widely performed in the past. In <xref ref-type="bibr" rid="B22">Klein (2020)</xref>, a comprehensive summary of available sensors and fusion techniques is given. The authors of <xref ref-type="bibr" rid="B4">Bachmann et&#x20;al. (2013b)</xref> compared Bluetooth measurements and loop detector data in the Greater Toronto Area on a stretch of several kilometers. In <xref ref-type="bibr" rid="B18">Kessler et&#x20;al. (2018a)</xref>, the authors describe an offline comparison between loop detectors and floating cars, determining which is able to detect a traffic incident earlier. In <xref ref-type="bibr" rid="B7">Cohen and Christoforou (2015)</xref>, the authors statistically analyze the differences between loop detectors and floating car data in the area of Lille, France.</p>
<p>Additionally, different fusion techniques have been investigated. <xref ref-type="bibr" rid="B10">Faouzi and Klein (2016)</xref> give a survey of current data fusion techniques for intelligent transportation systems. In <xref ref-type="bibr" rid="B21">Klein (2019)</xref>, they present three widely applied data fusion techniques and describe their relevance to Intelligent Transportation Systems (ITS): Bayesian inference, Dempster&#x2013;Shafer evidential reasoning, and Kalman filtering. In <xref ref-type="bibr" rid="B37">Zeng et&#x20;al. (2008)</xref>, an evidence-theory-based data fusion approach for traffic incident detection is described. Data from inductive detectors, camera observation and floating car data are fused on a rather short stretch of a few hundred meters on an urban highway. <xref ref-type="bibr" rid="B8">Corsi and Capitanelli (2011)</xref> applied data fusion techniques for traffic planning and control in a setting with satellite images, acoustic and GPS data. In <xref ref-type="bibr" rid="B38">Zhou and Mirchandani (2015)</xref>, the authors describe a real-time capable framework for the fusion of loop detector and GPS data. This framework is able to distinguish lane-based traffic states. The authors of <xref ref-type="bibr" rid="B11">Faouzi et&#x20;al. (2009)</xref> study the fusion of loop data and toll collection data using a Dempster-Shafer approach in order to get an improved travel time estimate. In <xref ref-type="bibr" rid="B36">Yuan et&#x20;al. (2014)</xref>, an approach to network-wide traffic state estimation combining loop detector and floating car data is presented. <xref ref-type="bibr" rid="B29">Rempe et&#x20;al. (2017b)</xref> developed a model to fuse FCD and loop detector data to forecast congestion fronts on a freeway.</p>
<p>A comparison of two model-based approaches on filtering methods is conducted in <xref ref-type="bibr" rid="B34">Trinh et&#x20;al. (2019)</xref>. The results are confirmed using synthetic data from a simulation. <xref ref-type="bibr" rid="B24">Liu et&#x20;al. (2018)</xref> describe an extended Kalman filter method for freeway traffic state estimation fusing two data sources: wireless communication records and microwave sensor detections. Another Kalman filter based approach is given in <xref ref-type="bibr" rid="B12">Fulari et&#x20;al. (2015)</xref>. In <xref ref-type="bibr" rid="B14">He et&#x20;al. (2016)</xref>, the authors discuss a data fusion approach for cellphone probes and fixed sensors, and give a sensitivity analysis on impact factors. The article (<xref ref-type="bibr" rid="B6">Chang et&#x20;al., 2016</xref>) describes a data fusion for travel time estimation from toll collection stations and stationary vehicle detectors in Taiwan. <xref ref-type="bibr" rid="B30">Rostami-Shahrbabaki et&#x20;al. (2018)</xref> propose a fusion of loop data and FCD at intersections to estimate queue lengths and outflows. In <xref ref-type="bibr" rid="B1">Amb&#xfc;hl and Menendez (2016)</xref> and <xref ref-type="bibr" rid="B9">Dakic and Menendez (2018)</xref>, also a fusion of loop data and FCD is described with the goal to approximate the <italic>Macroscopic Fundamental Diagram</italic> of urban networks. <xref ref-type="bibr" rid="B3">Bachmann (2011)</xref> and <xref ref-type="bibr" rid="B2">Bachmann et&#x20;al. (2013a)</xref> compared seven fusion methods for traffic speeds and travel time estimations. One key finding is that a simple convex combination of loop detectors and BT measurements is one of the best fusion strategies. However, data stems from micro-simulations which tend to idealize real data. The authors of <xref ref-type="bibr" rid="B15">Hegyi et&#x20;al. (2013)</xref> fuse various sensors, loops, FCD and camera data using the Adaptive Smoothing Method (ASM) to improve the speed of jam detection and respective control measures. An evaluation is performed using simulated&#x20;data.</p>
<p>The mentioned studies are mostly limited to the usage of two different data sources, which limits the applicability in many scenarios. Furthermore, they mostly consider only one quality metric that is investigated, e.g., the spatio-temporal speed distribution or travel time. Some of the mentioned studies focus on the estimation of traffic conditions in dense networks, which is a different challenge than the one emphasized in this paper. Furthermore, data are often derived from micro-simulations, which allow for extensive studies but result in data that are usually more homogeneous and less noisy than real data. If studies utilize empirical data, they often focus on a rather short road stretch which gives an insight into only that specific freeway section.</p>
<p>The approach described in this paper is based on empirical data collected <italic>via</italic> three common sensor technologies: loop detectors, FCD and low-frequency travel time data from BT devices on a long stretch of a German freeway. The number of data points is large, which allows a detailed study of all combinations of data as well as several algorithms processing the data. Furthermore, this work applies two metrics which provides insights into the accuracy of both reconstructed traffic speeds and reconstructed travel times. The algorithms compared in this study are state-of-the-art methods such as the ASM, the PSM, simple averaging methods and an extension of the PSM. This extension is a minor, but effective change to the PSM, which allows for the integration of low-frequency travel time data in order to achieve higher reconstruction accuracies.</p>
</sec>
<sec id="s3">
<title>3 Notation and Data</title>
<p>Speed measurements for all sensors are considered on a road stretch with length <italic>X</italic> and a time period <italic>T</italic>. The data of all detection technologies are represented as spatio-temporally discrete speed values in a uniform grid with step size &#x394;<italic>X</italic>&#x20;&#x3d; 100<italic>m</italic> and &#x394;<italic>T</italic>&#x20;&#x3d; 60<italic>s</italic>. Thus, the domain can be represented as a matrix with <italic>n</italic>
<sub>
<italic>X</italic>
</sub> rows and <italic>n</italic>
<sub>
<italic>T</italic>
</sub> columns, where an entry (also called <italic>cell</italic> in the following) is referred to as (<italic>i</italic>, <italic>j</italic>), where <italic>i</italic>&#x20;&#x3d; 1, <italic>&#x2026;</italic>, <italic>n</italic>
<sub>
<italic>X</italic>
</sub> and <italic>j</italic>&#x20;&#x3d; 1, <italic>&#x2026;</italic>, <italic>n</italic>
<sub>
<italic>T</italic>
</sub>. In each cell, the speed value is constant per data source and is denoted as <italic>v</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub>. Given a set <italic>S</italic> of sensor technologies on the considered road stretch, <italic>V</italic>
<sub>
<italic>s</italic>
</sub>, <italic>s</italic>&#x20;&#x2208; <italic>S</italic> with <italic>S</italic>&#x20;&#x3d; {<italic>LOOP</italic>, <italic>FCD</italic>, <italic>BT</italic>} denote the speed matrices of loop detectors, FCD and BT sensors, respectively.</p>
<p>Speeds measured by loop detectors are given at discrete positions along the road stretch, and with a temporal resolution of one minute. For each loop detector, the measured speeds are assigned to corresponding cells in the grid. The given name is <inline-formula id="inf1">
<mml:math id="m1">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>.</p>
<p>FCD comprise trajectories of vehicles. A trajectory of one vehicle contains all information that a vehicle, equipped with a GNSS, collects about its space-time speed. An equipped vehicle samples its current position <italic>x</italic> at time <italic>t</italic> with a certain frequency, and thus generates tuples of (<italic>t</italic>, <italic>x</italic>), <italic>t</italic>&#x20;&#x2208; [0, <italic>T</italic>], <italic>x</italic>&#x20;&#x2208; [0, <italic>X</italic>] along the road stretch. Since no further speed information is given, for simplicity, the vehicle&#x2019;s speed between two sampled positions is assumed to be constant. With sampling frequencies, that are in the same order of magnitude as the time discretization of the domain, this basic assumption is sufficient. In order to turn the piece-wise linearly interpolated vehicle position into grid speeds, for each grid cell, which is passed by the vehicle, i.e.,&#x20;the vehicle traveled &#x394;<italic>x</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub>: &#x394;<italic>x</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub> &#x2265; 0&#xa0;m and &#x394;<italic>t</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub> &#x3e; 0&#xa0;s in that cell, a cell-wise speed is computed as <italic>v</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub> &#x3d; &#x394;<italic>x</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub>/&#x394;<italic>t</italic>
<sub>
<italic>i</italic>,<italic>j</italic>
</sub>. All cell-wise speeds of all traces are computed, and subsequently, the speeds of all traces are aggregated. If there are multiple speeds for the same cell, the harmonic mean of all assigned speed values is considered. The respective output matrix comprising all speed data from all equipped vehicles is denominated as <inline-formula id="inf2">
<mml:math id="m2">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>.</p>
<p>Travel times collected <italic>via</italic> vehicle re-identification and provided by BT sensors are interpolated based on the <italic>Low-Resolution Travel Time Smoothing Method (LTSM)</italic> (<xref ref-type="bibr" rid="B20">Kessler et&#x20;al., 2019</xref>). This method considers travel times through predefined cells and weights all crossing paths through any cell according to the share of the path inside the cell in order to obtain an averaged speed distribution <inline-formula id="inf3">
<mml:math id="m3">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula>.</p>
<p>The studies presented in the subsequent sections are applied to data collected on May 29, 2019 on the German autobahn A9 (<xref ref-type="fig" rid="F1">Figure&#x20;1</xref>) in the northbound direction during severe traffic congestion. The markers depict the positions of the loop detectors and Bluetooth receivers, respectively. FCD are collected from a fleet of cars, which are equipped with a GNSS device. With sampling times between 5 and 20&#xa0;s, depending on the software version, the vehicle collects positions and timestamps. Packets of positions and timestamps are reported to a central server. In order to ensure privacy, the transmission ID is shuffled from time to time, and some packets are retained such that tracing a vehicle over its entire journey is not possible.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Sketch of considered road stretch: interchanges (cyan), ramps (magenta), induction loops (dashed green), Bluetooth (dotted blue); FCD available all throughout the stretch.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g001.tif"/>
</fig>
<p>All in all, time-discrete data of 27 loop detectors, 1,578 FCD traces and 11,722 BT samples are available. <xref ref-type="fig" rid="F2">Figure&#x20;2</xref> displays the raw&#x20;data.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>Raw speed data measurements provided by <bold>(A)</bold> loop detectors, <bold>(B)</bold> equipped vehicles and <bold>(C)</bold> Bluetooth receivers.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g002.tif"/>
</fig>
<sec id="s3-1">
<title>4 FUSION METHODS</title>
<p>This section presents the fusion methods that are studied in this paper. Three considered state-of-the-art fusion methods are summarized and an extension to the PSM is presented.</p>
<p>All methods investigated in the subsequent evaluation require to take as input only gridded speed data. That is necessary, as FCD and BT contain little information about flow or density. Furthermore, there must not exist requirements regarding minimum data coverage, e.g., a penetration rate of FCD or a maximum distance between neighboring detectors. That is necessary to ensure real-world applicability, where a sensor may fail, or where no equipped vehicles may pass a road segment for a longer period of time. Finally, the output of the algorithm must be a continuous speed estimate <inline-formula id="inf4">
<mml:math id="m4">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> containing a valid speed <italic>v</italic>
<sub>
<italic>min</italic>
</sub> &#x2264; <italic>V</italic>
<sub>
<italic>E</italic>
</sub> &#x2264; <italic>v</italic>
<sub>
<italic>max</italic>
</sub> <italic>&#x2200;</italic>(<italic>i</italic>,&#x20;<italic>j</italic>).</p>
</sec>
<sec id="s3-2">
<title>4.1 ASM Approach</title>
<p>The ASM is a well-known approach used for traffic state reconstruction (<xref ref-type="bibr" rid="B32">Treiber and Helbing, 2002</xref>; <xref ref-type="bibr" rid="B33">Treiber et&#x20;al., 2011</xref>; <xref ref-type="bibr" rid="B31">Schreiter et&#x20;al., 2010</xref>; <xref ref-type="bibr" rid="B19">Kessler et&#x20;al., 2018b</xref>) and also for on-line traffic speed estimation (<xref ref-type="bibr" rid="B28">Rempe et&#x20;al., 2016</xref>). Briefly summarized, raw data of a sparse input source are smoothed in two traffic-characteristic directions: <italic>v</italic>
<sub>
<italic>cong</italic>
</sub> denominating the wave speed in congested traffic conditions, and <italic>v</italic>
<sub>
<italic>free</italic>
</sub> denominating the wave speed in free-flow conditions. In a discrete time-space domain, the resulting complete speed matrices <italic>V</italic>
<sub>
<italic>cong</italic>
</sub>(<italic>t</italic>, <italic>x</italic>) and <italic>V</italic>
<sub>
<italic>free</italic>
</sub>(<italic>t</italic>, <italic>x</italic>) are combined cell-wise:<disp-formula id="e1">
<mml:math id="m5">
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>w</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x2b;</mml:mo>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>w</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>.</mml:mo>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>The weight <italic>w</italic>(<italic>t</italic>, <italic>x</italic>) is adaptive and favors low speeds:<disp-formula id="e2">
<mml:math id="m6">
<mml:mi>w</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>tanh</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>min</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi mathvariant="normal">&#x394;</mml:mi>
<mml:mi>V</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(2)</label>
</disp-formula>with <italic>V</italic>
<sub>
<italic>thr</italic>
</sub> a threshold where weight <italic>w</italic>(<italic>t</italic>, <italic>x</italic>) equals to 0.5 and &#x394;<italic>V</italic> a parameter to control the steepness of the weight function. In a theoretical analysis as well as evaluation with real data, van Lint et&#x20;al. pointed out that smoothing speeds yields a significant error considering travel time accuracy (<xref ref-type="bibr" rid="B35">van Lint, 2010</xref>). Instead, they propose smoothing the inverted cell-wise speeds in order to reduce the error. Since travel time accuracy is one of the two key quality metrics in this evaluation, this procedure is adopted in this study, replacing the original formulation of the&#x20;ASM.</p>
<p>Accordingly, for each data source <italic>s</italic>&#x20;&#x2208; <italic>S</italic>, the discrete space-time matrices <inline-formula id="inf5">
<mml:math id="m7">
<mml:msubsup>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> are computed. For a fusion, raw data are combined cell-wise and the combined raw data are processed with the ASM. In case of at least two data sources providing a speed for the same cell, the harmonic mean is&#x20;taken.</p>
</sec>
<sec id="s3-3">
<title>4.2 PSM Approach</title>
<p>The PSM is an approach that is based on concepts of the ASM. It was developed to reconstruct space-time traffic speeds with higher accuracy given only FCD (<xref ref-type="bibr" rid="B27">Rempe et&#x20;al., 2017a</xref>). It utilizes findings summarized by the <italic>Three-Phase</italic> traffic theory (<xref ref-type="bibr" rid="B17">Kerner, 1999</xref>; <xref ref-type="bibr" rid="B16">Kerner, 2008</xref>) in order to distinguish between localized and moving congestion. The method outperformed the ASM in a recent study (<xref ref-type="bibr" rid="B27">Rempe et&#x20;al., 2017a</xref>) and is therefore included in the comparison as a state-of-the-art method. We refer to the original paper for a detailed method derivation and evaluation.</p>
<p>Briefly summarized, in the first step of the PSM, raw data are smoothed in the direction of typical speed propagation of each traffic phase. <italic>v</italic>
<sub>
<italic>cong</italic>
</sub> is assumed to be the propagation speed of moving congestion with low vehicle speeds (also called Wide Moving Jams (WMJs) in the <italic>Three-Phase</italic> traffic theory). Congestion that is caused by a bottleneck, e.g., a construction site or an on-ramp, is often localized and its downstream front is attached to the bottleneck location. In order to account for the locality, data are smoothed only in temporal direction for the so-called <italic>synchronized</italic> traffic flow phase. Based on the speeds and the amount of available data, each cell (<italic>t</italic>, <italic>x</italic>) is classified into one of the three phases: Free flow, synchronized flow or WMJ using probability theory.</p>
<p>In the second step, phase-specific speed estimates are computed. Raw speed data that are assigned to a specific phase are smoothed using either a free-flow kernel parameterized with <italic>v</italic>
<sub>
<italic>free</italic>
</sub> or a congested kernel parameterized with <italic>v</italic>
<sub>
<italic>cong</italic>
</sub>. The phase-specific speed estimates are aggregated into a final speed estimate using a weighted average.</p>
<p>The input of the PSM are gridded speeds. Additionally, for each cell, a weight matrix <inline-formula id="inf6">
<mml:math id="m8">
<mml:msup>
<mml:mrow>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>X</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msup>
</mml:math>
</inline-formula> can be given as input to the method. Applying the PSM to the raw data of the input sources as well as their cell-wise combinations (see section 4.1), the respective output matrices <inline-formula id="inf7">
<mml:math id="m9">
<mml:msubsup>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>S</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>S</mml:mi>
<mml:mi>M</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula> are computed. The weight <italic>w</italic>
<sup>
<italic>PSM</italic>
</sup> is set to one for cells with valid data, and zero for cells without&#x20;data.</p>
</sec>
<sec id="s3-4">
<title>4.3 Extended PSM Approach Considering Low-Frequency Probe Data</title>
<p>In order to apply the mentioned approaches, BT data are turned into cell-wise speeds by computing their mean speeds and assigning passed grid cells (<xref ref-type="bibr" rid="B20">Kessler et&#x20;al., 2019</xref>) (see <xref ref-type="fig" rid="F2">Figure&#x20;2</xref>). However, since the BT detectors are usually places several kilometers apart, taking the mean speed of a vehicle is a significant simplification of its real speed. For instance, if there was a mixture of congested and free traffic between two detector locations, a mean speed will smooth all details. For travel time estimations, this approach gives accurate results. In the case, that the space-time speed data are desired, the grid-wise cell speeds lack accuracy. Combining such smoothed speeds with other data sources, which deliver more accurate information, will even worsen the resulting output, despite of using more&#x20;data.</p>
<p>Therefore, the idea, presented in this extension, is to introduce a dynamic weight that is assigned to gridded BT speed data, which express the trustworthiness of the computed grid speeds. The trustworthiness is influenced by the detector spacing and the measured travel time:</p>
<p>Assume a vehicle needs time &#x394;<italic>t</italic> to travel distance &#x394;<italic>x</italic> (see <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>). It has a maximum speed of <italic>v</italic>
<sub>
<italic>max</italic>
</sub> and a minimum speed of <italic>v</italic>
<sub>
<italic>min</italic>
</sub>. Further assume that the vehicle is not standing, such that <italic>v</italic>
<sub>
<italic>min</italic>
</sub> &#x3e; 0. Then, for an observer who only measured &#x394;<italic>t</italic> and &#x394;<italic>x</italic>, it is not known where the vehicle was positioned, and at what speed it was driving, while passing the measured distance in measured time. From the observer&#x2019;s perspective, however, given the assumed minimum and maximum speed, the vehicle&#x2019;s position can be restricted to a certain space-time area. This area is depicted as a parallelogram in <xref ref-type="fig" rid="F3">Figure&#x20;3</xref>, along with three examples of potential vehicle trajectories. Each potential trajectory can be described as a function of the vehicle&#x2019;s position <italic>x</italic>(<italic>t</italic>), and its corresponding velocity <italic>v</italic>
<sub>
<italic>c</italic>
</sub>(<italic>t</italic>). As illustrated, a medium travel time allows for strong deviations of <italic>v</italic>
<sub>
<italic>c</italic>
</sub>(<italic>t</italic>) over time, whereas low travel times restrict <italic>v</italic>
<sub>
<italic>c</italic>
</sub>(<italic>t</italic>) to higher speeds. Long travel times can only be realized with vehicle speeds close to&#x20;<italic>v</italic>
<sub>
<italic>min</italic>
</sub>.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Different travel time measurements and the space of potentially realized trajectories that result in each travel&#x20;time.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g003.tif"/>
</fig>
<p>A reconstruction method such as the PSM is sensitive to wrongly assigned speeds in cells. Therefore, given the chance that the vehicle had a completely different speed profile than the speed profile computed using a simple linear interpolation, the accuracy of the reconstruction suffers. In order to consider the probability of deviation in the reconstruction method, the following approach is implemented:</p>
<p>The variety of potential trajectories is modeled as the space-time area <italic>A</italic>
<sub>
<italic>BT</italic>
</sub> of the parallelogram formed by the time and space difference, and the assumed minimum and maximum vehicle speeds <italic>v</italic>
<sub>
<italic>min</italic>
</sub> and <italic>v</italic>
<sub>
<italic>max</italic>
</sub>. The magnitude of the area is supposed to affect the weight of a trace: If the area is large, indicating a great variety of potential trajectories, the weight shall be low. If the area is small, the number of potential trajectories is low and the weight shall be high. An exponential function is utilized to model the decay of the weight <italic>w</italic>
<sub>
<italic>A</italic>
</sub> with increasing <italic>A</italic>
<disp-formula id="e3">
<mml:math id="m10">
<mml:mi>w</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>exp</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>A</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3b3;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:math>
<label>(3)</label>
</disp-formula>with <inline-formula id="inf8">
<mml:math id="m11">
<mml:mi>&#x3b3;</mml:mi>
<mml:mo>&#x2208;</mml:mo>
<mml:mi mathvariant="double-struck">R</mml:mi>
</mml:math>
</inline-formula> a parameter to adjust the sensitivity. The weight <italic>w</italic>(<italic>A</italic>) &#x2208; [0, 1] of all traces passing (<italic>t</italic>, <italic>x</italic>) assuming a linear interpolation is averaged and assigned to&#x20;<italic>w</italic>
<sub>
<italic>BT</italic>
</sub>.</p>
<p>The novel fusion method is denominated as &#x201c;PSM-W&#x201d; referring to a dedicated input source weighting of BT data. When combining the raw data of loops, FCD and BT, in this approach, the weighted average of all speed cells is taken as input. Raw loop data and FCD are assigned a constant weight of one, and said <italic>w</italic>
<sub>
<italic>BT</italic>
</sub> as weight for BT&#x20;data.</p>
</sec>
<sec id="s3-5">
<title>4.4 Section Average</title>
<p>The &#x201c;section-average&#x201d; approach averages collected data in predefined sections. Due to its simplicity, it is still applied in practice and, thus, considered as a relevant approach in this comparison. For each data source, time-space sections are defined and all data that are related to such a section are collected and averaged. Specifically, for loop detectors, section borders are located in the center of two adjacent detector positions. A cell is assigned the speed measurement that is collected by the spatially closest detector at the same moment in time. If, due to an outage of a detector, a measurement is missing, the next closest measurement in time is taken. The resulting speed matrix is denominated as <inline-formula id="inf9">
<mml:math id="m12">
<mml:msubsup>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>.</p>
<p>Start and end times of BT samples are collected at the locations of the BT detectors. For each section and each time step &#x394;<italic>t</italic>, all BT traces that cross such a section are identified. The total distance covered by these traces in this section for &#x394;<italic>t</italic> divided by the respective total time of all traces in this section is the resulting average speed at time <italic>t</italic> for all cells that belong to the section. The resulting speed estimate is denominated as <inline-formula id="inf10">
<mml:math id="m13">
<mml:msubsup>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. The same approach is done for FCD. Compared to stationary detectors, there are no predefined sections. For simplification, the same sections as for detector data are used. In order to assign values to sections without data, a temporal linear interpolation is performed. The resulting matrix is called <inline-formula id="inf11">
<mml:math id="m14">
<mml:msubsup>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mi>C</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:math>
</inline-formula>. Fusions of mutual pairs and all three matrices are simple cell-wise averages of the speeds.</p>
</sec>
</sec>
<sec id="s4">
<title>5 Evaluation</title>
<sec id="s4-1">
<title>5.1 Methodology</title>
<p>The aim of an accurate reconstruction method is to generate a complete speed estimate in time and space that is suited to various subsequent applications. Conventionally, the quality of a reconstruction is assessed using speed data only. The drawback is that a potential bias in estimated speeds, e.g., a systematic over-estimation, is not penalized. As a result, estimated travel times over larger segments are erroneous. Therefore, we see it necessary to assess both the accuracy of cell-wise speed estimates and the accuracy of virtual travel times. In the following, the combination of both aspects is considered as the reconstruction quality or accuracy. In order to assess the reconstruction accuracy, the following considerations are taken into account:<list list-type="simple">
<list-item>
<p>1) As visible in the raw data plots, the measurements of each data source are sparse in time and&#x20;space.</p>
</list-item>
<list-item>
<p>2) Loop detectors provide accurate speed measurements but are limited to certain locations.</p>
</list-item>
<list-item>
<p>3) FCD provide relatively accurate speed estimates for varying times and spaces but do not represent macroscopic speeds.</p>
</list-item>
<list-item>
<p>4) BT-based travel time measurements are abundant, though the cell-based speeds are inaccurate due to large distances between neighboring sensors.</p>
</list-item>
</list>
</p>
<p>For these reasons, in order to assess the space-time speed, those data sources with high spatio-temporal accuracy should be used&#x2014;for the evaluation of travel time data, a source with accurate travel time measurements is required. Therefore, a combination of FCD and loop detector data assesses the cell-wise speed estimates, and BT data are used to assess the travel time accuracy.</p>
<p>A commonly used approach in model training and evaluation is to divide available data into a training and a test data set. <xref ref-type="fig" rid="F4">Figure&#x20;4</xref> depicts the methodology applied in this evaluation. First, each data source is randomly divided into a training and test set with a ratio of 1:1. Specifically, all speed measurements that are gathered by one detector position are either assigned to training data or test data. FCD and BT are assigned per trace. Training data are fused in order to generate an estimate <italic>V</italic>
<sub>
<italic>E</italic>
</sub>, and test data of loop detectors, FCD and BT are used to assess the reconstruction quality.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Flow of information of test and training set of sensor data for fusion and quality assessment.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g004.tif"/>
</fig>
<p>The quality assessment with a combination of FCD and loop data is done using the Inverse Mean Average Error (IMAE), <xref ref-type="disp-formula" rid="e4">Eq. 4</xref>. It is a symmetric metric that is sensitive to deviations of lower speeds:<disp-formula id="e4">
<mml:math id="m15">
<mml:mi>I</mml:mi>
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mo stretchy="false">&#x7c;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo stretchy="false">&#x7c;</mml:mo>
</mml:mrow>
</mml:mfrac>
<mml:munder>
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msup>
<mml:mo>&#x2208;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munder>
<mml:mfenced open="|" close="">
</mml:mfenced>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msubsup>
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="|" close="">
</mml:mfenced>
</mml:math>
<label>(4)</label>
</disp-formula>with <italic>v</italic>
<sub>
<italic>test</italic>
</sub> representing all tuples <italic>v</italic>
<sup>
<italic>i</italic>,<italic>j</italic>
</sup> that correspond to a cell-wise speed contained in the test set <italic>v</italic>
<sub>
<italic>test</italic>
</sub>. The set is defined as the union of all cell-wise speeds in the test sets of FCD and loop&#x20;data.</p>
<p>Quality assessment of travel times with BT is based on the comparison of virtual trajectories with the measured traces using BT detectors. For each measured trace, a virtual trajectory is computed that starts at the same time and location (<italic>t</italic>
<sub>
<italic>start</italic>
</sub>, <italic>x</italic>
<sub>
<italic>start</italic>
</sub>) of the real trace. The virtual vehicle drives with the continuous representation of speed <italic>V</italic>
<sub>
<italic>E</italic>
</sub>(<italic>t</italic>, <italic>x</italic>(<italic>t</italic>)) until reaching <italic>x</italic>
<sub>
<italic>end</italic>
</sub>:<disp-formula id="e5">
<mml:math id="m16">
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2208;</mml:mo>
<mml:mfenced open="[" close="]">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:mfenced>
<mml:mo>:</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:mrow>
<mml:mo>&#x222b;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:msubsup>
<mml:msub>
<mml:mrow>
<mml:mi>V</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>x</mml:mi>
<mml:mfenced open="(" close=")">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mfenced>
<mml:mi>d</mml:mi>
<mml:mi>t</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>x</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>Its virtual travel time is defined as:<disp-formula id="e6">
<mml:math id="m17">
<mml:mi>V</mml:mi>
<mml:mi>T</mml:mi>
<mml:mi>T</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>Given <italic>n</italic>
<sub>
<italic>BT</italic>
</sub> as the number of BT travel time samples in the test set, <italic>TT</italic>
<sub>
<italic>i</italic>
</sub> as the measured and <italic>VTT</italic>
<sub>
<italic>i</italic>
</sub> as the virtual travel times for <italic>i</italic>&#x20;&#x3d; 1, <italic>&#x2026;</italic>, <italic>n</italic>
<sub>
<italic>BT</italic>
</sub>, the Mean Absolute Percentage Error (MAPE) is applied as a quality metric. A relative metric reduces the effect of varying segment distances between neighboring BT receivers.<disp-formula id="e7">
<mml:math id="m18">
<mml:mi>M</mml:mi>
<mml:mi>A</mml:mi>
<mml:mi>P</mml:mi>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:munderover accentunder="false" accent="false">
<mml:mrow>
<mml:mo>&#x2211;</mml:mo>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>n</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:munderover>
<mml:mfenced open="|" close="">
</mml:mfenced>
<mml:mfrac>
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mfenced open="|" close="">
</mml:mfenced>
</mml:math>
<label>(7)</label>
</disp-formula>
</p>
<p>The parameter set for the ASM is taken in accordance with <xref ref-type="bibr" rid="B33">Treiber et&#x20;al. (2011)</xref>. The PSM is parameterized according to <xref ref-type="bibr" rid="B27">Rempe et&#x20;al. (2017a)</xref>. Based on some experiments, <italic>&#x3b3;</italic> is set to 500, 000&#xa0;m&#x22c5; s (<xref ref-type="disp-formula" rid="e3">Eq. 3</xref>). A formal sensitivity analysis and optimization is left for future work. <italic>v</italic>
<sub>
<italic>min</italic>
</sub> is set to 5&#xa0;km/h and <italic>v</italic>
<sub>
<italic>max</italic>
</sub> is set to 130&#xa0;km/h. The random split between test and training set is done at each run. In total, speed estimations for all scenarios and algorithms as well as quality assessments are done 50&#x20;times and average results are presented.</p>
</sec>
<sec id="s4-2">
<title>5.2 Results</title>
<p>This study intends to give insights into several aspects that come up considering a multi-sensor data fusion. In order to structure the outcomes, the results are examined with respect to two questions:<list list-type="simple">
<list-item>
<p>1) Given a certain sensor set-up on a road and several algorithms that can be applied to process raw data, which algorithm returns the most accurate results?</p>
</list-item>
<list-item>
<p>2) Given the freedom to choose between the three sources of sensor data, which data source or which combination yields best results?</p>
</list-item>
</list>
</p>
<sec id="s4-2-1">
<title>5.2.1 Algorithm Assessment</title>
<p>
<xref ref-type="fig" rid="F5">Figure&#x20;5</xref> depicts the mean IMAE and MAPE of all scenarios and algorithms. Several observations can be made:<list list-type="simple">
<list-item>
<p>1) The available sensor data have a significant impact on the resulting errors for each algorithm.</p>
</list-item>
<list-item>
<p>2) The IMAE has a higher variance than the&#x20;MAPE.</p>
</list-item>
<list-item>
<p>3) Some algorithms perform best with respect to the IMAE in a scenario but are outperformed with respect to the MAPE (e.g., with FCD only, &#x201c;PSM&#x201d; has a lower IMAE but &#x201c;ASM&#x201d; a lower MAPE). This shows that both quality metrics measure different properties of an algorithm.</p>
</list-item>
<list-item>
<p>4) The &#x201c;SEC-AVG&#x201d; is the algorithm which results in the lowest accuracy, for IMAE as well as MAPE in most scenarios. Given only &#x201c;LOOP &#x2b; BT&#x201d;, this algorithm has a slight advantage over the &#x201c;ASM&#x201d; and &#x2018;PSM&#x201d;. Still, the &#x201c;PSM-W&#x201d; performs better.</p>
</list-item>
<list-item>
<p>5) The &#x201c;PSM-W&#x201d; performs significantly better in IMAE and MAPE in all scenarios that involve BT&#x20;data.</p>
</list-item>
<list-item>
<p>6) On average, the &#x201c;PSM-W&#x201d; provides the best quality results. In a &#x201c;LOOP&#x201d;-only scenario, the &#x201c;ASM&#x201d; performs better.</p>
</list-item>
</list>
</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Mean <bold>(A)</bold> IMAE and <bold>(B)</bold> MAPE of all runs with respect to the available sensor technology and the applied algorithm.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g005.tif"/>
</fig>
<p>In order to better understand which estimation errors occurred applying each algorithm, the scenario with all data (&#x201c;LOOP &#x2b; FCD &#x2b; BT&#x201d;) is examined&#x20;below.</p>
<p>
<xref ref-type="fig" rid="F6">Figure&#x20;6</xref> visualizes the estimation results of all algorithms as well as the IMAE with respect to all available data. It can be observed that the estimate computed with the section-average approach 1) results in large errors downstream of the heavy congestion at kilometer 522. Furthermore, the approach failed to reconstruct the moving jams that emerge after 3:30pm. The reconstructions given with ASM 2) and PSM 3) reveal a higher spatio-temporal accuracy. Though, even these approaches spatially overestimate the heavy congestion and are not very accurate at reconstructing the moving jams either. The main reason is that all BT data, with their low space-time accuracy in mid-range speeds (compare <xref ref-type="sec" rid="s3-4">section 4.3</xref>) are smoothed, which blurs the fine structure of the congestion.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Reconstructed speeds applying each algorithm <bold>(A)</bold> SEC-AVG, <bold>(B)</bold> ASM, <bold>(C)</bold> PSM, <bold>(D)</bold> PSM-W to the training data <bold>(on the left)</bold> and resulting IMAEs comparing the reconstructed speeds to all available data <bold>(right)</bold>.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g006.tif"/>
</fig>
<p>Applying the &#x201c;PSM-W&#x201d; 4) with the adapted weighting of BT according to <xref ref-type="disp-formula" rid="e3">Eq. 3</xref> (see <xref ref-type="fig" rid="F7">Figure&#x20;7</xref>) overcomes this issue. Traces with medium travel times and those collected on long segments tend to have a lower weight. Thus, both the speed profile of the heavy congestion and that of the moving jams are reconstructed more precisely.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Resulting weight applying the speed-adaptive conversion of travel time samples.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g007.tif"/>
</fig>
<p>
<xref ref-type="fig" rid="F8">Figure&#x20;8</xref> depicts the interpolated Probability Density Functions (PDFs) of relative travel time errors of each algorithm based on the BT test set and virtual trajectories (see <xref ref-type="sec" rid="s4-1">section 5.1</xref>). The PDFs of &#x201c;SEC-AVG&#x201d;, &#x201c;ASM&#x201d;, and &#x201c;PSM&#x201d; are similar to each other, and exhibit a wider distribution than the PDF corresponding to &#x201c;PSM-W&#x201d;. This explains the lower resulting MAPE of the &#x201c;PSM-W&#x201d;.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Approximated probability density function of relative errors comparing the travel times of virtual trajectories based on each algorithm with the measured travel times collected <italic>via</italic> BT devices.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g008.tif"/>
</fig>
</sec>
<sec id="s4-2-2">
<title>5.2.2 Sensor Setup Assessment</title>
<p>Suppose that one wishes to install an array of traffic sensors on a stretch of road for the purpose of providing accurate traffic speed information. In that case, it is relevant to know about the quality that a single sensor technology or a combination of sensor technologies may achieve. <xref ref-type="fig" rid="F9">Figure&#x20;9</xref> shows, for each sensor combination, the lowest achieved IMAE and MAPE across all algorithms. Several observations can be made:<list list-type="simple">
<list-item>
<p>1) The combination of FCD and loop data provides the best results for MAPE and&#x20;IMAE.</p>
</list-item>
<list-item>
<p>2) The usage of more technologies does not necessarily improve the reconstruction quality. For example, &#x201c;LOOP &#x2b; FCD &#x2b; BT&#x201d; is not the most accurate combination.</p>
</list-item>
<list-item>
<p>3) With respect to IMAE, BT provides the lowest accuracy.</p>
</list-item>
<list-item>
<p>4) With respect to MAPE, loops provide the lowest accuracy.</p>
</list-item>
<list-item>
<p>5) Using FCD or combinations with FCD increases both quality metrics significantly.</p>
</list-item>
<list-item>
<p>6) The integration of BT data improves the quality in some cases (MAPE: &#x201c;FCD &#x2b; BT&#x201d;, &#x201c;LOOP &#x2b; BT&#x201d;), but worsens it in others (IMAE: &#x201c;FCD &#x2b; BT&#x201d;)</p>
</list-item>
</list>
</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Lowest IMAE and MAPE using the most accurate reconstruction algorithm with respect to the available data source.</p>
</caption>
<graphic xlink:href="ffutr-02-766951-g009.tif"/>
</fig>
<p>Apparently, loop and FCD is the best choice. However, if for instance FCD are not available, a combination of loop and BT data is able to provide more accurate results. Thus, these findings support in the decision process of setting up sensors on a road, or amending stationary data with&#x20;FCD.</p>
</sec>
</sec>
</sec>
<sec id="s5">
<title>5.3 Discussion</title>
<p>The present study examines two major aspects of a multi-sensor data fusion: the reconstruction accuracy using different combinations of sensor data, and the accuracy applying different state-of-the-art algorithms (as well as a novel approach) to different sensor combinations. Additionally, the reconstruction accuracy is measured using two metrics.</p>
<p>A welcome result of such a study would be a clear recommendation on which algorithm or data to use in general in order to obtain the most accurate estimates. However, as the comparison showed, the choice of metric has an influence on the most accurate approach and sensor combination. For example, adding BT data barely improved, and sometimes even worsened, the quality of the space-time speed reconstruction. The data quality of BT has a great impact here and possible outliers should be eliminated rigorously beforehand. On the other hand, the travel time accuracy of virtual trajectories improved by adding BT. The same is true for the choice of algorithm. If only loop data are given, the ASM performs best in IMAE and MAPE. Given other data, specially BT data, the weighted PSM-W performs best. Compared to the original PSM, its accuracy is the same or better, thus, it successfully extends this approach without compromises. Thus, as a result, depending on the desired speed and travel time accuracy, this study helps to pick the optimal sensor setup or algorithm, depending on the given situation.</p>
<p>Some factors which may have an impact on the results are set as fixed in this study, though they may vary in other applications. First, the penetration rate and sampling interval of FCD and the spacing of stationary detectors may vary. Secondly, the situation used for assessment in this paper is a mixture of two traffic patterns using the classification of the Three-Phase theory: mega-jam and General Pattern (<xref ref-type="bibr" rid="B17">Kerner, 1999</xref>). These patterns cause large travel time losses, and thus, are especially important to reconstruct accurately. For further work, the study may be extended to further congestion patterns occurring on different days and&#x20;roads.</p>
</sec>
<sec id="s6">
<title>6 Conclusion</title>
<p>This paper studies a multi-sensor data fusion for accurate traffic speed and travel time reconstruction. Two aspects are analyzed: 1) Which is the most accurate algorithm depending on different combinations of data sources, and 2) which is the best performance one can achieve with a flexible sensor setup. To this end, three state-of-the-art methods such as the ASM, the PSM and a simple averaging method, as well as a novel approach, are used to jointly reconstruct the traffic speed and travel times given sparse&#x20;data.</p>
<p>The novel approach extends the PSM. It introduces a variable weighting of BT measurements, depending on detector spacing and measured travel time, which expresses the trustworthiness of a single measurement. The weighting allows for a dynamic integration of BT data with other data sources.</p>
<p>The mentioned questions are studied using empirical loop data, FCD and BT data collected during severe congestion on a German freeway. Data are divided into a reconstruction and a test set. Various combinations of algorithms and data are used to reconstruct the space-time traffic speed and the travel times. The error metrics IMAE and MAPE are used to assess the resulting reconstruction accuracies.</p>
<p>Key findings are that the novel approach outperforms the other algorithms in most of the cases. Furthermore, a combination of FCD and loop detector data provides the best overall results. The integration of Bluetooth data does not necessarily improve the reconstruction quality, depending on the error measure chosen. However, if no FCD are available, a combination of loop data and BT data is a better choice than only one source of&#x20;data.</p>
<p>Next steps comprise a comprehensive pre-processing of travel time derived data to ensure consistency and to reduce outliers. Also, future research may include a mathematical optimization of the applied parameters and further studies on sensor spacings. Furthermore, the study could be extended to other locations and congestion patterns.</p>
</sec>
</body>
<back>
<sec id="s7">
<title>Data Availability Statement</title>
<p>The data analyzed in this study is subject to the following licenses/restrictions: Data are proprietary to Bavarian Freeway Administration and to BMW. We are allowed to use data from a single day of freeway traffic. Requests to access these datasets should be directed to LK, <ext-link ext-link-type="uri" xlink:href="http://lisa.kessler@tum.de">lisa.kessler@tum.de</ext-link>.</p>
</sec>
<sec id="s8">
<title>Author Contributions</title>
<p>LK, FR, and KB contributed to conception and design of the study. FR and LK contributed to the literature review. LK and FR prepared the data. FR developed the methodology. LK, FR, and KB performed the results analyses. LK and FR prepared the draft of the manuscript. All authors contributed to the revision of the manuscript and read and approved the submitted version.</p>
</sec>
<sec id="s9">
<title>Funding</title>
<p>This work is part of the ViM project and has been funded by the Bavarian Ministry of Economic Affairs, Regional Development and Energy (StMWi) through the Center Digitization.Bavaria, an initiative of the Bavarian State Government.</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<title>Conflict of Interest</title>
<p>FR was employed by BMW Group, Mobility Technologies.</p>
<p>The remaining authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s11">
<title>Publisher&#x2019;s Note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ack>
<p>We would like to thank <italic>Landesbaudirektion Bayern</italic> for providing the data. We would also like to thank our foreign language assistants for proofreading our manuscript and pointing out grammar and spelling mistakes. Lastly, we thank all reviewers for their valuable comments that improved the paper to the highest quality. The authors acknowledge the funds received for open access publication by the TUM Open Access Publishing&#x20;Fund.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Amb&#xfc;hl</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Menendez</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Data Fusion Algorithm for Macroscopic Fundamental Diagram Estimation</article-title>. <source>Transportation Res. C: Emerging Tech.</source> <volume>71</volume>, <fpage>184</fpage>&#x2013;<lpage>197</lpage>. <pub-id pub-id-type="doi">10.1016/j.trc.2016.07.013</pub-id> </citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bachmann</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Abdulhai</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Roorda</surname>
<given-names>M. J.</given-names>
</name>
<name>
<surname>Moshiri</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2013a</year>). <article-title>A Comparative Assessment of Multi-Sensor Data Fusion Techniques for Freeway Traffic Speed Estimation Using Microsimulation Modeling</article-title>. <source>Transportation Res. Part C: Emerging Tech.</source> <volume>26</volume>, <fpage>33</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1016/j.trc.2012.07.003</pub-id> </citation>
</ref>
<ref id="B3">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bachmann</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2011</year>). <source>Multi-Sensor Data Fusion for Traffic Speed and Travel Time Estimation</source>. <publisher-name>Master&#x2019;s thesis, Department of Civil Engineering, University of Toronto</publisher-name>. </citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bachmann</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Roorda</surname>
<given-names>M. J.</given-names>
</name>
<name>
<surname>Abdulhai</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Moshiri</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2013b</year>). <article-title>Fusing a Bluetooth Traffic Monitoring System with Loop Detector Data for Improved Freeway Traffic Speed Estimation</article-title>. <source>J.&#x20;Intell. Transportation Syst.</source> <volume>17</volume>, <fpage>152</fpage>&#x2013;<lpage>164</lpage>. <pub-id pub-id-type="doi">10.1080/15472450.2012.696449</pub-id> </citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Barcelo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Montero</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Marques</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Carmona</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Travel Time Forecasting and Dynamic Origin-Destination Estimation for Freeways Based on Bluetooth Traffic Monitoring</article-title>. <source>J.&#x20;Transportation Res. Board</source>, <fpage>19</fpage>&#x2013;<lpage>27</lpage>. <pub-id pub-id-type="doi">10.3141/2175-03</pub-id> </citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Chang</surname>
<given-names>T.-H.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>A. Y.</given-names>
</name>
<name>
<surname>Hsu</surname>
<given-names>Y.-T.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>C.-L.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Freeway Travel Time Prediction Based on Seamless Spatio-Temporal Data Fusion: Case Study of the Freeway in Taiwan. Transportation Research Procedia</article-title>,&#x201d; in <conf-name>International Conference on Transportation Planning and Implementation Methodologies for Developing Countries (12th TPMDC) Selected</conf-name>, <fpage>452</fpage>&#x2013;<lpage>459</lpage>. <pub-id pub-id-type="doi">10.1016/j.trpro.2016.11.087</pub-id> </citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cohen</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Christoforou</surname>
<given-names>Z.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Travel Time Estimation between Loop Detectors and FCD: A Compatibility Study on the Lille Network, france</article-title>. <source>Transportation Res. Proced.</source>, <volume>10</volume>, <fpage>245</fpage>&#x2013;<lpage>255</lpage>. <comment>ting (EWGT</comment>. <pub-id pub-id-type="doi">10.1016/j.trpro.2015.09.074</pub-id> </citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Corsi</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Capitanelli</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Multi-sensor Data Fusion for Traffic Planning and Control</article-title>. <source>WIT Trans. Built Environ.</source> <volume>116</volume>, <fpage>179</fpage>&#x2013;<lpage>189</lpage>. <pub-id pub-id-type="doi">10.2495/UT110161</pub-id> </citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dakic</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Menendez</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>On the Use of Lagrangian Observations from Public Transport and Probe Vehicles to Estimate Car Space-Mean Speeds in Bi-modal Urban Networks</article-title>. <source>Transportation Res. Part C: Emerging Tech.</source> <volume>91</volume>, <fpage>317</fpage>&#x2013;<lpage>334</lpage>. <pub-id pub-id-type="doi">10.1016/j.trc.2018.04.004</pub-id> </citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Faouzi</surname>
<given-names>N.-E. E.</given-names>
</name>
<name>
<surname>Klein</surname>
<given-names>L. A.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Data Fusion for ITS: Techniques and Research Needs</article-title>. <source>Transportation Res. Proced.</source> <volume>15</volume>, <fpage>495</fpage>&#x2013;<lpage>512</lpage>. <pub-id pub-id-type="doi">10.1016/j.trpro.2016.06.042</pub-id> </citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Faouzi</surname>
<given-names>N.-E. E.</given-names>
</name>
<name>
<surname>Klein</surname>
<given-names>L. A.</given-names>
</name>
<name>
<surname>de Mouzon</surname>
<given-names>O.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Improving Travel Time Estimates from Inductive Loop and Toll Collection Data with Dempster&#x2013;Shafer Data Fusion</article-title>. <source>Transportation Res. Rec.</source> <volume>2129</volume>, <fpage>73</fpage>&#x2013;<lpage>80</lpage>. <pub-id pub-id-type="doi">10.3141/2129-09</pub-id> </citation>
</ref>
<ref id="B12">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Fulari</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Vanajakshi</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Subramanian</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ajitha</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>Application of Multisensor Data Fusion for Traffic Congestion Analysis</article-title>,&#x201d; in <source>Multisensor Data Fusion &#x2013; from Algorithms and Architectural Design to Applications</source> (<publisher-loc>Boca Raton</publisher-loc>: <publisher-name>Hassen Fourati</publisher-name>). <comment>chap. 33. 596&#x2013;613</comment>. <pub-id pub-id-type="doi">10.1201/b18851-33</pub-id> </citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Haghani</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hamedi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sadabadi</surname>
<given-names>K. F.</given-names>
</name>
<name>
<surname>Young</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Tarnoff</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Data Collection of Freeway Travel Time Ground Truth with Bluetooth Sensors</article-title>. <source>Transportation Res. Rec.</source> <volume>2160</volume>, <fpage>60</fpage>&#x2013;<lpage>68</lpage>. <pub-id pub-id-type="doi">10.3141/2160-07</pub-id> </citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>He</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Wan</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Ran</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>20162016</year>). <article-title>Freeway Multisensor Data Fusion Approach Integrating Data from Cellphone Probes and Fixed Sensors</article-title>. <source>J.&#x20;Sensors</source>. <pub-id pub-id-type="doi">10.1155/2016/7269382</pub-id> </citation>
</ref>
<ref id="B15">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hegyi</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Netten</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Schakel</surname>
<given-names>W. J.</given-names>
</name>
<name>
<surname>Schreiter</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>Y.</given-names>
</name>
<etal/>
</person-group> (<year>2013</year>). &#x201c;<article-title>A Cooperative System Based Variable Speed Limit Control Algorithm against Jam Waves &#x2013; an Extension of the SPECIALIST Algorithm</article-title>,&#x201d; in <conf-name>16th International IEEE Conference on Intelligent Transportation Systems</conf-name>, <conf-loc>The Hague, Netherlands</conf-loc>, <conf-date>October 6&#x2013;9, 2013</conf-date> (<publisher-loc>The Hague, Netherlands</publisher-loc>: <publisher-name>ITSC</publisher-name>), <fpage>973</fpage>&#x2013;<lpage>978</lpage>. <pub-id pub-id-type="doi">10.1109/itsc.2013.6728358</pub-id> </citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kerner</surname>
<given-names>B. S.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A Theory of Traffic Congestion at Heavy Bottlenecks</article-title>. <source>J.&#x20;Phys. A: Math. Theor.</source> <volume>41</volume>, <fpage>215101</fpage>. </citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kerner</surname>
<given-names>B. S.</given-names>
</name>
</person-group> (<year>1999</year>). <article-title>The Physics of Traffic</article-title>. <source>Phys. World</source> <volume>12</volume>, <fpage>25</fpage>&#x2013;<lpage>30</lpage>. <pub-id pub-id-type="doi">10.1088/2058-7058/12/8/30</pub-id> </citation>
</ref>
<ref id="B18">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kessler</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huber</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Kesting</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018a</year>). &#x201c;<article-title>Comparing Speed Data from Stationary Detectors against Floating-Car Data</article-title>,&#x201d; in <conf-name>IFAC-PapersOnLine, 15th IFAC Symposium on Control in Transportation Systems CTS</conf-name>, <conf-loc>Savona, Italy</conf-loc>, <conf-date>June 6&#x2013;8, 2018</conf-date>, <fpage>299</fpage>&#x2013;<lpage>304</lpage>. <pub-id pub-id-type="doi">10.1016/j.ifacol.2018.07.049</pub-id> </citation>
</ref>
<ref id="B19">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kessler</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Huber</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Kesting</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018b</year>). <source>97th Annual Meeting of the Transportation Research Board</source>.<article-title>Comparison of Floating-Car Based Speed Data with Stationary Detector Data</article-title> </citation>
</ref>
<ref id="B20">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kessler</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Karl</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Spatiotemporal Traffic Speed Reconstruction from Travel Time Measurements Using Bluetooth Detection</article-title>,&#x201d; in <conf-name>22nd International IEEE Conference on Intelligent Transportation Systems (ITSC)</conf-name>, <conf-loc>Auckland, New Zealand</conf-loc>, <conf-date>October 27&#x2013;30, 2019</conf-date>. <pub-id pub-id-type="doi">10.1109/ITSC.2019.8917084</pub-id> </citation>
</ref>
<ref id="B21">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Klein</surname>
<given-names>L. A.</given-names>
</name>
</person-group> (<year>2019</year>). <source>Sensor and Data Fusion for Intelligent Transportation Systems</source>, <volume>vol. PM305</volume>. <publisher-loc>Bellingham, WA, United States</publisher-loc>: <publisher-name>SPIE Press</publisher-name>. </citation>
</ref>
<ref id="B22">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Klein</surname>
<given-names>L. A.</given-names>
</name>
</person-group> (<year>2020</year>). <source>Traffic Flow Sensors: Technologies, Operating Principles, and Archetypes</source>, <volume>vol. SL58</volume>. <publisher-loc>Bellingham, WA, United States</publisher-loc>: <publisher-name>SPIE Press</publisher-name>. </citation>
</ref>
<ref id="B23">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Lesani</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Romancyshyn</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Miranda-Moreno</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2016</year>). <source>95th Annual Meeting of the Transportation Research Board (TRB)</source>.<article-title>Arterial Traffic Monitoring Using Integrated Wi-Fi-Bluetooth System</article-title> </citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Liu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>He</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ran</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Cheng</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A Progressive Extended Kalman Filter Method for Freeway Traffic State Estimation Integrating Multisource Data</article-title>. <source>Wireless Commun. Mobile Comput.</source>, <fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1155/2018/6745726</pub-id> </citation>
</ref>
<ref id="B25">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Margreiter</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <source>PIARC International Seminar on Integrated Road Transport and Mobility</source>. <publisher-loc>Cape Town, South Africa</publisher-loc>.<article-title>Bluetooth Technology for Motorway Management and Motorway Technology</article-title> </citation>
</ref>
<ref id="B26">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Martchouk</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Mannering</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Bullock</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Analysis of Freeway Travel Time Variability Using Bluetooth Detection</article-title>. <source>J.&#x20;Transportation Eng.</source> <volume>137</volume>, <fpage>697</fpage>&#x2013;<lpage>704</lpage>. <pub-id pub-id-type="doi">10.1061/(ASCE)TE.1943-5436.0000253</pub-id> </citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rempe</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Franeck</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Fastenrath</surname>
<given-names>U.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2017a</year>). <article-title>A Phase-Based Smoothing Method for Accurate Traffic Speed Estimation with Floating Car Data</article-title>. <source>Transportation Res. Part C: Emerging Tech.</source> <volume>85</volume>, <fpage>644</fpage>&#x2013;<lpage>663</lpage>. <pub-id pub-id-type="doi">10.1016/j.trc.2017.10.015</pub-id> </citation>
</ref>
<ref id="B28">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Rempe</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Franeck</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Fastenrath</surname>
<given-names>U.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2016</year>). &#x201c;<article-title>Online Freeway Traffic Estimation with Real Floating Car Data</article-title>,&#x201d; in <source>19th International IEEE Conference on Intelligent Transportation Systems</source> <publisher-loc>Rio de Janeiro, Brazil</publisher-loc>: <publisher-name>ITSC</publisher-name>. <pub-id pub-id-type="doi">10.1109/ITSC.2016.7795854</pub-id> </citation>
</ref>
<ref id="B29">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Rempe</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Kessler</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Bogenberger</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2017b</year>). &#x201c;<article-title>Fusing Probe Speed and Flow Data for Robust Short-Term Congestion Front Forecasts</article-title>,&#x201d; in <conf-name>5th International IEEE Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS)</conf-name>, <conf-loc>Naples, Italy</conf-loc>, <conf-date>June 26&#x2013;28, 2017</conf-date>, <fpage>31</fpage>. <pub-id pub-id-type="doi">10.1109/MTITS.2017.8005695</pub-id> </citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rostami-Shahrbabaki</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Safavi</surname>
<given-names>A. A.</given-names>
</name>
<name>
<surname>Papageorgiou</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Papamichail</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>A Data Fusion Approach for Real-Time Traffic State Estimation in Urban Signalized Links</article-title>. <source>Transportation Res. Part C: Emerging Tech.</source> <volume>92</volume>. <pub-id pub-id-type="doi">10.1016/j.trc.2018.05.020</pub-id> </citation>
</ref>
<ref id="B31">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Schreiter</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>van Lint</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Treiber</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hoogendoorn</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2010</year>). &#x201c;<article-title>Two Fast Implementations of the Adaptive Smoothing Method Used in Highway Traffic State Estimation</article-title>,&#x201d; in <conf-name>13th International IEEE Conference on Intelligent Transportation Systems</conf-name>, <conf-loc>Funchal, Portugal</conf-loc>, <conf-date>September 19&#x2013;22, 2010</conf-date>, <fpage>1202</fpage>&#x2013;<lpage>1208</lpage>. <pub-id pub-id-type="doi">10.1109/ITSC.2010.5625139</pub-id> </citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Treiber</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Helbing</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Reconstructing the Spatio-Temporal Traffic Dynamics from Stationary Detector Data</article-title>. <source>Cooperative Transportation Dynamics</source> <volume>1</volume>, <fpage>3</fpage>. </citation>
</ref>
<ref id="B33">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Treiber</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kesting</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Wilson</surname>
<given-names>R. E.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Reconstructing the Traffic State by Fusion of Heterogeneous Data</article-title>. <source>Computer-Aided Civil Infrastructure Eng.</source> <volume>26</volume>, <fpage>408</fpage>&#x2013;<lpage>419</lpage>. <pub-id pub-id-type="doi">10.1111/j.1467-8667.2010.00698.x</pub-id> </citation>
</ref>
<ref id="B34">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Trinh</surname>
<given-names>X. S.</given-names>
</name>
<name>
<surname>Ngoduy</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Keyvan-Ekbatani</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Robertson</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A Comparative Study on Filtering Methods for Online Freeway Traffic Estimation Using Heterogeneous Data</article-title>,&#x201d; in <conf-name>22nd International IEEE Conf.erence on Intell.igent Transportation Syst.ems (Itsc)</conf-name>, <conf-loc>Auckland, New Zealand</conf-loc>, <conf-date>October 27&#x2013;30, 2019</conf-date>. <pub-id pub-id-type="doi">10.1109/ITSC.2019.8917363</pub-id> </citation>
</ref>
<ref id="B35">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>van Lint</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Empirical Evaluation of New Robust Travel Time Estimation Algorithms</article-title>. <source>Transportation Res. Rec.</source> <volume>2160</volume>, <fpage>50</fpage>&#x2013;<lpage>59</lpage>. <pub-id pub-id-type="doi">10.3141/2160-06</pub-id> </citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yuan</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>van Lint</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>van Wageningen-Kessels</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Hoogendoorn</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Network-wide Traffic State Estimation Using Loop Detector and Floating Car Data</article-title>. <source>J.&#x20;Intell. Transportation Syst.</source> <volume>18</volume>, <fpage>41</fpage>&#x2013;<lpage>50</lpage>. <pub-id pub-id-type="doi">10.1080/15472450.2013.773225</pub-id> </citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Zeng</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Xu</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>Data Fusion for Traffic Incident Detection Using D-S Evidence Theory with Probabilistic SVMs</article-title>. <source>J.&#x20;Comput.</source> <volume>3</volume>, <fpage>36</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.4304/jcp.3.10.36-43</pub-id> </citation>
</ref>
<ref id="B38">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhou</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Mirchandani</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>A Multi-Sensor Data Fusion Framework for Real-Time Multi-Lane Traffic State Estimation</article-title>,&#x201d; in <conf-name>94th Annual Meeting of the Transportation Research Board (TRB)</conf-name>, <conf-loc>Washington, DC, United States</conf-loc>, <conf-date>January 11&#x2013;15, 2015</conf-date>. </citation>
</ref>
</ref-list>
</back>
</article>