Task Allocation among Agents of Restricted Alliance

V. Mashkov (Czech Republic)

Keywords

Overlapping coalitions, coalitional value, independent tasks

Abstract

The paper deals with a specific cooperative multi-agent system, namely restricted alliance (RA). In RA not all agents communicate with each other. Facing a set of tasks, agents of RA decide on tasks allocation to groups of agents (coalitions). This paper presents a novel approach to solving the problem of task allocation among agents which takes into account the restrictions on agents’ communications. We also focus on overlapping coalitions where the participating agents have to make a decision about partition of their resources between the coalitions in which they are members. The paper presents simple and efficient distributed algorithm of the allocation of tasks to coalitions, applicable for such cooperative agent-systems as restricted alliances. The effectiveness of the proposed approach is demonstrated with simulation results.

Important Links:



Go Back


IASTED
Rotating Call For Paper Image