| 1. |
- Buason, Gunnar, et al.
(författare)
-
Brains, Bodies and Beyond : Competitive Co-Evolution of Robot Controllers, Morphologies and Environments
- 2005
-
Ingår i: Genetic Programming and Evolvable Machines. - : Springer. - 1389-2576 .- 1573-7632. ; 6:1, s. 25-51
-
Tidskriftsartikel (refereegranskat)abstract
- This paper presents a series of simulation experiments that incrementally extend previous work on neural robot controllers in a predator-prey scenario, in particular the work of Floreano and Nolfi, and integrates it with ideas from work on the ‘co-evolution’ of robot morphologies and control systems. The aim of these experiments has been to further systematically investigate the tradeoffs and interdependencies between morphological parameters and behavioral strategies through a series of predator-prey experiments in which increasingly many aspects are subject to self-organization through competitive co-evolution. Motivated by the fact that, despite the emphasis of the interdependence of brain, body and environment in much recent research, the environment has actually received relatively little attention, the last set of experiments lets robots/species actively adapt their environments to their own needs, rather than just adapting themselves to a given environment.
|
|
| 2. |
- Harrand, Nicolas, et al.
(författare)
-
A journey among Java neutral program variants
- 2019
-
Ingår i: Genetic Programming and Evolvable Machines. - : Springer. - 1389-2576 .- 1573-7632. ; 20:4, s. 531-580
-
Tidskriftsartikel (refereegranskat)abstract
- Neutral program variants are alternative implementations of a program, yet equivalent with respect to the test suite. Techniques such as approximate computing or genetic improvement share the intuition that potential for enhancements lies in these acceptable behavioral differences (e.g., enhanced performance or reliability). Yet, the automatic synthesis of neutral program variants, through program transformations remains a key challenge. This work aims at characterizing plastic code regions in Java programs, i.e., the code regions that are modifiable while maintaining functional correctness, according to a test suite. Our empirical study relies on automatic variations of 6 real-world Java programs. First, we transform these programs with three state-of-the-art program transformations: add, replace and delete statements. We get a pool of 23,445 neutral variants, from which we gather the following novel insights: developers naturally write code that supports fine-grain behavioral changes; statement deletion is a surprisingly effective program transformation; high-level design decisions, such as the choice of a data structure, are natural points that can evolve while keeping functionality. Second, we design 3 novel program transformations, targeted at specific plastic regions. New experiments reveal that respectively 60%, 58% and 73% of the synthesized variants (175,688 in total) are neutral and exhibit execution traces that are different from the original.
|
|
| 3. |
- Lundh, Torbjörn, 1965
(författare)
-
Book Review of: Cellular Automaton Modeling of Biological Pattern Formation
- 2007
-
Ingår i: Genet Program Evolvable Mach. - : Springer Science and Business Media LLC. ; 8, s. 105-106
-
Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)abstract
- Review of Andreas Deutsch och Sabine Dormann's book Cellular Automaton Modeling of Biological Pattern Formation: Characterization, Applications, and Analysis
|
|
| 4. |
- Togelius, Julian, et al.
(författare)
-
Controllable procedural map generation via multiobjective evolution
- 2013
-
Ingår i: Genetic Programming and Evolvable Machines. - : Springer Science and Business Media LLC. - 1389-2576 .- 1573-7632. ; 14:2, s. 245-277
-
Tidskriftsartikel (refereegranskat)abstract
- This paper shows how multiobjective evolutionary algorithms can be used to procedurally generate complete and playable maps for real-time strategy (RTS) games. We devise heuristic objective functions that measure properties of maps that impact important aspects of gameplay experience. To show the generality of our approach, we design two different evolvable map representations, one for an imaginary generic strategy game based on heightmaps, and one for the classic RTS game StarCraft. The effect of combining tuples or triples of the objective functions are investigated in systematic experiments, in particular which of the objectives are partially conflicting. A selection of generated maps are visually evaluated by a population of skilled StarCraft players, confirming that most of our objectives correspond to perceived gameplay qualities. Our method could be used to completely automate in-game controlled map generation, enabling player-adaptive games, or as a design support tool for human designers.
|
|
| 5. |
- Varela, Daniel, et al.
(författare)
-
Evolving cellular automata schemes for protein folding modeling using the Rosetta atomic representation
- 2022
-
Ingår i: Genetic Programming and Evolvable Machines. - : Springer Science and Business Media LLC. - 1389-2576 .- 1573-7632. ; 23:2, s. 225-252
-
Tidskriftsartikel (refereegranskat)abstract
- Protein folding is the dynamic process by which a protein folds into its final native structure. This is different to the traditional problem of the prediction of the final protein structure, since it requires a modeling of how protein components interact over time to obtain the final folded structure. In this study we test whether a model of the folding process can be obtained exclusively through machine learning. To this end, protein folding is considered as an emergent process and the cellular automata tool is used to model the folding process. A neural cellular automaton is defined, using a connectionist model that acts as a cellular automaton through the protein chain to define the dynamic folding. Differential evolution is used to automatically obtain the optimized neural cellular automata that provide protein folding. We tested the methods with the Rosetta coarse-grained atomic model of protein representation, using different proteins to analyze the modeling of folding and the structure refinement that the modeling can provide, showing the potential advantages that such methods offer, but also difficulties that arise.
|
|
| 6. |
- Troedsson, Niklas, et al.
(författare)
-
Full oscillation cycle phase noise analysis of differential CMOS LC oscillators
- 2006
-
Ingår i: Analog Integrated Circuits and Signal Processing. - : Springer Science and Business Media LLC. - 0925-1030 .- 1573-1979. ; 48:3, s. 211-222
-
Tidskriftsartikel (refereegranskat)abstract
- This paper analyzes the phase noise of the widely used differential LC oscillator topology and presents brief equations describing phase noise over the entire oscillation period. The findings show that if a capacitance is present at the source node of the differential pair, two phenomena occur that increase the phase noise: the switch time increases, lengthening the interval spent in a noisy balanced state and increasing the transistor noise excess factor; and at higher frequencies the unbalanced state starts to contribute phase noise. The analysis is based upon the superposition of piecewise linear equations using the EKV transistor model, which includes a concise formulation of the noise excess factor.
|
|
