Multi-task overlapping coalition parallel formation algorithm

The issue of coalition formation has been investigated from many aspects, but until recently little attention has been paid to overlapping coalition formation. What’s more, an algorithm of multi-task coalition parallel formation hasn’t been proposed yet. In this contribution, we adopt the binary Particle Swarm Optimization (PSO) to address the coalition formation problem, taking overlapping coalition and parallelizability into account simultaneously. We develop an algorithm to parallelize the process of overlapping coalition formation, and guarantee the precedence order of tasks at the same time. As for our algorithm, a strategy is introduced to improve its capability of global searching and convergent rate of its solutions. Categories and Subject Descriptors I.2.11[Artificial Intelligence]: Distributed Artificial Intelligence –multiagent systems. General Terms Algorithms Keywords Multi-agent system, Coalition formation, Overlapping coalition, Particle swarm optimization

• Type: Conference
• Year: 2007
• Where: ATAL
• Authors: Chao-Feng Lin, Shan-Li Hu
• Keywords: ATAL 2007, Coalition Formation, Overlapping Coalition, Particle Swarm Optimization