A study of evolutionary robustness in stochastically tiled polyominos

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A study of evolutionary robustness in stochastically tiled polyominos

Full text

Pdf (254 KB)

Source

Genetic And Evolutionary Computation Conference archive
Proceedings of the 2005 conference on Genetic and evolutionary computation table of contents

Washington DC, USA

SESSION: Artificial life, evolutionary robotics, and adaptive behavior table of contents

Pages: 19 - 26

Year of Publication: 2005

ISBN:1-59593-010-8

Authors

Justin Schonfeld	Iowa State University, Ames, IA
Daniel Ashlock	University of Guelph, Guelph, Ontario

Sponsors

SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 25, Citation Count: 1

Additional Information:

abstract references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1068009.1068013 What is a DOI?

ABSTRACT

Given an evolutionary optimization problem with many possible genotypes for each phenotype this study investigates if the evolved genes for a given phenotype are more robust to point mutation than randomly sampled genes for the same phenotype. This question is addressed using a cellular representation for polyominos in the plane. The evolutionary computation system optimizes for shapes which pack well onto the surface of a torus when dropped at random. For the majority of the evolved phenotypes the evolved genes for a given shape proved to be significantly more robust to point mutation than those sampled at random for that same shape. A few evolved genotypes, however, were not significantly more robust than those sampled at random and in some cases were less robust. These observations are placed in the context of the fitness landscape for the representation.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	C. H. C, M. P. Eastwood, M. Prentiss, Z. Luthey-Schulten, and P. G. Wolynes. Folding funnels: the key to robust protein structure prediction. Journal of Computational Chemistry, 23:138--146, 2002.
	2	Gunter Dueck, New optimization heuristics, Journal of Computational Physics, v.104 n.1, p.86-92, Jan. 1993 [doi>10.1006/jcph.1993.1010]
	3	Frédéric Gruau, Automatic definition of modular neural networks, Adaptive Behavior, v.3 n.2, p.151-183, Fall 1994 [doi>10.1177/105971239400300202]
	4	R. J. Larsen and M. L. Marx. Introduction to mathematical statistics and its applications. Prentice Hall, Engelwood Cliffs, New Jersey, 1981.
	5	J. Schonfeld and D. Ashlock. Comparison of robustness of solutions located by evolutionary computation and other search algorithms. In Proceedings of the 2004 Congress on Evolutionary Computation, volume 1, pages 250--257, Piscataway, New Jersy, 2004. IEEE Press.
	6	D. Taverna and R. A. Goldstein. The distribution of structures in evolving protein populations. Biopolymers, 53:1--8, 2000.
	7	C. O. Wilke, J. L. Wang, C. Ofria, R. E. Lenski, and C. Adami. Evolution of digital organisms survival of the flattest. Nature, 412:331--333, 2001.