Decentralized adaptive task allocation for dynamic multi-agent systems

We present a decentralized two-layer architecture for dynamic task assignment in multi-agent systems, designed to operate under partial observability, noisy feedback, and limited communication. The system consists of adaptive controllers that predict task parameters via recursive regression with forgetting and selectively broadcast tasks to a small subset of agents based on relevance and availability. To ensure consistency of task models across the network, we introduce a distributed optimization procedure that combines Simultaneous Perturbation Stochastic Approximation (SPSA) with consensus-based synchronization. The proposed approach enables scalable, online task allocation without centralized coordination. As a representative application, we evaluate the system on simulated workloads involving prompt-based tasks assigned to a diverse set of large language models (LLMs), demonstrating its robustness across varying noise levels, task dynamics, and input arrival patterns.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-11-10
DOI
https://doi.org/10.1038/s41598-025-21709-9
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decentralized adaptive task allocation for dynamic multi-agent systems

Kirill Chernikov, Elizaveta Tarasova, Victoria Erofeeva, Oleg Granichin
Scientific Reports
Distributed Control Multi-Agent Systems
article

Decentralized adaptive task allocation for dynamic multi-agent systems

Kirill Chernikov, Elizaveta Tarasova, Victoria Erofeeva, Oleg Granichin
article en

Abstract

We present a decentralized two-layer architecture for dynamic task assignment in multi-agent systems, designed to operate under partial observability, noisy feedback, and limited communication. The system consists of adaptive controllers that predict task parameters via recursive regression with forgetting and selectively broadcast tasks to a small subset of agents based on relevance and availability. To ensure consistency of task models across the network, we introduce a distributed optimization procedure that combines Simultaneous Perturbation Stochastic Approximation (SPSA) with consensus-based synchronization. The proposed approach enables scalable, online task allocation without centralized coordination. As a representative application, we evaluate the system on simulated workloads involving prompt-based tasks assigned to a diverse set of large language models (LLMs), demonstrating its robustness across varying noise levels, task dynamics, and input arrival patterns.

Scientific ReportsVol. 15(1)
St Petersburg University (RU), ITMO University (RU)
Ministero dello Sviluppo Economico
Openalex Percentile: Top 61%
Distributed Control Multi-Agent Systems
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.

Decentralized adaptive task allocation for dynamic multi-agent systems — Kirill Chernikov, Elizaveta Tarasova, et al. · Scientific Reports (2025) | TGRS Research Map | TGRS