论文信息 - Grammatical Swarm

Grammatical Swarm

This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic programming based on Social Learning, Social Programming or Swarm Programming. Each individual particle represents choices of program construction rules, where these rules are specified using a Backus-Naur Form grammar. The results demonstrate that it is possible to generate programs using the Grammatical Swarm technique.

Anthony Brabazon | Michael O'Neill | A. Brabazon | M. O’Neill

[1] John R. Koza,et al. Genetic Programming IV: Routine Human-Competitive Machine Intelligence , 2003 .

[2] Una-May O'Reilly,et al. Genetic Programming II: Automatic Discovery of Reusable Programs. , 1994, Artificial Life.

[3] Peter Nordin,et al. Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[4] Michael O'Neill,et al. Grammatical Evolution: Evolving Programs for an Arbitrary Language , 1998, EuroGP.

[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] Vidroha Debroy,et al. Genetic Programming , 1998, Lecture Notes in Computer Science.

[7] Barbara Webb,et al. Swarm Intelligence: From Natural to Artificial Systems , 2002, Connect. Sci..

[8] Ernesto Costa,et al. An Empirical Comparison of Particle Swarm and Predator Prey Optimisation , 2002, AICS.

[9] Riccardo Poli,et al. Why Ants are Hard , 1998 .

[10] Michael O'Neill,et al. Grammatical evolution - evolutionary automatic programming in an arbitrary language , 2003, Genetic programming.

[11] Maarten Keijzer,et al. Crossover in Grammatical Evolution , 2003, Genetic Programming and Evolvable Machines.