%0 Journal Article %1 Wilson:2002:CJECE %A Wilson, Garnett %A Heywood, Malcolm %D 2002 %I IEEE Press %J Canadian Journal of Electrical and Computer Engineering %K algorithms, genetic learning programming, strategy %N 3 %P 113--116 %T Crossover context in page-based linear genetic programming %U http://ieee.ca/journal/backissues_tofc_27_3.html %V 27 %X This work explores strategy learning through genetic programming in artificial 'ants' that navigate the San Mateo trail. We investigate several properties of linearly structured (as opposed to typical tree-based) GP including: the significance of simple register based memories, the significance of constraints applied to the crossover operator, and how 'active' the ant are. We also provide a basis for investigating more thoroughly the relation between specific code sequences and fitness by dividing the genome into pages of instructions and introducing an analysis of fitness change and exploration of the trail done by particular parts of a genome. By doing so we are able to present results on how best to find the instructions in an individual's program that contribute positively to the accumulation of effective search strategies.

@article{Wilson:2002:CJECE, abstract = {This work explores strategy learning through genetic programming in artificial 'ants' that navigate the San Mateo trail. We investigate several properties of linearly structured (as opposed to typical tree-based) GP including: the significance of simple register based memories, the significance of constraints applied to the crossover operator, and how 'active' the ant are. We also provide a basis for investigating more thoroughly the relation between specific code sequences and fitness by dividing the genome into pages of instructions and introducing an analysis of fitness change and exploration of the trail done by particular parts of a genome. By doing so we are able to present results on how best to find the instructions in an individual's program that contribute positively to the accumulation of effective search strategies.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Wilson, Garnett and Heywood, Malcolm}, biburl = {https://www.bibsonomy.org/bibtex/22bc9e494563e0cdc95dea7c0fc25cf92/brazovayeye}, interhash = {3198643db5b89a35cca1e38cb3718c10}, intrahash = {2bc9e494563e0cdc95dea7c0fc25cf92}, issn = {0840-8688}, journal = {Canadian Journal of Electrical and Computer Engineering}, keywords = {algorithms, genetic learning programming, strategy}, notes = {Author says same content as \cite{wilson:2003:ccpb}}, number = 3, organisation = {IEEE Canada}, pages = {113--116}, publisher = {IEEE Press}, timestamp = {2008-06-19T17:54:13.000+0200}, title = {Crossover context in page-based linear genetic programming}, url = {http://ieee.ca/journal/backissues_tofc_27_3.html}, volume = 27, year = 2002 }