Multi-Agent Task Allocation in Complementary Teams: A Hunter and Gatherer Approach

by   Mehdi Dadvar, et al.

Consider a dynamic task allocation problem, where tasks are unknowingly distributed over an environment. This paper considers each task comprised of two sequential subtasks: detection and completion, where each subtask can only be carried out by a certain type of agent. We address this problem using a novel nature-inspired approach called "hunter and gatherer". The proposed method employs two complementary teams of agents: one agile in detecting (hunters) and another dexterous in completing (gatherers) the tasks. To minimize the collective cost of task accomplishments in a distributed manner, a game-theoretic solution is introduced to couple agents from complementary teams. We utilize market-based negotiation models to develop incentive-based decision-making algorithms relying on innovative notions of "certainty and uncertainty profit margins". The simulation results demonstrate that employing two complementary teams of hunters and gatherers can effectually improve the number of tasks completed by agents compared to conventional methods, while the collective cost of accomplishments is minimized. In addition, the stability and efficacy of the proposed solutions are studied using Nash equilibrium analysis and statistical analysis respectively. It is also numerically shown that the proposed solutions function fairly, i.e. for each type of agent, the overall workload is distributed equally.


page 1

page 13


Exploration and Coordination of Complementary Multi-Robot Teams In a Hunter and Gatherer Scenario

This paper considers the problem of dynamic task allocation, where tasks...

Considerations for Task Allocation in Human-Robot Teams

In human-robot teams where agents collaborate together, there needs to b...

Task Allocation with Load Management in Multi-Agent Teams

In operations of multi-agent teams ranging from homogeneous robot swarms...

Dynamic Multi-Robot Task Allocation under Uncertainty and Temporal Constraints

We consider the problem of dynamically allocating tasks to multiple agen...

Game-theoretical approach for task allocation problems with constraints

The distributed task allocation problem, as one of the most interesting ...

Decentralized Game-Theoretic Control for Dynamic Task Allocation Problems for Multi-Agent Systems

We propose a decentralized game-theoretic framework for dynamic task all...

Feasibility Study: Moving Non-Homogeneous Teams in Congested Video Game Environments

Multi-agent path finding (MAPF) is a well-studied problem in artificial ...

Please sign up or login with your details

Forgot password? Click here to reset