Edge Intelligence Enhanced Monte Carlo Tree Search for Virtually Coupled Train Set Optimal Control
Bibliographic record
Abstract
Virtually Coupled Train Set (VCTS) is an advanced train control technology enabling multiple trains to operate closely through wireless communication, enhancing capacity and operational flexibility. Traditional VCTS control algorithms struggle with complex dynamic models and local optimality, hindering real-time, long-term optimization. This paper proposes an Edge Intelligence (EI) enhanced Monte Carlo Tree Search (MCTS) framework for VCTS Optimal Control (M-VOC). MCTS is a heuristic search algorithm that identifies optimal operational solutions efficiently, focusing on long-term stability over local optimums. EI supports MCTS for real-time decision-making, and we introduce a model-based reinforcement learning algorithm to manage VCTS's complex dynamics. Our framework addresses VCTS control issues in real-time while optimizing long-term benefits. To meet computational and real-time demands, we propose a train-to-edge cooperative computing strategy using multi-intelligence reinforcement learning. Simulations demonstrate that our EI-enhanced MCTS strategy effectively provides cooperative control, ensuring virtually coupled trains operate safely, stably, and punctually with reduced intervals.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".