Greedy Algorithm Solution to Agent Coalition for Single Task

Coalition is an important cooperative method in multi-agent system (MAS). It is a complicated combinatorial optimization problem to search for the optimal, task-oriented Agent coalition. A greedy algorithm is presented since no greedy algorithms have been adopted in this problem so far. The greedy criterion is that the more ability and the less cost brought to a coalition by an agent, the better the agent is. Two expressions of the greedy criterion have been studied. The results of contrastive experiments show that this algorithm is effective.