Collaborative Computing in Vehicular Networks: A Deep Reinforcement Learning Approach
Bibliographic record
Abstract
Mobile edge computing (MEC) has been recognized as a promising technology to support various emerging services in vehicular networks. With MEC, vehicle users can offload their computation-intensive applications (e.g., intelligent path planning and safety applications) to edge computing servers located at roadside units. In this paper, an efficient computing offloading and server collaboration approach is proposed to reduce computing service delay and improve service reliability for vehicle users. Task partition is adopted, whereby the computation load offloaded by a vehicle can be divided and distributed to multiple edge servers. By the proposed approach, the computation delay can be reduced by parallel computing, and the failure in computing results delivery can also be alleviated via cooperation among edges. The offloading and computing decision-making is formulated as a long-term planning problem, and a deep reinforcement learning technique, i.e., deep deterministic policy gradient, is adopted to achieve the optimal solution of the complex stochastic nonlinear integer optimization problem. Simulation results show that our collaborative computing approach can adapt to different service environments and outperform the greedy offloading approach.
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.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.001 | 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".