Evaluating the Accuracy of Bluetooth-Based Travel Time on Arterial Roads: A Case Study of Perth, Western Australia
Bibliographic record
Abstract
Bluetooth (BT) time-stamped media access control (MAC) address data have been used for traffic studies worldwide. Although Bluetooth (BT) technology has been widely recognised as an effective, low-cost traffic data source in freeway traffic contexts, it is still unclear whether BT technology can provide accurate travel time (TT) information in complex urban traffic environments. Therefore, this empirical study aims to systematically evaluate the accuracy of BT travel time estimates in urban arterial contexts. There are two major hurdles to deriving accurate TT information for arterial roads: the multiple detection problem and noise in BT estimates. To date, they have not been fully investigated, nor have well-accepted solutions been found. Using approximately two million records of BT time-stamped MAC address data from twenty weekdays, this study uses five different BT TT-matching methods to investigate and quantify the impact of multiple detection problems and the noise in BT TT estimates on the accuracy of average BT travel times. Our work shows that accurate Bluetooth-based travel time information on signalised arterial roads can be derived if an appropriate matching method can be selected to smooth out the remaining noise in the filtered travel time estimates. Overall, average-to-average and last-to-last matching methods are best for long (>1 km) and short (≤1 km) signalised arterial road segments, respectively. Furthermore, our results show that the differences between BT and ground truth average TTs or speeds are systematic, and adding a calibration is a pragmatic method to correct inaccurate BT average TTs or speeds. The results of this research can help researchers and road operators to better understand BT technology for TT analysis and consequently to optimise the deployment location and configuration of BT MAC address scanners.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".