Digital Twin-Driven VCTS Control: An Iterative Apporach Using Model-Based Reinforcement Learning
Bibliographic record
Abstract
The Virtually Coupled Train Set (VCTS) is a promising framework to improve the efficiency of urban rail transits (URTs), addressing challenges introduced by time-varying and location-varying passenger flow. However, traditional train control models, relying on liner approximation methods to fit nonlinear dynamic models, cannot meet the safety-critical and latency-sensitive task requirements of VCTS systems. Although artificial intelligence (AI)-based control models are promising, substantial training data and computational resources is challenging in URTs. In response to these challenges, this paper proposes a novel digital twin (DT) driven VCTS framework and an iterative-based control policy learning approach. In the designed DT-driven VCTS system, we collect essential training data from the physical domain, representing the real-world environment. We employ model-based reinforcement learning (MBRL) to learn the dynamic train model and optimize the train control policy in the digital domain, a simulated environment mirroring the physical domain. This approach uniquely leverages model predictions for policy optimization during the training process, adapting to a broad range of scenarios beyond reliance on actual operational data. Furthermore, by employing an iterative learning approach and integrating the physical and digital domains, the train control model and policy can be updated to effectively handle uncertainties and complexities encountered in real-world situations. Extensive experiments validates the effectiveness of our proposed framework, demonstrating its robust performance and adaptability across diverse conditions.
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.001 |
| 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".