Evidence map›Paper›PMID 40731122›Full record

ArticleScientific reports2025

A new method of task aggregation and optimization allocation for multiple groups collaborative task networks.

WeiWei Du, XiaoWei Chen

Abstract read
In one paragraph

Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

WeiWei DuSchool of Mechatronics Engineering, Beijing Institute of Technology, Beijing, 100081, China. wwd09291026@163.com.
XiaoWei ChenState Key Laboratory of Explosion Science and Safety Protection, Beijing Institute of Technology, Beijing, 100081, China.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

As task diversity and inter-task relationship complexity grow, optimal formation power allocation is key to improving task execution efficiency. This paper proposes a task optimization allocation method with multiple groups collaboration, constructing a task network based on analysis of task static characteristics and inter-task relationship attributes. Firstly, the Lasswell 5W model is introduced to explore task characteristics, extend inter-task relationship types, and propose a generalized quantitative description method of the task network based on binary groups. Secondly, considering task allocation requirements, space-time constraints, resource capacity and demand constraints, the multi-group collaborative task allocation problem is transformed into a multi-constraint multi-objective optimization problem, establishing a multi-group task allocation mathematical model. Subsequently, the large-scale task network is decomposed into sub-task networks. The clustering cost function for tasks is constructed by analyzing the similarity between formation force locations and resource requirements, and between sub-task locations and resource requirements. The initial allocation strategy for subsets of formations and tasks is established. Finally, an adaptive mechanism is introduced to optimize the genetic algorithm's crossover and mutation strategies, proposing a new adaptive optimal allocation algorithm for multiple groups tasks. Experimental results show that the proposed method achieves efficient task assignment under complex and diverse task planning scenarios.

Indexed as

Adaptive genetic algorithmMulti-constraint multi-objective optimizationOptimal task allocationTask aggregationTask networks

Identifiers

PMID40731122
PMCPMC12307584

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.