Multi-agent Task Decomposition and Resource Scheduling Algorithm Construction

In the context of ubiquitous connectivity and collaborative multi device applications, the functionality of physical device resources is decomposed into discrete atomic models to enhance the flexibility and reusability of device cluster services. In current practical applications, assembling and efficiently scheduling discrete resources in a task-oriented manner has become an urgent issue. Therefore, we propose a task decomposition algorithm based on the capability model, which splits and matches tasks based on the resource capability model. Then, according to the proposed bitmap-based hybrid resource scheduling algorithm, we achieve fine-grained and efficient collaborative scheduling of service-oriented resources.

Authors

Publication Details

Published
2024-09-20
DOI
https://doi.org/10.1109/icmra62519.2024.10809299
Citations
1
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-agent Task Decomposition and Resource Scheduling Algorithm Construction

Yi Hang, Ruliang Lin, Xinyang Liu, Hao Wang
1 citations
Distributed and Parallel Computing Systems
0.35
article

Multi-agent Task Decomposition and Resource Scheduling Algorithm Construction

Yi Hang, Ruliang Lin, Xinyang Liu, Hao Wang
article en
1 citations

Abstract

In the context of ubiquitous connectivity and collaborative multi device applications, the functionality of physical device resources is decomposed into discrete atomic models to enhance the flexibility and reusability of device cluster services. In current practical applications, assembling and efficiently scheduling discrete resources in a task-oriented manner has become an urgent issue. Therefore, we propose a task decomposition algorithm based on the capability model, which splits and matches tasks based on the resource capability model. Then, according to the proposed bitmap-based hybrid resource scheduling algorithm, we achieve fine-grained and efficient collaborative scheduling of service-oriented resources.

Decent work and economic growth
Openalex Percentile: Top 35%
Distributed and Parallel Computing Systems
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.