A Network Connectivity-Aware Reinforcement Learning Method for Task Exploration and Allocation
Bibliographic record
Abstract
For a limited scale self-organized multi-agent system operating in environments with unknown task distributions, one challenge is to reduce the task response time via efficiently combining task exploration and allocation, another challenge is to improve the task completion rate via unlocking the potential of network cooperation in task allocation. However, in the existing studies, task allocation is generally regarded as an independent issue for known task distribution environments, rarely combined with task exploration, also hardly solving the conflict between the multi-hop network cooperation and mobility flexibility of agents. In view of this, this paper proposes a network connectivity-aware deep reinforcement learning method for task exploration and allocation in limited scale multi-agent systems (NCADRL4TEA). This method divides the task environment into regions and integrates task exploration with task allocation via two policies: a leaving policy to guide global task exploration among regions according to the distribution of agents and tasks, and a stay policy to guide local task allocation within each region according to the multi-hop network cooperation performance between agents. Further, in the stay policy, a network connectivity-aware task allocation optimization model is provided, which leads agents in the same region to cooperate with each other via multi-hop intermittent network connectivity and flexibly adjust their locations until the optimal multi-hop network cooperation performance is achieved. The experimental results verify that NCADRL4TEA can reduce the task response time in combination of task exploration and allocation, and improve the task completion rate in network cooperation.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 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".