%0 Conference Paper %B Genetic and Evolutionary Computation Conference Companion (GECCO '22) %D 2022 %T Diversification Techniques and Distance Measures in Evolutionary Design of 3D Structures %A Adam Klejda %A Maciej Komosinski %A Agnieszka Mensfelt %X 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. %B Genetic and Evolutionary Computation Conference Companion (GECCO '22) %I ACM %C Boston, USA %G eng %R 10.1145/3520304.3528948 %0 Conference Paper %B Genetic and Evolutionary Computation Conference Companion (GECCO '22) %D 2022 %T Fitness Diversification in the Service of Fitness Optimization: a Comparison Study %A Kamil Basiukajc %A Maciej Komosinski %A Konrad Miazga %X Blindly chasing after fitness is not the best strategy for optimization of hard problems, as it usually leads to premature convergence and getting stuck in low-quality local optima. Several techniques such as niching or quality-diversity algorithms have been established that aim to alleviate the selective pressure present in evolutionary algorithms and to allow for greater exploration. Yet another group of methods which can be used for that purpose are fitness diversity methods. In this work we compare the standard single-population evolution against three fitness diversity methods: fitness uniform selection scheme (FUSS), fitness uniform deletion scheme (FUDS), and convection selection (ConvSel). We compare these methods on both mathematical and evolutionary design benchmarks over multiple parametrizations. We find that given the same computation time, fitness diversity methods regularly surpass the performance of the standard single-population evolutionary algorithm. %B Genetic and Evolutionary Computation Conference Companion (GECCO '22) %I ACM %C Boston, USA %G eng %U http://www.framsticks.com/files/common/FitnessDiversity.pdf %R 10.1145/3520304.3528949 %0 Conference Paper %B 2021 IEEE Congress on Evolutionary Computation (CEC) %D 2021 %T Automated development of latent representations for optimization of sequences using autoencoders %A Kaszuba, Piotr %A Komosinski, Maciej %A Mensfelt, Agnieszka %X In this paper, we propose an automated method for the development of new representations of sequences. For this purpose, we introduce a two-way mapping from variable length sequence representations to a latent representation modelled as the bottleneck of an LSTM (long short-term memory) autoencoder. Desirable properties of such mappings include smooth fitness landscapes for optimization problems and better evolvability. This work explores the capabilities of such latent encodings in the context of optimization of 3D structures. Various improvements are adopted that include manipulating the autoencoder architecture and its training procedure. The results of evolutionary algorithms that use different variants of automatically developed encodings are compared. %B 2021 IEEE Congress on Evolutionary Computation (CEC) %I IEEE %G eng %U http://www.framsticks.com/files/common/LatentRepresentationsForSequencesOptimization.pdf %R 10.1109/CEC45853.2021.9504910 %0 Conference Paper %B Artificial Life Conference Proceedings %D 2021 %T Diversity control in evolution of movement %A Komosinski, Maciej %A Miazga, Konrad %X 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. %B Artificial Life Conference Proceedings %I MIT Press %G eng %R 10.1162/isal_a_00456 %0 Report %D 2021 %T Type A and Type B Effects, Time-Order Error and Weber's Law in Human Timing – Simulations and Synthesis %A Komosinski, Maciej %A Kups, Adam %X This article presents a computational approach to the theoretical integration of the psychophysical phenomena in human timing. While there are many useful models of human timing, analyses are scarce on how these models explain the relationships between several phenomena at the same time. The presented research is an attempt to primarily explain and integrate the time-order error with the Type A and Type B phenomena. The final result of this work also encompasses Weber's law property and relates it to the aforementioned order-related effects. The theoretical framework used is the Clock-Counter Timing Network (CCTN), an artificial neural network timing model which has been constructed to explain the process of comparing durations of stimuli. Extensive simulations performed with the use of this model revealed that the considered psychophysical properties may be strongly interrelated and dependent on a simple perceptual mechanism. The obtained results allow to formulate specific experimentally testable predictions. %I Poznan University of Technology, Institute of Computing Science %G eng %U http://www.framsticks.com/files/common/HumanTimingSimulation-TypeA-TypeB-TOE-WebersLaw.pdf %0 Report %D 2020 %T Human perception of similarity of 3D graph structures %A Maciej Komosinski %A Agnieszka Mensfelt %X This report describes the study of how humans perceive similarity of simple three-dimensional graph structures. Participants of this study were required to align pairs of 3D structures the best they could, then match all vertices of these structures, evaluate their perceived similarity on a numerical scale, and justify their decisions as a textual response. The outcomes of this process were analyzed and compared to the outcomes of a heuristic computer algorithm that maximized the alignment of pairs of 3D structures and matched their vertices. The influence of personal characteristics of participants such as their gender, age, handedness, education, but also time required to complete each task, on the quality of the matching of vertices was evaluated. The consistency of human responses was also verified. The participants turned out to be more consistent (both between themselves and with the algorithm) in the degree of similarity estimated than in matching of vertices. Personal characteristics of the subjects did not have an influence on their similarity assessments. %G eng %0 Journal Article %J Foundations of Computing and Decision Sciences %D 2020 %T Morality, protection, security and gain: lessons from a minimalistic, economically inspired multi-agent model %A Maciej Komosinski %A Tomasz Żok %X In this work, we introduce a simple multi-agent simulation model with two roles of agents that correspond to moral and immoral attitudes. The model is given explicitly by a set of mathematical equations with continuous variables and is characterized by four parameters: morality, protection, and two efficiency parameters. Agents are free to adjust their roles to maximize individual gains. The model is analyzed theoretically to find conditions for its stability, i.e., the fractions of agents of both roles that lead to an equilibrium in their gains. A multi-agent simulation is also developed to verify the dynamics of the model for all values of morality and protection parameters, and to identify potential discrepancies with the theoretical analysis. %B Foundations of Computing and Decision Sciences %V 45 %P 17–33 %G eng %R 10.2478/fcds-2020-0002 %0 Generic %D 2019 %T Człowieczeństw0 %A Maciej Komosinski %G eng %U http://www.mooncoder.com/czlowieczenstw0 %0 Conference Paper %B Applications of Evolutionary Computation %D 2019 %T A Flexible Dissimilarity Measure for Active and Passive 3D Structures and Its Application in the Fitness–Distance Analysis %A Komosinski, Maciej %A Mensfelt, Agnieszka %E Kaufmann, Paul %E Castillo, Pedro A. %X Evolutionary design of 3D structures – either static structures, or equipped with some sort of a control system – is one of the hardest optimization tasks. One of the reasons are rugged fitness landscapes resulting from complex and non-obvious genetic representations of such structures and their genetic operators. This paper investigates global convexity of fitness landscapes in optimization tasks of maximizing velocity and height of both active and passive structures. For this purpose, a new dissimilarity measure for 3D active and passive structures represented as undirected graphs is introduced. The proposed measure is general and flexible – any vertex properties can be easily incorporated as dissimilarity components. The new measure was compared against the previously introduced measure in terms of triangle inequality satisfiability, changes in raw measure values and the computational cost. The comparison revealed improvements for triangle inequality and raw values at the expense of increased computational complexity. The investigation of global convexity of the fitness landscape, involving the fitness–distance correlation analysis, revealed negative correlation between the dissimilarity of the structures and their fitness for most of the investigated cases. %B Applications of Evolutionary Computation %I Springer %@ 978-3-030-16692-2 %G eng %U http://www.framsticks.com/files/common/DissimilarityMeasure3DStructuresFitnessDistance.pdf %R 10.1007/978-3-030-16692-2_8 %0 Generic %D 2019 %T Humann3ss %A Maciej Komosinski %G eng %U http://www.mooncoder.com/humann3ss %0 Journal Article %J Foundations of Computing and Decision Sciences %D 2019 %T Mappism: formalizing classical and artificial life views on mind and consciousness %A Iwo Błądek %A Maciej Komosinski %A Konrad Miazga %B Foundations of Computing and Decision Sciences %V 44 %P 55–99 %G eng %U http://www.framsticks.com/files/common/MappismConsciousness.pdf %N 1 %R 10.2478/fcds-2019-0005 %0 Book Section %B Artificial Life Conference Proceedings %D 2019 %T Measuring properties of movement in populations of evolved 3D agents %A Maciej Komosinski %A Konrad Miazga %E Harold Fellermann %E Jaume Bacardit %E Angel Goni-Moreno %E Rudolf M. Füchslin %B Artificial Life Conference Proceedings %I MIT Press %P 485–492 %G eng %R 10.1162/isal_a_00208 %0 Conference Proceedings %B Genetic and Evolutionary Computation Conference (GECCO '19), July 13–17 %D 2019 %T Parametrizing Convection Selection: Conclusions from the Analysis of Performance in the NKq Model %A Maciej Komosinski %A Konrad Miazga %X Convection selection in evolutionary algorithms is a method of splitting the population into subpopulations based on the fitness values of solutions. Convection selection was previously found to be superior to standard selection techniques in difficult tasks of evolutionary design. However, reaching its full potential requires tuning of parameters that affect the performance of the evolutionary search process. Performing experiments on benchmark fitness functions does not provide general knowledge required for such tuning. Therefore, in order to gain an insight into the link between the characteristics of the fitness landscape, the parameters of the selection technique, and the quality of the best found solutions, we perform an analysis based on the NKq model of rugged fitness landscapes with neutrality. As a result, we identify several rules that will help researchers and practitioners of evolutionary algorithms adjust the values of convection selection parameters based on the knowledge of the properties of a given optimization problem. %B Genetic and Evolutionary Computation Conference (GECCO '19), July 13–17 %I ACM %C Prague, Czech Republic %P 804–811 %8 2019 %G eng %U http://www.framsticks.com/files/common/ConvectionSelectionNKqModel.pdf %R 10.1145/3321707.3321864 %0 Report %D 2019 %T Properties of movement of 3D agents %A Krzysztof Gorgolewski %A Maciej Komosinski %A Konrad Miazga %A Krzysztof Rosinski %A Paweł Rychły %I Poznan University of Technology, Institute of Computing Science %G eng %U http://www.framsticks.com/files/common/PropertiesOfMovementOf3DAgents.pdf %0 Journal Article %J Journal of Computational Science %D 2018 %T Comparison of the tournament-based convection selection with the island model in evolutionary algorithms %A Maciej Komosinski %A Konrad Miazga %X Convection selection is an approach to multipopulational evolutionary algorithms where solutions are assigned to subpopulations based on their fitness values. Although it is known that convection selection can allow the algorithm to find better solutions than it would be possible with a standard single population, the convection approach was not yet compared to other, commonly used architectures of multipopulational evolutionary algorithms, such as the island model. In this paper we describe results of experiments which facilitate such a comparison, including extensive multi-parameter analyses. We show that approaches based on convection selection can obtain better results than the island model, especially for difficult optimization problems such as those existing in the area of evolutionary design. We also introduce and test a generalization of the convection selection which allows for adjustable overlapping of fitness ranges of subpopulations; the amount of overlapping influences the exploration vs. exploitation balance. %B Journal of Computational Science %V 32 %P 106–114 %G eng %U http://www.framsticks.com/files/common/ConvectionSelectionVsIslandModel.pdf %R 10.1016/j.jocs.2018.10.001 %0 Journal Article %J PPAM 2017 proceedings, Lecture Notes in Computer Science %D 2018 %T Tournament-based convection selection in evolutionary algorithms %A Maciej Komosinski %A Konrad Miazga %X One of the problems that single-threaded (non-parallel) evolutionary algorithms encounter is premature convergence and the lack of diversity in the population. To counteract this problem and improve the performance of evolutionary algorithms in terms of the quality of optimized solutions, a new subpopulation-based selection scheme - the convection selection - is introduced and analyzed in this work. This new selection scheme is compared against traditional selection of individuals in a single-population evolutionary processes. The experimental results indicate that the use of subpopulations with fitness-based assignment of individuals yields better results than both random assignment and a traditional, non-parallel evolutionary architecture. %B PPAM 2017 proceedings, Lecture Notes in Computer Science %G eng %U http://www.framsticks.com/files/common/TournamentBasedConvectionSelectionEvolutionary.pdf %R 10.1007/978-3-319-78054-2_44 %0 Journal Article %J Foundations of Computing and Decision Sciences %D 2018 %T Universes and simulations: civilizational development in nested embedding %A Maciej Komosinski %X The rapid development of technology has allowed computer simulations to become routinely used in an increasing number of fields of science. These simulations become more and more realistic, and their energetic efficiency grows due to progress in computer hardware and software. As humans merge with machines via implants, brain-computer interfaces and increased activity involving information instead of material objects, philosophical concepts and theoretical considerations on the nature of reality are beginning to concern practical, working models and testable virtual environments. This article discusses how simulation is understood and employed in computer science today, how software, hardware and the physical universe unify, how simulated realities are embedded one in another, how complicated it can get in application, practical scenarios, and the possible consequences of these situations. A number of basic properties of universes and simulations in such multiply nested structures are reviewed, and the relationship of these properties with a level of civilizational development is explored. %B Foundations of Computing and Decision Sciences %V 43 %P 181–205 %G eng %U http://www.framsticks.com/files/common/DevelopmentNestedUniverses.pdf %N 3 %R 10.1515/fcds-2018-0010 %0 Journal Article %J Journal of Computational Science %D 2017 %T Applications of a similarity measure in the analysis of populations of 3D agents %A Maciej Komosinski %X Research in complex collective and multi-agent systems often involves building models of three-dimensional biological life or evolving such structures in virtual environments. Applications stemming from evolutionary design, engineering, robotics, and artificial life require processing of large numbers of such agents that are encoded in some form of a "genotype". However, what is important in evaluation is the "phenotype", i.e. the actual 3D body and its properties. This work introduces a number of ways in which a measure of similarity of 3D agents can support researchers in recognizing the link between the genotype and phenotype spaces, building taxonomies of 3D bodies and automatically selecting representative agents. The measure of similarity employed here is based on phenotypes and places few restrictions on the compared designs, so it can be applied independently of genetic representation. %B Journal of Computational Science %V 21 %P 407–418 %U http://www.framsticks.com/files/common/SimilarityPopulations3DAgents.pdf %R 10.1016/j.jocs.2016.10.004 %0 Journal Article %J ACM Transactions on Computational Logic %D 2017 %T Automated Generation of Erotetic Search Scenarios: Classification, Optimization, and Knowledge Extraction %A Chlebowski, Szymon %A Maciej Komosinski %A Adam Kups %K knowledge extraction %K Logic of questions %K multicriteria analysis %K optimal erotetic scenario %K rule mining %X This paper concerns automated generation and processing of erotetic search scenarios (ESSs). ESSs are formal constructs characterized in Inferential Erotetic Logic that enable finding possible answers to a posed question by decomposing it into auxiliary questions. The first part of this work describes a formal account on ESSs. The formal approach is then applied to automatically generate ESSs, and the resulting scenarios are evaluated according to a number of criteria. These criteria are subjected to discordance analysis that reveals their mutual relationships. Finally, knowledge concerning relationships between different values of evaluation criteria is extracted by applying Apriori - an association rules mining algorithm. The proposed approach of integration of formal erotetic logic with computational tools provides an extensive insight into the former and helps with the development of efficient ESSs. %B ACM Transactions on Computational Logic %I ACM %C New York %V 18 %P 8:1–8:27 %U http://www.cs.put.poznan.pl/mkomosinski/research/automated-erotetic-search-scenarios.pdf %N 2 %R 10.1145/3056537 %0 Report %D 2017 %T Evolutionary construction of derivations in classical propositional logic using a symbolic-connectionist representation %A Maciej Komosinski %A Adam Kups %X This report introduces a way derivations in classical propositional logic can be constructed using evolutionary algorithms. The derivations are represented by connectionist systems. There are three kinds of nodes constituting these systems: formula nodes that generate signal in the form of strings of symbols, "modus ponens" nodes that transform incoming signal according to the "modus ponens" rule, and substitution nodes that transform incoming signal by applying the substitution rule. This work presents initial research on an approach that is a part of our quest for efficient construction of derivations using various logics and constrained in various ways. The final part of this report outlines limitations encountered in our initial experiments and the ways the proposed approach can be improved. %I Poznan University of Technology, Institute of Computing Science %U http://www.framsticks.com/files/common/EvolutionOfDerivationsInLogic.pdf %9 Research report %0 Journal Article %J Journal of Computational Science %D 2017 %T Modelling ecology and evolution of Foraminifera in the agent-oriented distributed platform %A Paweł Topa %A Łukasz Faber %A Jarosław Tyszka %A Maciej Komosinski %X We present a new software platform called eVolutus for simulating evolution of living organisms. We choose Foraminifera as model organisms that represent a group of single-cellular, mainly marine, organisms that construct well fossilisable protective shells. They have lived on Earth for more than 540 million years and have left an extraordinary fossil record that is excellent for testing palaeoecological and evolutionary hypotheses. We use the AgE platform, which is a lightweight agent-oriented platform supporting distributed computation. The paper presents the general architecture of this modelling environment as well as more detailed descriptions of the implemented rules and applied solutions. The utility of this software is demonstrated by presenting the configuration and results of sample experiments. %B Journal of Computational Science %V 18 %P 69–84 %U https://doi.org/10.1016/j.jocs.2016.07.009 %R 10.1016/j.jocs.2016.07.009 %0 Journal Article %J Journal of Computational Science %D 2017 %T Multi-agent simulation of benthic foraminifera response to annual variability of feeding fluxes %A Maciej Komosinski %A Agnieszka Mensfelt %A Jarosław Tyszka %A Jan Goleń %X In this work we describe a novel simulation model of foraminifera and their microhabitat. The simulations reported here are focused on the response of foraminiferal populations to environmental feeding fluxes. The experiments allowed to calibrate the model and to simulate realistic population patterns known from culture experiments, as well as from oceanographic and paleoecologic studies. Variability of annual food flux has a direct impact on productivity of foraminifera: population sizes closely follow the intensity of constant and seasonal food fluxes in both scenarios. This correlation between the food influx and population size is interpreted as the consequence of changing the carrying capacity of the system. Seasonal pulses of particulate organic matter enhance the population size which is represented by a higher number of fossilized shells. Our model offers a flexible experimental design to run sophisticated in silico experiments. This approach reveals a novel methodology for testing sensitivity of fossil and recent foraminiferal assemblages to environmental changes. Furthermore, it facilitates predictive applications for monitoring studies based on simulation of various scenarios. %B Journal of Computational Science %V 21 %P 419–431 %U http://www.framsticks.com/files/common/SimulationForaminiferaFeedingFluxes.pdf %R 10.1016/j.jocs.2016.09.009 %0 Journal Article %J The Journal of Supercomputing %D 2017 %T Multithreaded computing in evolutionary design and in artificial life simulations %A Maciej Komosinski %A Szymon Ulatowski %X This article investigates low-level and high-level multithreaded performance of evolutionary processes that are typically employed in evolutionary design and artificial life. Computations performed in these areas are specific because evaluation of each genotype usually involves time-consuming simulation of virtual environments and physics. Computational experiments have been conducted using the Framsticks simulator running a multithreaded version of a standard evolutionary experiment. Tests carried out on five diverse machines and two operating systems demonstrated how low-level performance depends on the number of physical and logical CPU cores and on the number of threads. Two string implementations have been compared, and their raw performance turned out to fundamentally differ in a multithreading setup. To improve high-level performance of parallel evolutionary algorithms, i.e. the quality of optimized solutions, a new distribution scheme that is especially useful and efficient for complex representations of solutions – the convection distribution – has been introduced. This new distribution scheme has been compared against a random distribution of genotypes among threads that carry out evolutionary processes. %B The Journal of Supercomputing %V 73 %P 2214–2228 %U http://www.framsticks.com/files/common/MultithreadedEvolutionaryDesign.pdf %N 5 %R 10.1007/s11227-016-1923-4 %0 Book Section %B Man–Machine Interactions 4 %D 2016 %T Application of a morphological similarity measure to the analysis of shell morphogenesis in Foraminifera %A Maciej Komosinski %A Agnieszka Mensfelt %A Paweł Topa %A Jarosław Tyszka %E Gruca, Aleksandra %E Brachman, Agnieszka %E Kozielski, Stanisław %E Czachórski, Tadeusz %X This work evaluates the genotype-to-phenotype mapping defined by one of the models of growth of foraminifera. Foraminifera are simple unicellular organisms with very diverse morphologies. To analyze the mapping, a morphological similarity measure is needed that compares 3D structures. One of the key components of the similarity estimation algorithm is Singular Value Decomposition (SVD). Since this algorithm is heavily used and its performance is important, four SVD implementations have been compared in this work. Distance matrices of the phenotypes obtained for equally distant genotypes were computed using the similarity measure. For the visualization of the phenotype space, multidimensional scaling techniques were used. Visual comparison of the genotype and the phenotype spaces revealed characteristics and potential weaknesses of the analyzed model of foraminifera growth, and demonstrated usefulness of the proposed approach. %B Man–Machine Interactions 4 %S Advances in Intelligent Systems and Computing %I Springer %V 391 %P 215–224 %@ 978-3-319-23436-6 %U http://www.framsticks.com/files/common/ForaminiferaGenotypePhenotypeMapping.pdf %R 10.1007/978-3-319-23437-3_18 %0 Journal Article %J Music Perception %D 2016 %T Emotions perceived and emotions experienced in response to computer-generated music %A Maciej Komosinski %A Agnieszka Mensfelt %X This paper explores perceived and experienced emotions elicited by computer-generated music. During the experiments, 30 participants listened to 20 excerpts. Each of the excerpts lasted for about 16 seconds and was generated in real-time by specifically designed software. Measurements were performed using both categorical (a free verbal description) and dimensional approaches. The relationship between structural factors of music (mode, tempo, pitch height, rhythm, articulation and presence of the dissonance) and emotions was examined. Personal characteristics of the listener: gender and musical training were also taken into account. The relationship between structural factors and the perceived emotions was mostly congruent with predictions derived from the literature, and the relationship between those factors and experienced emotions was very similar. Tempo and pitch height – the cues common to music and speech – turned out to have a strong influence on the evaluation of emotion. Personal factors had a marginal effect. In the case of verbal categories comparable with the dimensional model, a strong correspondence was found. %B Music Perception %I UC Press %V 33 %P 432–445 %8 April %U https://www.cs.put.poznan.pl/mkomosinski/research/music-emotions-perceived-and-experienced.pdf %N 4 %R 10.1525/MP.2016.33.4.432 %0 Book Section %B Man–Machine Interactions 4 %D 2016 %T eVolutus: a configurable platform designed for ecological and evolutionary experiments tested on Foraminifera %A Paweł Topa %A Maciej Komosinski %A Maciej Bassara %A Jarosław Tyszka %E Gruca, Aleksandra %E Brachman, Agnieszka %E Kozielski, Stanisław %E Czachórski, Tadeusz %B Man–Machine Interactions 4 %S Advances in Intelligent Systems and Computing %I Springer %V 391 %P 269–278 %@ 978-3-319-23436-6 %G eng %U http://dx.doi.org/10.1007/978-3-319-23437-3_23 %R 10.1007/978-3-319-23437-3_23 %0 Book Section %B Parallel Processing and Applied Mathematics: 11th International Conference, PPAM 2015, Krakow, Poland, September 6–9, 2015. Revised Selected Papers, Part II %D 2016 %T eVolutus: A New Platform for Evolutionary Experiments %A Topa, Paweł %A Komosinski, Maciej %A Tyszka, Jarosław %A Mensfelt, Agnieszka %A Rokitta, Sebastian %A Byrski, Aleksander %A Bassara, Maciej %E Wyrzykowski, Roman %E Deelman, Ewa %E Dongarra, Jack %E Karczewski, Konrad %E Kitowski, Jacek %E Wiatr, Kazimierz %B Parallel Processing and Applied Mathematics: 11th International Conference, PPAM 2015, Krakow, Poland, September 6–9, 2015. Revised Selected Papers, Part II %I Springer %P 570–580 %@ 978-3-319-32152-3 %G eng %U http://dx.doi.org/10.1007/978-3-319-32152-3_53 %R 10.1007/978-3-319-32152-3_53 %0 Generic %D 2016 %T Nesting %A Maciej Komosinski %G eng %U http://www.framsticks.com/nesting %0 Generic %D 2016 %T Zagnieżdżenie %A Maciej Komosinski %G eng %U http://www.framsticks.com/zagniezdzenie %0 Journal Article %J Journal of Mathematics and Music %D 2015 %T Automatic species counterpoint composition by means of the dominance relation %A Maciej Komosinski %A Piotr Szachewicz %B Journal of Mathematics and Music %V 9 %P 75-94 %U http://www.cs.put.poznan.pl/mkomosinski/research/counterpoint-composition-dominance-relation.pdf %N 1 %R 10.1080/17459737.2014.935816 %0 Report %D 2015 %T Mobile health: assessment of upper limb motor function via a drawing test on a mobile device %A Maciej Komosinski %X This paper describes and compares experiences with two generations of devices that can acquire pen movement data from a drawing test. The first part of this work summarizes methods introduced earlier that analyze data acquired using a graphics tablet from healthy subjects and people with Parkinson's disease before and after surgery. These methods can discriminate groups of patients and can assess improvements after surgery. The second part of this work presents the implementation of analogous methods that estimate hand tremor and drawing smoothness on a commercially available mobile tablet. Both approaches and applications are compared, and differences in goals and in characteristics of these devices are enumerated. %I Poznan University of Technology, Institute of Computing Science %U http://www.cs.put.poznan.pl/mkomosinski/research/parkinson-mobile-evaluation-app.pdf %9 Research report %0 Journal Article %J Computational Cognitive Science %D 2015 %T Time-order error and scalar variance in a computational model of human timing: simulations and predictions %A Maciej Komosinski %A Adam Kups %X This work introduces a computational model of human temporal discrimination mechanism - the Clock-Counter Timing Network. It is an artificial neural network implementation of a timing mechanism based on the informational architecture of the popular Scalar Timing Model. The model has been simulated in a virtual environment enabling computational experiments which imitate a temporal discrimination task - the two-alternative forced choice task. The influence of key parameters of the model (including the internal pacemaker speed and the variability of memory translation) on the network accuracy and the time-order error phenomenon has been evaluated. The results of simulations reveal how activities of different modules contribute to the overall performance of the model. These results can be compared and verified in empirical experiments with human participants, especially when the modes of activity of the internal timing mechanism are changed because of some external conditions, or are impaired due to some kind of a neural degradation process. %B Computational Cognitive Science %I Springer %V 1 %P 1–24 %U http://dx.doi.org/10.1186/s40469-015-0002-0 %N 1 %R 10.1186/s40469-015-0002-0 %0 Journal Article %J ACM Transactions on Computational Logic %D 2014 %T Identifying efficient abductive hypotheses using multi-criteria dominance relation %A Maciej Komosinski %A Adam Kups %A Dorota Leszczyńska-Jasion %A Mariusz Urbański %X In this article, results of the automation of an abductive procedure are reported. This work is a continuation of our earlier research, where a general scheme of the procedure has been proposed. Here, a more advanced system developed to generate and evaluate abductive hypotheses is introduced. Abductive hypotheses have been generated by the implementation of the Synthetic Tableau Method. Before the evaluation, the set of hypotheses has undergone several reduction phases. To assess usefulness of abductive hypotheses in the reduced set, several criteria have been employed. The evaluation of efficiency of the hypotheses has been provided by the multi-criteria dominance relation. To comprehend the abductive procedure and the evaluation process more extensively, analyses have been conducted on a number of artificially generated abductive problems. %B ACM Transactions on Computational Logic %I Association for Computing Machinery %C New York, NY, USA %V 15 %P 28:1–28:20 %U http://www.framsticks.com/files/common/IdentifyingEfficientAbductiveHypotheses.pdf %N 4 %R 10.1145/2629669 %0 Report %D 2013 %T Parallel computing in Framsticks %A Maciej Komosinski %A Szymon Ulatowski %X This report demonstrates how parallel computation can be implemented in the Framsticks environment. A number of possible multithreaded and distributed architectures and configurations is shown. The main part of this report discusses and explains two experiment definitions (prime-mt and standard-mt) that exploit multithreading. These experiment definitions are included in the official Framsticks distribution. The first one serves as a minimal example of how parallelization can be implemented in Framsticks. The second one is more complex: it shows how to deal with Slave experiments that do not have an internal stop condition, how to migrate the evolved genotypes between Slaves, and how to use Slave checkpoint events to monitor the progress of evolution. %I Poznan University of Technology, Institute of Computing Science %U http://www.framsticks.com/files/common/ParallelComputingFramsticks.pdf %0 Journal Article %J Anestezjologia i Ratownictwo %D 2013 %T Postrzeganie czasu przez człowieka: specyfika, modele i symulacje %A Maciej Komosinski %A Adam Kups %K błąd porządku czasowego %K postrzeganie upływu czasu %K sieć neuronowa %K symulacja %K TOE %X Niniejszy artykuł poświęcony jest zagadnieniu postrzegania czasu trwania zdarzeń (ang. timing) przez człowieka. Zarysowano w nim bieżący stan wiedzy zwracając uwagę na niedostatek modeli obejmujących szeroki zakres dziedzin, w których prowadzi się badania postrzegania czasu. Przedstawiono przykładową implementację popularnego modelu typu zegar-licznik w środowisku sztucznych sieci neuronowych. Opisano zjawisko "błędu porządku czasowego" oraz pokazano, jak zaproponowana sztuczna sieć neuronowa może naśladować zachowanie człowieka popełniając podobne błędy w zależności od parametrów opisujących działanie jej elementów składowych. Artykuł omawia też rolę technik symulacyjnych oraz metod sztucznej inteligencji i sztucznego życia w budowaniu działających i weryfikowalnych modeli niepoznanych jeszcze procesów i zjawisk biologicznych, których przykładem jest postrzeganie czasu. %B Anestezjologia i Ratownictwo %I Akademia Medycyny %V 7 %P 113–124 %U http://www.akademiamedycyny.pl/wp-content/uploads/2016/05/201301_AiR_013.pdf %0 Report %D 2012 %T Evolutionary design of tall structures %A Maciej Komosinski %I Poznan University of Technology, Institute of Computing Science %G eng %U http://www.framsticks.com/files/common/EvolutionaryDesignOfTallStructures.pdf %0 Journal Article %J Theory in Biosciences %D 2012 %T Measuring quantities using oscillators and pulse generators %A Maciej Komosinski %X This article presents properties of the clock–counter model with a periodic generator employed as the source of regularly emitted pulses. The pacemaker and accumulator mechanisms are often considered in research in neurobiology and cognitive science: neurons or their groups serve as oscillators, and the number of spikes emitted while a stimulus lasts becomes an estimate of the length of the stimulus. The article integrates three approaches: a theoretical model to present the general concept, a working implementation of this model to perform intensive simulation experiments, and the analytical description of the behavior of the model. Oscillators that exhibit some degree of regularity have been compared to the Poisson ones, and the corresponding probability distributions have been presented that describe the number of pulses accumulated over time. Several continuous and discrete interpulse distributions have been investigated, and the influence of generator parameters on the possible outcomes of the measurement have been described. Particular attention has been paid to the relationship between measurement variability and the mean number of pulses observed. Issues concerning practical realizations of periodic generators: discrete time, dependence of the generator start time on the stimulus, and relation to Weber’s law have been discussed as well. %B Theory in Biosciences %I Springer Berlin / Heidelberg %V 131 %P 103–116 %U http://dx.doi.org/10.1007/s12064-012-0153-4 %R 10.1007/s12064-012-0153-4 %0 Conference Paper %B Proceedings of the 18th International Conference on Soft Computing %D 2012 %T Multi-criteria evaluation of abductive hypotheses: towards efficient optimization in proof theory %A Maciej Komosinski %A Adam Kups %A Mariusz Urbanski %X Research described in this paper aims at implementation of an abductive procedure based on the Synthetic Tableaux Method. This problem concerns a two-stage process of generation and evaluation of abductive hypotheses. While generation of the abductive hypotheses is achieved here by the implementation of the rules provided with a logical apparatus, their evaluation is performed using traditional measures and optimization techniques such as Pareto optimality and fitness–distance analysis. By combining tools known in proof theory and in Artificial Intelligence, we explore the intriguing problem of interpretative reasoning. %B Proceedings of the 18th International Conference on Soft Computing %C Brno, Czech Republic %P 320–325 %0 Journal Article %J Bio-Algorithms and Med-Systems %D 2011 %T Implementation and Simulation of the Scalar Timing Model %A Maciej Komosinski %A Adam Kups %B Bio-Algorithms and Med-Systems %V 7 %P 41–52 %G eng %U https://bit.wl.cm.uj.edu.pl/cm/uploads/2021/02/bams7_4.pdf %N 4 %0 Journal Article %J Complexity %D 2011 %T Quantitative measure of structural and geometric similarity of 3D morphologies %A Maciej Komosinski %A Marek Kubiak %X This work describes a new heuristic algorithm that estimates structural and geometric similarity of three-dimensional morphologies. It is an extension to previously developed measure of similarity (Komosinski et al., 2001) that was only able to consider the structure of 3D constructs. Morphologies are modeled as graphs with vertices as points in a 3D space, and edges connecting these vertices. This model is very general, therefore the proposed algorithm can be applied in (and across) a number of disciplines including artificial life, evolutionary design, engineering, robotics, biology and chemistry. The primary areas of application of this fast numerical similarity measure are artificial life and evolutionary design, where great numbers of morphologies result from simulated evolutionary processes, and both structural and geometric aspects are significant. Geometry of 3D constructs (i.e., locations of body parts in space) is as important as the structure (i.e., connections of body parts), because both determine behavior of creatures or designs and their fitness in a particular environment. In this work both morphological aspects are incorporated in a single, highly discriminative measure of similarity. %B Complexity %I Wiley %V 16 %P 40–52 %U http://www.framsticks.com/files/common/Komosinski_Kubiak_MeasureSimilarity3DMorphologies.pdf %R 10.1002/cplx.20367 %0 Journal Article %J Nauka %D 2011 %T Życie w komputerze: symulacja czy rzeczywistość? %A Maciej Komosinski %X Niniejszy artykuł przedstawia dwa podejścia do wykorzystania komputerów jako środowiska, w którym mogą przebiegać procesy życiowe. W pierwszym z nich komputer służy do symulacji modeli życia ziemskiego - zarówno tych dokładnych, umożliwiających lepsze poznanie określonych zjawisk, jak i modeli uproszczonych (takich jak sztuczne sieci neuronowe czy algorytmy ewolucyjne), interesujących z pragmatycznego punktu widzenia. Drugie z opisywanych podejść polega na stworzeniu w komputerze środowiska, które umożliwiłoby rozwój życia. Artykuł pokazuje przydatność pierwszego z tych podejść oraz wskazuje niektóre problemy, pytania i wątpliwości związane z realizacją drugiego z nich. %B Nauka %I Polska Akademia Nauk %C Warszawa %V 2011 %P 83–93 %U http://www.alife.pl/zycie-w-komputerze-symulacja-czy-rzeczywistosc %N 2 %0 Report %D 2010 %T Estimating similarity of neural network dynamics %A Maciej Komosinski %A Krzysztof Rosinski %X This report concerns estimation of the similarity between neural networks of any topology. Motivations and benefits of having an automated and quantitative network comparison mechanism are presented. The concept of neural network dynamics (neuron output signal) is considered. A measure is proposed for estimating similarity of active (i.e., working) neural networks. Properties of the measure are analyzed theoretically and verified empirically. The experiments have been performed on a set of evolved networks responsible for controlling 3D structures (agents, robots). These experiments demonstrate the capabilities and the limitations of the proposed measure as a mechanism to support humans in analyzing large sets of neural networks. %I Poznan University of Technology, Institute of Computing Science %G eng %U http://www.framsticks.com/files/common/SimilarityNeuralNetworkDynamics.pdf %0 Book %D 2009 %T Artificial Life Models in Hardware %X Hopping, climbing and swimming robots, nano-size neural networks, motorless walkers, slime mould and chemical brains – this book offers unique designs and prototypes of life-like creatures in conventional hardware and hybrid bio-silicon systems. Ideas and implementations of living phenomena in non-living substrates cast a colourful picture of state-of-the-art advances in hardware models of artificial life. Focusing on topics and areas based on non-traditional thinking, and new and emerging paradigms in bio-inspired robotics, this book has a unifying theme: the design and real-world implementation of artificial life robotic devices. Students and researchers will find this coverage of topics such as robotic energy autonomy, multi-locomotion of robots, biologically inspired autonomous robots, evolution in colonies of robotic insects, neuromorphic analog devices, self-configurable robots, and chemical and biological controllers for robots, will considerably enhance their understanding of the issues involved in the development of not-traditional hardware systems at the cusp of artificial life and robotics. %I Springer %G eng %U http://www.springer.com/978-1-84882-529-1 %0 Book %D 2009 %T Artificial Life Models in Software %X Artificial Life Models in Software provides an introduction and guide to modern software tools for modeling and simulating life-like phenomena, written by those who personally design and develop software, hardware, and art installations in artificial life, simulated complex systems and virtual worlds. This timely volume offers a nearly exhaustive overview and original analysis of major non-profit software packages that are actively developed and supported by experts in artificial life and software design. The carefully selected topics include: simulation and evolution of real and artificial life forms, natural and artificial morphogenesis, self-organization, models of communication and social behaviors, emergent collective behaviors and swarm intelligence, agent-based simulations, autonomous and evolutionary robotics, adaptive, complex and biologically inspired ecosystems, artificial chemistries, and creative computer art. The models of life presented here are essential components in undergraduate and post-graduate courses in complex adaptive systems, multi-agent systems, collective robotics and nature-inspired computing. Readers interested in artificial life, evolutionary biology, simulation, cybernetics, computer graphics and animation, neuroscience, cognitive science, and philosophy will find this monograph a valuable guide and an excellent resource for supplementary reading. %7 second %I Springer %G eng %U http://www.springer.com/978-1-84882-284-9 %0 Conference Paper %B Proceedings of the National Conference on Evolutionary Computation and Global Optimization %D 2009 %T Evolving free-form stick ski jumpers and their neural control systems %A Maciej Komosinski %A Jan Polak %X This paper concerns evolution of stick agents in a simplified ski-jumping task. Both body morphologies and control systems are optimized. Evolutionary processes are performed in a range of conditions: the air drag and the friction of the ramp varies. Qualitative and quantitative analyses are presented that show how jump distance, jump height, and flight trajectory depend on environmental conditions. Jumping and landing strategies are investigated, and the most interesting evolved behaviors are reported. %B Proceedings of the National Conference on Evolutionary Computation and Global Optimization %C Poland %P 103--110 %G eng %U http://www.framsticks.com/files/common/Komosinski_Polak_EvolvedSkiJumping.pdf %0 Book Section %B Artificial Life Models in Software %D 2009 %T Framsticks: Creating and Understanding Complexity of Life %A Maciej Komosinski %A Szymon Ulatowski %E Maciej Komosinski %E Andrew Adamatzky %X This chapter describes Framsticks, a three-dimensional life simulation project. Both mechanical structures ("bodies") and control systems ("brains") of creatures are modeled. It is possible to design various kinds of experiments in this environment, including simple optimization (by evolutionary algorithms), coevolution, open-ended and spontaneous evolution, distinct gene pools and populations, diverse genotype-phenotype mappings, and modeling of species and ecosystems. Framsticks is employed in evolutionary computation, artificial intelligence, neural networks, biology, robotics and simulation, cognitive science, neuroscience, medicine, philosophy, virtual reality, graphics, and art. It is a versatile tool for research and education. %B Artificial Life Models in Software %7 second %I Springer %C New York %P 107–148 %G eng %U http://www.springer.com/978-1-84882-284-9 %& 5 %0 Report %D 2009 %T Models and implementations of timing processes using Artificial Life techniques %A Maciej Komosinski %A Adam Kups %X This work presents implementation of the Scalar Timing Model (STM) in the neural networks environment. STM is rather popular and commonly used model in the perception of time intervals in humans and animals fields of study. Currently many experiments are conducted in order to verify and research STM parameters and attributes. One of the goal of the implementation was to check whether theoretical model will cope with constraints of artificial neural networks. During implementation process it turned out, that scheme of the model should be revised (by adding extra components) in order to maintain it's functional adequacy. Another case was to check how does manipulations of certain parameters will influence collected representation of the real time within model. In this preliminary research we focus on the pacemaker module. Conclusion of this research is that appropriate choice of distribution form of impulses generated by pacemaker make it simulation of the model more congruent with the experimentally collected data then with formal assumptions of STM. %I Poznan University of Technology, Institute of Computing Science %U http://www.framsticks.com/files/common/HumanTimingModelsSimulations.pdf %9 Research report %0 Journal Article %J Foundations of Computing and Decision Sciences %D 2008 %T Evolutionary Design of Interpretable Fuzzy Controllers %A Maciej Hapke %A Maciej Komosinski %X This paper presents an approach that allows to evolve fuzzy controllers that can be expressed as fuzzy rules in human-readable form and interpreted. For comparison, the evolution is also performed on simple neural controllers. The control task considered here is a balancing problem, where a construct made of articulated elastic elements is equipped with sensors and actuators. The goal of the construct is to keep the top heavy part from touching the ground. Evolved controllers are evaluated using computer simulation. Control systems process signals from tilt sensors to actuators fixed in the construct. During evolution, fuzzy controllers (including their fuzzy sets and rules) are reconfigured by genetic operators in order to maximize fitness of the control. The article compares evolvability of neural and fuzzy controllers and demonstrates how additional, comprehensible knowledge can be gained which explains the work of the fuzzy controller. The representation for the fuzzy control system, evolutionary operators, various evaluation functions, and the best evolved control systems are presented. A sample evolved fuzzy control system is analyzed in detail to explain its behavior. %B Foundations of Computing and Decision Sciences %V 33 %P 351–367 %G eng %U http://www.framsticks.com/files/common/Komosinski_EvolveInterpretableFuzzy.pdf %0 Journal Article %J Artificial Life Journal %D 2008 %T The Numerical Measure of Symmetry for 3D Stick Creatures %A Wojciech Jaskowski %A Maciej Komosinski %X This work introduces a numerical, continuous measure of symmetry for 3D stick creatures and solid 3D objects. Background information about the property of symmetry is provided, and motivations to developing symmetry measure are described. Three approaches are mentioned, and two of them are presented in detail using a formal mathematical language. The best approach is used to sort a set of creatures according to their symmetry. Experiments with a mixed set of 84 individuals originating from both human design and evolution are performed to examine symmetry within these two sources, and to determine if human designers and evolutionary processes prefer symmetry or asymmetry. %B Artificial Life Journal %I MIT Press %V 14 %P 425–443 %8 Fall %G eng %U http://www.framsticks.com/files/common/NumericalMeasureSymmetry3DCreatures.pdf %N 4 %R 10.1162/artl.2008.14.4.14402 %0 Report %D 2008 %T Podstawowe parametry ruchu piórka w teście rysunkowym i ich zastosowanie w diagnostyce motoryki kończyn górnych %A Maciej Komosinski %X W artykule przedstawiono sposoby wyznaczania pięciu podstawowych parametrów ruchu piórka, odzwierciedlających natężenie drgań w ruchu ręki. Ruch ręki rejestrowany jest za pomocą tabletu podłączonego do komputera. Dane wykorzystane do eksperymentów pochodzą z badań pacjentów cierpiących na chorobę Parkinsona, którzy zostali poddani zabiegom palidotomii i talamotomii. W opisanych eksperymentach rozważa się cały zapis ruchu piórka (tzn. cały test rysunkowy), bez podziału na poszczególne elementy rysunku lub etapy rysowania. Pomimo tego, że algorytmy wyznaczające podstawowe parametry ruchu są stosunkowo proste, uśrednione wartości tych parametrów pozwalają odróżnić pacjentów przed i po zabiegu, a także określić rodzaj przeprowadzonej operacji. %I Poznan University of Technology, Institute of Computing Science %G eng %U http://www.cs.put.poznan.pl/mkomosinski/research/parkinson-ocena-drgan-tablet.pdf %0 Journal Article %J Nauka %D 2008 %T Sztuczne życie. Algorytmy inspirowane biologicznie %A Maciej Komosinski %B Nauka %I Polska Akademia Nauk %C Warszawa %V 2008 %P 7–21 %G eng %U http://www.alife.pl/czym-jest-sztuczne-zycie %0 Book Section %B Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes in Computer Science 4253 %D 2006 %T Biologically-inspired Visual-motor Coordination Model in a Navigation Problem %X This work presents a biologically-inspired coordination model which associates motor actions with visual stimuli. The model is introduced and explained, and navigation experiments are reported that verify the implemented visual-motor system. Experiments demonstrate that the system can be trained to solve navigation problems consisting in moving around a 3D object to reach a specific location based on the visual information only. The model is flexible, as it is composed of an adjustable number of modules. It is also interpretable, i.e. it is possible to estimate the influence of visual features on the motor action. %B Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes in Computer Science 4253 %I Springer-Verlag %C Berlin %P 341–348 %G eng %U http://www.framsticks.com/files/common/BiologicallyInspiredVisualMotorCoordinationModel.pdf %R 10.1007/11893011_44 %0 Report %D 2006 %T Measuring symmetry of moving stick creatures %A Wojciech Jaskowski %A Maciej Komosinski %I Poznan University of Technology, Institute of Computing Science %G eng %0 Book %D 2005 %T Artificial Life Models in Software %7 first %I Springer %C New York %G eng %U http://www.springer.com/978-1-84882-284-9 %0 Book Section %B Artificial Life Models in Software %D 2005 %T Framsticks: a platform for modeling, simulating and evolving 3D creatures %B Artificial Life Models in Software %I Springer %C New York %P 37–66 %G eng %& 2 %0 Generic %D 2005 %T Visualizing dynamics of evolutionary optimization processes in spaces of reduced dimensionality %A Maciej Komosinski %A Marek Kubiak %I Poznan University of Technology, Institute of Computing Science %G eng %0 Generic %D 2004 %T Aspekt geometrii w szacowaniu podobieństwa wirtualnych organizmów %A Maciej Komosinski %A Marek Kubiak %I Poznan University of Technology, Institute of Computing Science %G eng %0 Journal Article %J Theory in Biosciences %D 2004 %T Genetic mappings in artificial genomes %A Maciej Komosinski %A Szymon Ulatowski %X This paper concerns processing of genomes of artificial (computer-simulated) organisms. Of special interest is the process of translation of genotypes into phenotypes, and utilizing the mapping information obtained during such translation. If there exists more than one genetic encoding in a single artificial life model, then the translation may also occur between different encodings. The obtained mapping information allows to present genes-phenes relationships visually and interactively to a person, in order to increase understanding of the genotype-to-phenotype translation process and genetic encoding properties. As the mapping associates parts of the source sequence with the translated destination, it may be also used to trace genes, phenes, and their relationships during simulated evolution. A mappings composition procedure is formally described, and a simple method of visual mapping presentation is established. Finally, advanced visualizations of gene-phene relationships are demonstrated as practical examples of introduced techniques. These visualizations concern genotypes expressed in various encodings, including an encoding which exhibits polygenic and pleiotropic properties. %B Theory in Biosciences %V 123 %P 125–137 %8 September %G eng %U http://www.framsticks.com/files/common/GeneticMappingsInArtificialGenomes.pdf %R 10.1016/j.thbio.2004.04.002 %0 Conference Paper %B Proceedings of the 7th Joint Conference on Information Sciences %D 2003 %T Application of Evolutionarily Optimized Fuzzy Controllers for Virtual Robots %A Maciej Hapke %A Maciej Komosinski %A Dawid Waclawski %B Proceedings of the 7th Joint Conference on Information Sciences %I Association for Intelligent Machinery %C North Carolina, USA %P 1605–1608 %8 September %G eng %U http://www.framsticks.com/files/common/Komosinski_FuzzyControl_CINC2003.pdf %0 Journal Article %J Kybernetes: The International Journal of Systems & Cybernetics %D 2003 %T The Framsticks system: versatile simulator of 3D agents and their evolution %K AL %K Behavior %K Biology %K Dynamics %K Robotics %K Simulation %B Kybernetes: The International Journal of Systems & Cybernetics %V 32 %P 156–173 %G eng %U http://www.framsticks.com/files/common/Komosinski_FramsticksSystem_Kybernetes2003.pdf %R 10.1108/03684920310452382 %0 Generic %D 2002 %T Evolutionary optimization of fuzzy controllers for virtual robots %A Maciej Hapke %A Maciej Komosinski %A Dawid Waclawski %K EA %K Fuzzy %K Robotics %I Poznan University of Technology, Institute of Computing Science %G eng %0 Journal Article %J Artificial Life Journal %D 2001 %T Comparison of different genotype encodings for simulated 3D agents %A Maciej Komosinski %A Adam Rotaru-Varga %K Agents %K AL %K Body and Brain evol. %K Genetics %K Simulation %K Theory %X This paper analyzes the effect of different genetic encodings used for evolving 3D agents with physical morphologies. The complex phenotypes used in such systems often require nontrivial encodings. Different encodings used in Framsticks - a system for evolving 3D agents - are presented. These include a low-level direct mapping and two higher-level encodings: a recurrent and a developmental one. Quantitative results are presented from three simple optimization tasks (active height, passive height, and locomotion speed). The low-level encoding produced solutions of lower fitness than the two higher-level encodings under similar conditions. Results from recurrent and developmental encodings had similar fitness values but displayed qualitative differences. Desirable advantages and some drawbacks of more complex encodings are established. %B Artificial Life Journal %I MIT Press %C Cambridge, MA %V 7 %P 395–418 %8 Fall %G eng %U http://www.framsticks.com/files/common/ComparisonGeneticEncodings3DAgents.pdf %R 10.1162/106454601317297022 %0 Journal Article %J Theory in Biosciences %D 2001 %T On estimating similarity of artificial and real organisms %A Maciej Komosinski %A Grzegorz Koczyk %A Marek Kubiak %K AL %K Biology %K EA %K Theory %B Theory in Biosciences %V 120 %P 271–286 %8 December %G eng %U http://www.framsticks.com/files/common/Komosinski_Similarity_TheoryInBiosc2001.pdf %0 Generic %D 2001 %T Ewolucyjna optymalizacja fraz muzycznych sterowana przez człowieka %A Maciej Komosinski %A Jerzy Blaszczynski %A Marcin Szymanski %K AL %K EA %K Philosophy %K Psychology %I Poznan University of Technology, Institute of Computing Science %G eng %0 Book Section %B Advances in Artificial Life. Lecture Notes in Artificial Intelligence 2159 %D 2001 %T Taxonomy in Alife. Measures of similarity for complex artificial organisms %K Agents %K AL %K Biology %K EA %K Simulation %B Advances in Artificial Life. Lecture Notes in Artificial Intelligence 2159 %I Springer-Verlag %P 685–694 %G eng %U http://www.framsticks.com/files/common/Komosinski_TaxonomyAlife_ECAL2001.pdf %0 Journal Article %J Artificial Intelligence In Medicine, Special Issue on Evolutionary Computation in Medicine %D 2000 %T Evolutionary weighting of image features for diagnosing of CNS tumors %A Maciej Komosinski %A Krzysztof Krawiec %K CI %K EA %B Artificial Intelligence In Medicine, Special Issue on Evolutionary Computation in Medicine %V 19 %P 25–38 %G eng %U http://linkinghub.elsevier.com/retrieve/pii/S0933365799000482 %R 10.1016/S0933-3657(99)00048-2 %0 Book Section %B Artificial Life VII %D 2000 %T From Directed to Open-Ended Evolution in a Complex Simulation Model %K Agents %K AL %K Simulation %K Theory %B Artificial Life VII %I MIT Press %P 293–299 %G eng %0 Book Section %B Virtual Worlds. Lecture Notes in Artificial Intelligence No. 1834 %D 2000 %T The World of Framsticks: Simulation, Evolution, Interaction %K Agents %K AL %K Simulation %K Theory %B Virtual Worlds. Lecture Notes in Artificial Intelligence No. 1834 %I Springer-Verlag %C Berlin %P 214–224 %G eng %U http://www.framsticks.com/files/common/Komosinski_FramsticksSimul_VW2000.pdf %0 Generic %D 1999 %T Evolutionary weighting of features for classification %A Maciej Komosinski %A Roman %K CI %K EA %I Poznan University of Technology, Institute of Computing Science %G eng %0 Conference Paper %B Materiały konferencyjne III Krajowej Konferencji Algorytmy Ewolucyjne i Optymalizacja Globalna KAEiOG (Proceedings of the National Conference on Evolutionary Computation and Global Optimization) %D 1999 %T Framsticks: sztuczne życie – złożona symulacja stworzeń i ich ewolucji %A Maciej Komosinski %A Szymon Ulatowski %K Agents %K AI %K AL %K Simulation %B Materiały konferencyjne III Krajowej Konferencji Algorytmy Ewolucyjne i Optymalizacja Globalna KAEiOG (Proceedings of the National Conference on Evolutionary Computation and Global Optimization) %C Potok Złoty %P 157–166 %8 May %G eng %U http://www.framsticks.com/files/common/Komosinski_Framsticks_KAEiOG1999.pdf %0 Book Section %B Advances in Artificial Life. Lecture Notes in Artificial Intelligence 1674 %D 1999 %T Framsticks: towards a simulation of a nature-like world, creatures and evolution %K Agents %K AL %K Biology %K EA %K Simulation %B Advances in Artificial Life. Lecture Notes in Artificial Intelligence 1674 %I Springer-Verlag %P 261–265 %G eng %U http://www.framsticks.com/files/common/Komosinski_FramsticksEvol_ECAL1999.pdf %R 10.1007/3-540-48304-7_33 %0 Book Section %B Foundations of Intelligent Systems. Lecture Notes in Artificial Intelligence 1609 %D 1999 %T Genetic algorithms in constructive induction %K CI %K EA %B Foundations of Intelligent Systems. Lecture Notes in Artificial Intelligence 1609 %I Springer-Verlag %P 665–673 %G eng %R 10.1007/BFb0095156 %0 Conference Paper %B ECML 98 Demonstration and Poster Papers %D 1998 %T Framsticks – Artificial Life %K Agents %K AL %K Simulation %B ECML 98 Demonstration and Poster Papers %I Chemnitzer Informatik-Berichte %C Chemnitz %P 7–9 %G eng %0 Conference Paper %B ECML 98 Workshop on Upgrading Learning to the Meta-Level: Model Selection and Data Transformation %D 1998 %T Using n²-classifier in constructive induction %K EA %K ML %B ECML 98 Workshop on Upgrading Learning to the Meta-Level: Model Selection and Data Transformation %I Chemnitzer Informatik-Berichte %C Chemnitz %P 21–29 %G eng