Computation Resource Optimization for Large-Scale Intelligent Urban Rail Transit: A Mean-Field Game Approach
Bibliographic record
Abstract
Offloading tasks in smart devices (SDs) to an edge intelligence-empowered service centre (EISC) is a promising solution to support burgeoning intelligent applications in large-scale intelligent urban rail transits (URTs). However, dynamic computation resource allocation is still a crucial challenge, facing that various large-scale SDs share the EISC computation resources and the reality that the allocated computation resource for an SD is coupled with the offloading rate of all SDs. This paper proposes a joint dynamic offloading rate control and computation resource optimization method for large-scale intelligent URTs. Firstly, we model the large-scale multi-agent computation resource competition problem by a multi-player differential game (MPDG) and prove that the Nash equilibrium (NE) based optimal solution exists for each SDs. Then, we transform the MPDG model into a mean-field game (MFG). By introducing the mean-field into the game, we can solve the multi-agent optimization problem with a single-agent optimization method. We illustrate the rationality of the MFG model and propose an iterative solution method based on the finite difference method to derive the solution. Finally, we propose a z-transforming-based control method to dynamically reschedule computation resources among intelligent applications to achieve a satisfactory quality of service (QoS). Extensive simulation results show that our proposed scheme can significantly improve the performance of intelligent URTs.
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.001 | 0.002 |
| 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 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".