Crowdsensing-based bridge vibration monitoring using a sparse network of random mobile sensors: Theory and numerical verifications
Bibliographic record
Abstract
Vibration monitoring of bridges is essential for the safety and maintenance of transportation infrastructure. Traditional methods rely on placing sensors directly on bridges, a process that is often costly and difficult to scale. An emerging alternative involves utilizing sensors mounted within vehicles as they traverse the bridge. However, this approach often faces challenges with continuous monitoring due to the limited time vehicles spend on the structure. This paper presents a novel framework for predicting bridge responses and identifying its modal characteristics through the crowdsensing of sparse vibration data from a network of vehicles traversing the bridge. The framework employs vehicles’ body accelerations and positional data to estimate bridge responses at distributed virtual fixed sensing nodes (VFSNs). By randomly selecting some vehicles as sensing agents at sequential timestamps, it ensures a reliable and continuous flow of data. Additionally, the framework mitigates the influence of road roughness and vehicle dynamics by utilizing residual contact-point responses between the rear and front axles of the sensing vehicles. Simulations of a three-span bridge under realistic traffic conditions, including road roughness and vehicle–bridge interaction, were conducted to validate the framework’s accuracy. Despite an 80% data missing rate and relying on only two sensing agents along with 17 VFSNs, the framework successfully identified the first three modes of the bridge with MAC values above 95% and natural frequencies with relative errors below 3%. Response predictions showed an accuracy exceeding 70%. Various factors were investigated, including traffic speed, the number of sensing agents and VFSNs, ambient noise effects, and the impact of the random vehicle selection process. The results confirmed the robustness of the framework against ambient noise and randomness in sensing agent selection. The optimal configuration was identified as two sensing agents and 17 VFSNs.
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".