Energy-Efficient Speed Profile Approximation: An Optimal Switching Region-Based Approach with Adaptive Resolution
Bibliographic record
Abstract
Speed profile optimization plays an important role in optimal train control. Considering the characteristics of an electrical locomotive with regenerative braking, this paper proposes a new algorithm for target speed profile approximation. This paper makes the following three contributions: First, it proves that under a certain calculation precision, there is an optimal coast-brake switching region—not just a point where the train should be switched from coasting mode to braking mode. This is very useful in engineering applications. Second, the paper analyzes the influence of regenerative braking on the optimal coast-brake switching region and proposes an approximate linear relationship between the optimal switching region and the regeneration efficiency. Third, the paper presents an average speed equivalent algorithm for local speed profile optimization in steep sections. In addition, this paper simplifies the proof of the optimality of smooth running on a non-steep track in two steps. The effects on energy consumption from two important factors (optimal coast and running time) are systematically analyzed. Extensive simulations verify these points of view and demonstrate that the proposed approximation approach is computationally efficient and achieves sufficient engineering accuracy.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".