Investigating binary PSO parameter influence on the knights cover problem

The underlying relationship between various PSO parameters is experimentally examined by applying the binary PSO (BinPSO) algorithm to solve the knights cover problem. An exhaustive analysis of the cognitive and social acceleration constants is performed, as well as an investigation into the influence of an increased maximum velocity on overall performance. An intuitive visualisation method eases the analysis of experimental results, and certain assumptions about the direct mapping of continuous PSO to BinPSO parameter values are corrected. The effects of increasing the complexity of the problem are also directly studied and recommendations made to improve performance under larger board sizes

[1]  L F Landweber,et al.  Molecular computation: RNA solutions to chess problems , 2000, Proc. Natl. Acad. Sci. USA.

[2]  Andries Petrus Engelbrecht,et al.  Evolving intelligent game-playing agents , 2004, South Afr. Comput. J..

[3]  V. Scott Gordon,et al.  The knight's tour - evolutionary vs. depth-first search , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[4]  Andries Petrus Engelbrecht,et al.  PSO approaches to coevolve IPD strategies , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[5]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[6]  Cornelis J. Franken,et al.  PSO-based coevolutionary Game Learning , 2004 .

[7]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[8]  Andries Petrus Engelbrecht,et al.  Comparing PSO structures to learn the game of checkers from zero knowledge , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[9]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[10]  David G Stevenson.  THE BEHAVIOUR OF PARTICLES , 1997 .