<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Adam Klejda</style></author><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author><author><style face="normal" font="default" size="100%">Agnieszka Mensfelt</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Diversification Techniques and Distance Measures in Evolutionary Design of 3D Structures</style></title><secondary-title><style face="normal" font="default" size="100%">Genetic and Evolutionary Computation Conference Companion (GECCO '22)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><publisher><style face="normal" font="default" size="100%">ACM</style></publisher><pub-location><style face="normal" font="default" size="100%">Boston, USA</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Evolutionary algorithms are among the most successful metaheuristics for hard optimization problems. Nonetheless, there is still much room for improvement of their effectiveness, especially in the multimodal problems, where the algorithms are prone to falling into unsatisfactory local optima. One of the solutions to this problem may be to encourage a broader exploration of the solution space. Motivated by this premise, we compare the evolutionary algorithm without niching, with niching, the novelty search, and the two-criteria optimization (NSGA-II) where the criteria of fitness and diversity are not aggregated. We investigate these methods in the context of automated design of three-dimensional structures, which is one of the hardest optimization problems, often characterized by a rugged fitness landscape arising from a complex genotype to phenotype mapping. In the experiments we optimize 3D structures towards two different goals, height and velocity, using two genetic encodings and three distance measures: two phenetic ones and a genetic one. We demonstrate how different distance measures and diversity promotion mechanisms influence the fitness of the obtained solutions.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Komosinski, Maciej</style></author><author><style face="normal" font="default" size="100%">Miazga, Konrad</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Diversity control in evolution of movement</style></title><secondary-title><style face="normal" font="default" size="100%">Artificial Life Conference Proceedings</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><publisher><style face="normal" font="default" size="100%">MIT Press</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this work we investigate how various techniques of diversity control employed during evolution of 3D agents influence the velocity they achieve, and how these techniques influence the diversity of behaviors across multiple independent evolutionary runs. Three evolutionary settings are compared: a standard generational evolutionary process where fitness is velocity, a niching technique, and pure novelty search. Two genetic encodings (lower and higher level) and two environments (land and water) are used in experiments. To diversify behaviors, seven properties of movement introduced earlier are calculated for each individual during evolution. Best individuals obtained from evolution in each setting are compared both in terms of their fitness and the similarity of their movement patterns.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Grzegorz Latosiński</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Development and comparison of genetic representations for evolving 3D structures</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/MSc_Latosinski_GeneticRepresentations.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Poznan University of Technology, Institute of Computing Science</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Piotr Sniegowski</style></author></authors><tertiary-authors><author><style face="normal" font="default" size="100%">Maciej Komosinski</style></author></tertiary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Development of the environment for distributed computing in the Framsticks system</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.framsticks.com/files/common/MSc_Sniegowski_DistributedFramsticks.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Institute of Computing Science, Poznan University of Technology</style></publisher><work-type><style face="normal" font="default" size="100%">masters</style></work-type></record></records></xml>