Scalable hedonic coalition formation for task allocation with heterogeneous robots

Author(s):  
Emily Czarnecki ◽  
Ayan Dutta
2021 ◽  
Author(s):  
Ayan Dutta ◽  
Vladimir Ufimtsev ◽  
Tuffa Said ◽  
Inmo Jang ◽  
Roger Eggen

2011 ◽  
Vol 10 (9) ◽  
pp. 1327-1344 ◽  
Author(s):  
Walid Saad ◽  
Zhu Han ◽  
Tamer Basar ◽  
Merouane Debbah ◽  
Are Hjorungnes

2018 ◽  
Vol 15 (6) ◽  
pp. 172988141881303 ◽  
Author(s):  
Bing Xie ◽  
Xueqiang Gu ◽  
Jing Chen ◽  
LinCheng Shen

In this article, we study a problem of dynamic task allocation with multiple agent responsibilities in distributed multi-agent systems. Agents in the research have two responsibilities, communication and task execution. Movements in agent task execution bring changes to the system network structure, which will affect the communication. Thus, agents need to be autonomous on communication network reconstruction for good performance on task execution. First, we analyze the relationships between the two responsibilities of agents. Then, we design a multi-responsibility–oriented coalition formation framework for dynamic task allocation with two parts, namely, task execution and self-adaptation communication. For the former part, we integrate our formerly proposed algorithm in the framework for task execution coalition formation. For the latter part, we develop a constrained Bayesian overlapping coalition game model to formulate the communication network. A task-allocation efficiency–oriented communication coalition utility function is defined to optimize a coalition structure for the constrained Bayesian overlapping coalition game model. Considering the geographical location dependence between the two responsibilities, we define constrained agent strategies to map agent strategies to potential location choices. Based on the abovementioned design, we propose a distributed location pruning self-adaptive algorithm for the constrained Bayesian overlapping coalition formation. Finally, we test the performance of our framework, multi-responsibility–oriented coalition formation framework, with simulation experiments. Experimental results demonstrate that the multi-responsibility oriented coalition formation framework performs better than the other two distributed algorithms on task completion rate (by over 9.4% and over 65% on average, respectively).


Author(s):  
Jer Shyuan Ng ◽  
Wei Yang Bryan Lim ◽  
Zehui Xiong ◽  
Xianbin Cao ◽  
Jiangming Jin ◽  
...  

2018 ◽  
Vol 15 (1) ◽  
pp. 172988141875584 ◽  
Author(s):  
Bing Xie ◽  
Shaofei Chen ◽  
Jing Chen ◽  
LinCheng Shen

This article presents a novel market-based mechanism for a dynamic coalition formation problem backgrounded under real-time task allocation. Specifically, we first analyze the main factors of the real-time task allocation problem, and formulate the problem based on the coalition game theory. Then, we employ a social network for communication among distributed agents in this problem, and propose a negotiation mechanism for agents forming coalitions on timely emerging tasks. In this mechanism, we utilize an auction algorithm for real-time agent assignment on coalitions, and then design a mutual-selecting method to acquire better performance on agent utilization rate and task completion rate. And finally, our experimental results demonstrate that our market-based mechanism has a comparable performance in task completion rate to a decentralized approach (within 25% better on average) and a centralized dynamic coalition formation method (within 10% less on average performance).


2010 ◽  
Vol 22 (2) ◽  
pp. 225-248 ◽  
Author(s):  
Travis C. Service ◽  
Julie A. Adams

Sign in / Sign up

Export Citation Format

Share Document