Proceedings

Task Allocation Via Coalition Formation Among Autonomous Agents

Download BibTeX Cite

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Distributed AI. Pages 655-660.

Abstract

Autonomous agents working in multi-agent environments may need to cooperate in order to fulfill tasks. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents which will perform the task . The allocation of tasks to groups of agents is necessary when tasks cannot be performed by a single agent. It may also be useful to assign groups of agents to tasks when the group's performance is more efficient than the performance of single agents. In this paper we give an efficient solution to the problem of task allocation among autonomous agents, and suggest that the agents will form coalitio~s in order to perform tasks or improve the efficiency. We present a distributed algorithm ~ith a low ratio bound and with a low computatiOnal complexity. Our algorithm is an any-time algorithm, it is simple, efficient and easy to implement.

Onn Shehory, and Sarit Kraus. 1995. Task Allocation Via Coalition Formation Among Autonomous Agents. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95. IJCAI, 655–660. https://ijcai.org/proceedings/1995/86
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards