Reinforcement Learning Enabled Dynamic Resource Allocation in the Internet of Vehicles
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
As an important application scenario of the industrial Internet of things, the Internet of Vehicles can significantly improve road safety, improve traffic management efficiency, and improve people's travel experience. Due to the high dynamics of the Internet of vehicles environment, the traditional resource optimization technologies cannot meet the requirements of the Internet of vehicles for dynamic communication, computing and storage resources optimization management, and artificial intelligence algorithms can adaptively obtain dynamic resource allocation schemes through self-learning. Therefore, adopting artificial intelligence techniques to optimize the dynamic resource of the Internet of Vehicles is the research focus of this article. In this article, we first model the Internet of Vehicles resource allocation problem as a semi-Markov decision process that introduces a resource reservation strategy and a secondary resource allocation mechanism. Then, the reinforcement learning algorithm is used to solve the model. Thereafter, it theoretically analyzes the joint optimization of computing and communication resources, models it as a hierarchical architecture, and uses hierarchical reinforcement learning to obtain the optimal system resource allocation plan. Finally, the results of simulation experiments show that the dynamic resource allocation scheme of the Internet of vehicles based on the reinforcement learning in this article greatly improve resource utilization and user quality of experience with guaranteeing system quality of service compared with the traditional greedy algorithm.
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.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 it