Neutral networks in an evolutionary robotics search space

43Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent work has argued for the importance of non-adaptive neutral evolution in optimisation over difficult search landscapes. In this paper we show that the search process underlying a difficult evolutionary robotics problem does indeed show phases of neutral evolution. The noise in evaluated fitness of a single genotype is shown to be able to account for the variance in fitness across a long period of the evolutionary run. We further show that the population moves significantly in genotype space during this neutral phase, possibly increasing in divergence. Finally, we investigate the probabilities of mutating to a higher fitness, above the neutral plateau, and find no evidence for a significant upward trend in these probabilities before the crucial mutations actually occurred.

Cite

CITATION STYLE

APA

Smith, T., Husbands, P., & O’Shea, M. (2001). Neutral networks in an evolutionary robotics search space. In Proceedings of the IEEE Conference on Evolutionary Computation, ICEC (Vol. 1, pp. 136–143). https://doi.org/10.1109/cec.2001.934382

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free