A Cognitive Control Method for Cost-Efficient CBTC Systems With Smart Grids
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Communication-based train control (CBTC) systems use wireless local area networks for information transmission between trains and wayside equipment. Since inevitable packet delay and drop are introduced in train-wayside communications, information uncertainties in trains' states will lead to unplanned traction/braking demands, as well as waste in electrical energy. Moreover, with the introduction of regenerative braking technology, power grids in CBTC systems are evolving to smart grids, and cost-aware power management should be employed to reduce the total financial cost of consumed electrical energy. In this paper, a cognitive control method for CBTC systems with smart grids is presented to enhance both train operation performance and cost efficiency. We formulate a cognitive control system model for CBTC systems. The information gap in cognitive control is calculated to analyze how the train-wayside communications affect the operation of trains. The Q-learning algorithm is used in the proposed cognitive control method, and a joint objective function composed of the information gap and the total financial cost is a.pplied to generate optimal policy. The medium-access control layer retry-limit adaption and traction strategy selection are adopted as cognitive actions. Extensive simulation results show that the cost efficiency and train operation performance of CBTC systems are substantially improved using our proposed cognitive control method.
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.
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.001 | 0.000 |
| 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.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 it