task allocation
Recently Published Documents


TOTAL DOCUMENTS

2492
(FIVE YEARS 741)

H-INDEX

52
(FIVE YEARS 13)

2031 ◽  
Vol 15 (3) ◽  
pp. 1-24
Author(s):  
Jose Barambones ◽  
Florian Richoux ◽  
Ricardo Imbert ◽  
Katsumi Inoue

Team formation (TF) faces the problem of defining teams of agents able to accomplish a set of tasks. Resilience on TF problems aims to provide robustness and adaptability to unforeseen events involving agent deletion. However, agents are unaware of the inherent social welfare in these teams. This article tackles the problem of how teams can minimise their effort in terms of organisation and communication considering these dynamics. Our main contribution is twofold: first, we introduce the Stabilisable Team Formation (STF) as a generalisation of current resilient TF model, where a team is stabilisable if it possesses and preserves its inter-agent organisation from a graph-based perspective. Second, our experiments show that stabilisability is able to reduce the exponential execution time in several units of magnitude with the most restrictive configurations, proving that communication effort in subsequent task allocation problems are relaxed compared with current resilient teams. To do so, we developed SBB-ST, a branch-and-bound algorithm based on Distributed Constrained Optimisation Problems (DCOP) to compute teams. Results evidence that STF improves their predecessors, extends the resilience to subsequent task allocation problems represented as DCOP, and evidence how Stabilisability contributes to resilient TF problems by anticipating decisions for saving resources and minimising the effort on team organisation in dynamic scenarios.


2022 ◽  
Author(s):  
Arezoo Samiei ◽  
Md Arifin Arif ◽  
Trevor Karpinski ◽  
Fengyu Wang ◽  
Liang Sun

2022 ◽  
Vol 62 ◽  
pp. 135-144
Author(s):  
M. De Ryck ◽  
D. Pissoort ◽  
T. Holvoet ◽  
E. Demeester
Keyword(s):  

2021 ◽  
Vol 12 (1) ◽  
pp. 272
Author(s):  
Bumjin Park ◽  
Cheongwoong Kang ◽  
Jaesik Choi

This paper deals with the concept of multi-robot task allocation, referring to the assignment of multiple robots to tasks such that an objective function is maximized. The performance of existing meta-heuristic methods worsens as the number of robots or tasks increases. To tackle this problem, a novel Markov decision process formulation for multi-robot task allocation is presented for reinforcement learning. The proposed formulation sequentially allocates robots to tasks to minimize the total time taken to complete them. Additionally, we propose a deep reinforcement learning method to find the best allocation schedule for each problem. Our method adopts the cross-attention mechanism to compute the preference of robots to tasks. The experimental results show that the proposed method finds better solutions than meta-heuristic methods, especially when solving large-scale allocation problems.


Sign in / Sign up

Export Citation Format

Share Document