Handoff Decision Optimization in Train Autonomous Control Systems Using a Rolling Prediction-Decision Framework
Bibliographic record
Abstract
Train Autonomous Circumambulate System (TACS) represents the next generation of train control systems. Characterized by autonomous travel path planning and train operation adjustments, TACS has heightened demands for real-time communication. Given the high mobility of the system and the surge in train density, handoffs in TACS occur more frequently. An inappropriate handoff decision can lead to extended handoff delays, significantly impacting TACS performance. Current learning-based handoff decision algorithms rely heavily on extensive trial-and-error data from environmental interactions, and it is a challenging feat in urban rail environments. In this paper, we introduce a rolling prediction-decision framework designed to enhance the probability of successful handoffs. We propose STADNet-CP (Spatial-Temporal Attention Deep Network for Channel Prediction), a Deep Learning (DL) based network model enhanced with spatial-temporal attention mechanism to extract the spatial-temporal dependencies in the channel variations and improve the accuracy of channel states prediction. We then formulate a handoff decision optimization problem and adopt the Model Predictive Control (MPC) algorithm to enhance the accuracy and reliability of handoffs utilizing the channel state predictions. Comprehensive experimental results demonstrate that our proposed handoff decision method significantly improves the overall handoff performance.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".