Toward Intelligent and Adaptive Task Scheduling for 6G: An Intent-Driven Framework
Bibliographic record
Abstract
A cloud network schedules diverse tasks to multi-access edge computing (MEC) or cloud platforms within dynamic industrial Internet of Things (IIoT). The scheduling is influenced by the diverse intents of different parties, including the time-sensitive nature of device-generated tasks and the energy efficiency of servers. The complexity of this problem under dynamic network conditions is underscored by its nature as a Markov state transition process, typically classified as NP-hard. We introduce an intent-driven intelligent task scheduling approach (IITSA), which models a partially observable Markov decision process (POMDP) and introduces a multi-agent proximal policy optimization (MAPPO) method. We introduce a dynamic adaptive mechanism to effectively address conflicts arising from the temporal requirements and energy limitations associated with various tasks on MEC servers. This mechanism enhances the reward function of MAPPO, for which we offer comprehensive mathematical analysis to validate its convergence performance. Simulation results showcase that our proposed IITSA effectively achieves a harmonious trade-off between time-sensitive demands and infrastructure energy efficiency while exhibiting high adaptability. Compared to state-of-the-art algorithms like MADDPG and QMIX, IITSA reduces energy consumption by 11.68% and 7.07%, and enhances on-time completion numbers for time-sensitive tasks by 18.33% and 12.17%, respectively.
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.001 | 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".