John Mark Swafford

Learn More
In this paper we propose an evolutionary approach capable of successfully combining rules to play the popular video game, Ms. PacMan. In particular we focus our attention on the benefits of using Grammatical Evolution to combine rules in the form of “if <condition> then perform <action>”. We defined a set of high-level functions that we think are necessary(More)
We describe the first steps in the adoption of Shape Grammars with Grammatical Evolution for application in Evolutionary Design. Combining the concepts of Shape Grammars and Genetic Programming opens up the exciting possibility of truly generative design assist tools. In this initial study we provide some background on the adoption of grammar-based Genetic(More)
The use of higher-order functions, as a method of abstraction and re-use in EC encodings, has been the subject of relatively little research. In this paper we introduce and give motivation for the ideas of higher-order functions, and describe their general advantages in EC encodings. We implement grammars using higher-order ideas for two problem domains,(More)
Modularity has proven to be an important aspect of evolutionary computation. This work is concerned with discovering and using modules in one form of grammar-based genetic programming, grammatical evolution (GE). Previous work has shown that simply adding modules to GE's grammar has the potential to disrupt fit individuals developed by evolution up to that(More)
There have been many approaches to modularity in the field of evolutionary computation, each tailored to function with a particular representation. This research examines one approach to modularity and grammar modification with a grammar-based approach to genetic programming, grammatical evolution (GE). Here, GE’s grammar was modified over the course of an(More)
In this work, we examine the capabilities of two forms of mappings by means of Grammatical Evolution (GE) to successfully generate controllers by combining high-level functions in a dynamic environment. In this work we adopted the Ms. Pac-Man game as a benchmark test bed. We show that the standard GE mapping and Position Independent GE (πGE) mapping achieve(More)
This work furthers the understanding of modularity in grammar-based genetic programming approaches by analyzing how different grammars may be capable of producing the same phenotypes, but still display differences in performance on the same problems. This is done by creating four grammars with varying levels of modularity and using them with grammatical(More)
Modularity has been an important vein of research in evolutionary algorithms. Past research in evolutionary computation has shown that techniques able to decompose the benchmark problems examined in this work into smaller, more easily solved, sub-problems have an advantage over those which do not. This work describes and analyzes a number of approaches to(More)
EDITORIAL Editorial W elcome back my friends to SIGEVOlution! We disappeared for a while, but we are now back on the saddle again. GECCO-2011 ended less than two weeks ago, but it feels such a long time since we were at the opening reception and at the Guinness Storehouse. I want to take this opportunity to thank once more Michael O'Neill, Anthony Brabazon,(More)
  • 1