International Journal of Prognostics and Health Management, ISSN 2153-2648, 2017 019 1 A Condition Based Maintenance Implementation for an Automated People Mover Gearbox
Bibliographic record
Abstract
Data-driven condition-based maintenance (CBM) can be an effective predictive maintenance strategy for components within complex systems with unknown dynamics, nonstationary vibration signatures or a lack of historical failure data. CBM strategies allow operators to maintain components based on their condition in lieu of traditional alternatives such as preventive or corrective strategies. In this paper, the authors present an outline of the CBM program and a field pilot study being conducted on the gearbox, a critical component in an automated cable-driven people mover (APM) system at Toronto’s Pearson airport. This CBM program utilizes a paired server-client “two-tier” configuration for fault detection and prognosis. At the first level, fault detection is performed in real-time using vibration data collected from accelerometers mounted on the APM gearbox. Time-domain condition indicators are extracted from the signals to establish the baseline condition of the system to detect faults in real-time. All tier one tasks are handled autonomously using a controller located on-site. In the second level pertaining to prognostics, these condition indicators are utilized for degradation modeling and subsequent remaining useful life (RUL) estimation using random coefficient and stochastic degradation models. Parameter estimation is undertaken using a hierarchical Bayesian approach. Degradation parameters and the RUL model are updated in a feedback loop using the collected degradation data. While the case study presented will primarily focus on a cable-driven APM gearbox, the underlying theory and the tools developed to undertake diagnostics and prognostics tasks are broadly applicable to a wide range of other civil and industrial applications.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.020 | 0.005 |
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 source (direct Gemma or distilled Codex), 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".