• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Natural selection, adaptive evolution and diversity in computational ecosystems

Pichler, Peter-Paul January 2009 (has links)
The central goal of this thesis is to provide additional criteria towards implementing open-ended evolution in an artificial system. Methods inspired by biological evolution are frequently applied to generate autonomous agents too complex to design by hand. Despite substantial progress in the area of evolutionary computation, additional efforts are needed to identify a coherent set of requirements for a system capable of exhibiting open-ended evolutionary dynamics. The thesis provides an extensive discussion of existing models and of the major considerations for designing a computational model of evolution by natural selection. Thus, the work in this thesis constitutes a further step towards determining the requirements for such a system and introduces a concrete implementation of an artificial evolution system to evaluate the developed suggestions. The proposed system improves upon existing models with respect to easy interpretability of agent behaviour, high structural freedom, and a low-level sensor and effector model to allow numerous long-term evolutionary gradients. In a series of experiments, the evolutionary dynamics of the system are examined against the set objectives and, where appropriate, compared with existing systems. Typical agent behaviours are introduced to convey a general overview of the system dynamics. These behaviours are related to properties of the respective agent populations and their evolved morphologies. It is shown that an intuitive classification of observed behaviours coincides with a more formal classification based on morphology. The evolutionary dynamics of the system are evaluated and shown to be unbounded according to the classification provided by Bedau and Packard’s measures of evolutionary activity. Further, it is analysed how observed behavioural complexity relates to the complexity of the agent-side mechanisms subserving these behaviours. It is shown that for the concrete definition of complexity applied, the average complexity continually increases for extended periods of evolutionary time. In combination, these two findings show how the observed behaviours are the result of an ongoing and lasting adaptive evolutionary process as opposed to being artifacts of the seeding process. Finally, the effect of variation in the system on the diversity of evolved behaviour is investigated. It is shown that coupling individual survival and reproductive success can restrict the available evolutionary trajectories in more than the trivial sense of removing another dimension, and conversely, decoupling individual survival from reproductive success can increase the number of evolutionary trajectories. The effect of different reproductive mechanisms is contrasted with that of variation in environmental conditions. The diversity of evolved strategies turns out to be sensitive to the reproductive mechanism while being remarkably robust to the variation of environmental conditions. These findings emphasize the importance of being explicit about the abstractions and assumptions underlying an artificial evolution system, particularly if the system is intended to model aspects of biological evolution.
2

Towards the evolution of multicellularity : a computational artificial life approach

Buck, Moritz January 2011 (has links)
Technology, nowadays, has given us huge computational potential, but computer sciences have major problems tapping into this pool of resources. One of the main issues is how to program and design distributed systems. Biology has solved this issue about half a billion years ago, during the Cambrian explosion: the evolution of multicellularity. The evolution of multicellularity allowed cells to differentiate and so divide different tasks to different groups of cells; this combined with evolution gives us a very good example of how massively parallel distributed computational system can function and be “programmed”. However, the evolution of multicellularity is not very well understood, and most traditional methodologies used in evolutionary theory are not apt to address and model the whole transition to multicellularity. In this thesis I develop and argue for new computational artificial life methodologies for the study of the evolution of multicellularity that are able to address the whole transition, give new insights, and complement existing methods. I argue that these methodologies should have three main characteristics: accessible across scientific disciplines, have potentiality for complex behaviour, and be easy to analyse. To design models, which possess those characteristics, I developed a model of genetic regulatory networks (GRNs) that control artificial cells, which I have used in multiple evolutionary experiments. The first experiment was designed to present some of the engineering problems of evolving multicelled systems (applied to graph-colouring), and to perfect my artificial cell model. The two subsequent experiments demonstrate the characteristics listed above: one model based on a genetic algorithm with an explicit two-level fitness function to evolve multicelled cooperative patterning, and one with freely evolving artificial cells that have evolved some multicelled cooperation as evidenced by novel measures, and has the potential to evolve multicellularity. These experiments show how artificial life models of evolution can discover and investigate new hypotheses and behaviours that traditional methods cannot.

Page generated in 0.107 seconds