Market Clearing–based Dynamic Multi-agent Task Allocation

2020 ◽  
Vol 11 (1) ◽  
pp. 1-25
Author(s):  
Sofia Amador Nelke ◽  
Steven Okamoto ◽  
Roie Zivan
Keyword(s):  
Task Allocation ◽  
Market Clearing ◽  
Multi Agent

Ant Colony Optimization for task allocation in Multi-Agent Systems

2013 ◽  
Vol 10 (3) ◽  
pp. 125-132 ◽  
Author(s):  
Lu Wang ◽  
Zhiliang Wang ◽  
Siquan Hu ◽  
Lei Liu
Keyword(s):  
Ant Colony Optimization ◽  
Task Allocation ◽  
Ant Colony ◽  
Multi Agent Systems ◽  
Agent Systems ◽  
Multi Agent

scholarly journals Improving Computational Efficiency in Crowded Task Allocation Games with Coupled Constraints

2019 ◽  
Vol 9 (10) ◽  
pp. 2117
Author(s):  
Ming Chong Lim ◽  
Han-Lim Choi
Keyword(s):  
Task Allocation ◽  
Random Sampling ◽  
Scheduling Algorithm ◽  
Stochastic Algorithm ◽  
Speed Of Convergence ◽  
Temporal Dependence ◽  
Real World Applications ◽  
Coupled Constraints ◽  
Multi Agent ◽  
Feasible Solutions

Multi-agent task allocation is a well-studied field with many proven algorithms. In real-world applications, many tasks have complicated coupled relationships that affect the feasibility of some algorithms. In this paper, we leverage on the properties of potential games and introduce a scheduling algorithm to provide feasible solutions in allocation scenarios with complicated spatial and temporal dependence. Additionally, we propose the use of random sampling in a Distributed Stochastic Algorithm to enhance speed of convergence. We demonstrate the feasibility of such an approach in a simulated disaster relief operation and show that feasibly good results can be obtained when the confirmation and sample size requirements are properly selected.

scholarly journals A multi-responsibility–oriented coalition formation framework for dynamic task allocation in mobile–distributed multi-agent systems

2018 ◽  
Vol 15 (6) ◽  
pp. 172988141881303 ◽  
Author(s):  
Bing Xie ◽  
Xueqiang Gu ◽  
Jing Chen ◽  
LinCheng Shen
Keyword(s):  
Coalition Formation ◽  
Task Allocation ◽  
Game Model ◽  
Multi Agent Systems ◽  
Coalition Game ◽  
Task Execution ◽  
Agent Systems ◽  
Dynamic Task ◽  
Dynamic Task Allocation ◽  
Multi Agent

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).

Research on dynamic task allocation for multiple unmanned aerial vehicles

2017 ◽  
Vol 39 (4) ◽  
pp. 466-474 ◽  
Author(s):  
Yongfei Miao ◽  
Luo Zhong ◽  
Yufu Yin ◽  
Chengming Zou ◽  
Zhenjun Luo
Keyword(s):  
Unmanned Aerial Vehicles ◽  
Task Allocation ◽  
Clonal Selection ◽  
Immune Memory ◽  
Allocation Model ◽  
Dynamic Task ◽  
Aerial Vehicles ◽  
Dynamic Task Allocation ◽  
Multi Agent ◽  
Multiple Unmanned Aerial Vehicles

To solve the distributed task allocation problems of search and rescue missions for multiple unmanned aerial vehicles (UAVs), this paper establishes a dynamic task allocation model under three conditions: 1) when new targets are detected, 2) when UAVs break down and 3) when unexpected threats suddenly occur. A distributed immune multi-agent algorithm (DIMAA) based on an immune multi-agent network framework is then proposed. The technologies employed by the proposed algorithm include a multi-agent system (MAS) with immune memory, neighbourhood clonal selection, neighbourhood suppression, neighbourhood crossover and self-learning operators. The DIMAA algorithm simplifies the decision-making process among agents. The simulation results show that this algorithm not only obtains the global optimum solution, but also reduces the communication load between agents.

Sign in / Sign up

Export Citation Format

Share Document