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