Skip to content
Conference

Fast Convergent Distributed Task Reallocation Method for Dynamic Multi-Agent Systems

Aug 2026 · 2026 IEEE International Conference on Mechatronics and Automation (ICMA) · pp. 1330-1335 · 0 citations · 15 references

Abstract

To address the problem that existing distributed task allocation methods for multi-agent systems hard to simultaneously achieve high allocation performance and fast responsiveness under dynamic changes in tasks and agent states, this paper proposes a task allocation method based on ownership-priority-driven task inclusion and consensus. In the task inclusion phase, a greedy-selection-based route estimation method is first designed to compute the marginal benefit of each task to different agents. Then, a new concept of task ownership priority is introduced to measure the likelihood that a task belongs to each agent. Each agent preferentially includes tasks that both increase its marginal benefit and are more likely to belong to itself, thereby reducing task inclusion conflicts while maintaining allocation performance. In the consensus phase, conflicting assignments are resolved using a marginal-benefit-increase strategy. By reducing invalid competition and repeated iterations, the proposed method achieves convergence with fewer task inclusion and consensus iterations, thereby improving responsiveness in dynamic scenarios. Simulation results demonstrate the effectiveness of the proposed method.

View source

Similar papers

Open access Aug 2026

Heterogeneous Networked Multi-UAV Cooperative Task Allocation Based on a Distributed Performance Impact Algorithm

A dual-fallback mechanism is constructed by a pruning-redundancy coalition formation scheme and a task- segmentation scheme, thereby enhancing both system operational efficiency and task-completion certainty of the proposed DPI algorithm.

Wenhui Ma, Han Zhang, Shuang-Xi Liu · 0 citations
Preprint Aug 2026

Grouping Auction-Consensus Algorithm for Decentralized Task Allocation in Multi-Robot Systems

This paper introduces the Grouping Auction-Consensus Algorithm (GACA), a decentralized MRTA framework that adopts the two-phase auction-consensus architecture of CBBA while fundamentally redesigning its bidding mechanism to reason over groups of spatially proximate tasks.

J. Rodriguez, Sven Koenig, Wen-Jie Dong et al. · 1 citation
Open access Sep 2026

An Event-Triggered Path-Based Bid Assignment Method for Energy-Aware Dynamic Multi-UAV Task Allocation

This study addresses dynamic multi-UAV task allocation under online task release, static obstacles, deadlines, limited energy, and vehicle failures. We propose an event-triggered path-based bid assignment method (ET-PBBA). At each mission event, an A-star module estimates the static-obstacle travel cost of feasible UAV...

Yu-Hua Cong, Yu-Jia Li, Xian Zhu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

DEALS: Decentralized Expertise-Aware Load Serving for Multi-Agent LLM Systems

Experiments show that DEALS not only improves performance along multiple dimensions (e.g., answer accuracy and task throughput) in both homogeneous and heterogeneous agent pools, but also balances agent expertise and workload in a self-organized manner, enabling effective decentralized coordination.

Jing-Hang Huang, Wen-Bin Wang, Yan-Chuan Yin et al. · 0 citations
Conference Open access 2026

Low-Communication Task Coordination Strategy for Multi-Robot Collaboration

Multi-robot task coordination often relies on continuous communication to maintain consistent task allocation and avoid conflicts. However, in real-world scenarios with limited network bandwidth, periodic broadcasting may introduce substantial communication overhead and increase the risk of channel congestion. This pap...

Qin-Yu Wang · 0 citations
Open access 2026

A distributed coalition formation algorithm for large-scale resource assignment under nonlinear coupling constraints

Extensive computational experiments demonstrate that DCFA scales near-linearly with problem size and occupies the optimal compromise point on the utility–time Pareto frontier, achieving order-of-magnitude speedups relative to leading centralized metaheuristics at negligible solution-quality loss.

Jie Gu, Xin-Wang Song, Jian Ge et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.