|
|
|
| Complicated Coalition Parallel Generation Based on Discrete Particle Swarm Optimization |
| Jiang Jian-guo;Zhang Guo-fu; Qi Mei-bin;Su Zhao-pin |
| School of Computer and Information Science, Hefei University of Technology, Hefei 230009, China; Engineering Research Center of Safety Critical Industrial Measurement and Control Technology, Ministry of Education, Hefei 230009, China |
|
|
|
|
Abstract Coalition generation is a key problem in multi-agent systems. Discrete particle swarm optimization is adopted to solve the problem, and random perturbation of particles is used to avoid premature convergence. A novel two-dimensional binary encoding is designed to realize complicated coalition parallel generation, and the operation of conflict resolution, feasibility checking, and compensation strategy are brought into effect to surmount the resource conflict and coalition lock in the course of problem solving. Finally, several typical simulation studies are carried out to illustrate its validity.
|
|
Received: 03 September 2007
|
|
|
|
|
|
|
|
|
2009, Vol. 31 
