{"title":"Islands of fitness compact genetic algorithm for rapid in-flight control learning in a Flapping-Wing Micro Air Vehicle: A search space reduction approach","authors":"K. E. Duncan, S. Boddhu, Monica Sam, J. Gallagher","doi":"10.1109/ICES.2014.7008743","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008743","url":null,"abstract":"On-going effective control of insect-scale Flapping-Wing Micro Air Vehicles could be significantly advantaged by active in-flight control adaptation. Previous work demonstrated that in simulated vehicles with wing membrane damage, in-flight recovery of effective vehicle attitude and vehicle position control precision via use of an in-flight adaptive learning oscillator was possible. A significant portion of the most recent approaches to this problem employed an island-of-fitness compact genetic algorithm (ICGA) for oscillator learning. The work presented in this paper provides the details of a domain specific search space reduction approach implemented with existing ICGA and its effect on the in-flight learning time. Further, it will be demonstrated that the proposed search space reduction methodology is effective in producing an error correcting oscillator configuration rapidly, online, while the vehicle is in normal service. The paper will present specific simulation results demonstrating the value of the search space reduction and discussion of future applications of the technique to this problem domain.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124433484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparison and evaluation of signal representations for a carbon nanotube computational device","authors":"O. R. Lykkebø, G. Tufte","doi":"10.1109/ICES.2014.7008722","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008722","url":null,"abstract":"Evolution in Materio (EIM) exploits properties of physical systems for computation. Evolution manipulates physical processes by stimulating materials by applying some sort of configuration signal. For materials such as liquid crystal and carbon nanotubes the properties of configuration data is rather open. In this work we investigate what kind of configuration data that most likely will be favourable for a carbon nanotube based device. An experimental approach targeting graph colouring is used to test three different types of signal representation: static voltages, square waves and a mixed signal representation. The results show that all signal representation was capable of producing a working device. In the experiments square wave representation produced the best result.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122844377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Berend Weel, Emanuele Crosato, Jacqueline Heinerman, E. Haasdijk, A. Eiben
{"title":"A robotic ecosystem with evolvable minds and bodies","authors":"Berend Weel, Emanuele Crosato, Jacqueline Heinerman, E. Haasdijk, A. Eiben","doi":"10.1109/ICES.2014.7008736","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008736","url":null,"abstract":"This paper presents a proof of concept demonstration of a novel evolutionary robotic system where robots can self-reproduce. We construct and investigate a strongly embodied evolutionary system, where not only the controllers, but also the morphologies undergo evolution in an on-line fashion. Forced by the lack of available hardware we build this system in simulation. However, we use a high quality simulator (Webots) and an existing hardware platform (Roombots) which makes the system, in principle, constructible. Our system can be perceived as an Artificial Life habitat, where robots with evolvable bodies and minds live in an arena and actively induce an evolutionary process `from within', without a central evolutionary agency or a user-defined synthetic fitness function.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125327597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
David M. R. Lawson, James Alfred Walker, M. Trefzer, S. Bale, A. Tyrrell
{"title":"Evolving hierarchical low disruption fault tolerance strategies for a novel programmable device","authors":"David M. R. Lawson, James Alfred Walker, M. Trefzer, S. Bale, A. Tyrrell","doi":"10.1109/ICES.2014.7008725","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008725","url":null,"abstract":"Faults can occur in transistor circuits at any time, and increasingly so as fabrication processes continue to shrink. This paper describes the use of evolution in creating fault recovery strategies for use on the PAnDA architecture. Previous work has shown how such strategies, applied in a random but biased fashion can be used to overcome transistor faults and also how, without knowledge of the fault, the average time to find a fix could be reduced. This work presents a further optimisation where an Evolutionary Algorithm (EA) is used to optimise the order that deterministic strategies are applied to a faulty circuit in order to reduce the average time to find a fix. The two methods are compared and this comparison is used to set the path for future work.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130582390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sustainability assurance modeling for SRAM-based FPGA evolutionary self-repair","authors":"R. Oreifej, R. Al-Haddad, R. Ashraf, R. Demara","doi":"10.1109/ICES.2014.7008717","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008717","url":null,"abstract":"A quantitative stochastic design technique is developed for evolvable hardware systems with self-repairing, replaceable, or amorphous spare components. The model develops a metric of sustainability which is defined in terms of residual functionality achieved from pools of amorphous spares of dynamically configurable logic elements, after repeated failure and recovery cycles. At design-time the quantity of additional resources needed to meet mission availability and lifetime requirements given the fault-susceptibility and recovery capabilities are assured within specified constraints. By applying this model to MCNC benchmark circuits mapped onto Xilinx Virtex-4 Field Programmable Gate Array (FPGA) with reconfigurable logic resources, we depict the effect of fault rates for aging-induced degradation under Time Dependent Dielectric Breakdown (TDDB) and interconnect failure under Electromigration (EM). The model considers a population-based genetic algorithm to refurbish hardware resources which realize repair policy parameters and decaying reparability as a complete case-study using published component failure rates.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115061828","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evolutionary digital circuit design with fast candidate solution establishment in field programmable gate arrays","authors":"R. Dobai, K. Glette, J. Tørresen, L. Sekanina","doi":"10.1109/ICES.2014.7008726","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008726","url":null,"abstract":"Field programmable gate arrays (FPGAs) are a popular platform for evolving digital circuits. FPGAs allow to be reconfigured partially which provides a natural way of establishing candidate solutions. Recent research focuses on the hardware implementation of evolutionary design platforms. Several approaches have been developed for effective establishment and evaluation of candidate solutions in FPGAs. In this paper a new mutation operator is proposed for evolutionary algorithms. The chromosome representing the candidate solution is mutated in such a way that only one configuration frame is required for establishing the mutated candidate solution in hardware. The experimental results confirm that the reduced number of configuration frames and mutations at lower level of granularity ensure faster evolution, generation of more candidate solutions in a given time as well as solutions with better quality.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130456205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Acceleration of transistor-level evolution using Xilinx Zynq Platform","authors":"Vojtěch Mrázek, Z. Vašíček","doi":"10.1109/ICES.2014.7008716","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008716","url":null,"abstract":"The aim of this paper is to introduce a new accelerator developed to address the problem of evolutionary synthesis of digital circuits at transistor level. The proposed accelerator, based on recently introduced Xilinx Zynq platform, consists of a discrete simulator implemented in programmable logic and an evolutionary algorithm running on a tightly coupled embedded ARM processor. The discrete simulator was introduced in order to achieve a good trade-off between the precision and performance of the simulation of transistor-level circuits. The simulator is implemented using the concept of virtual reconfigurable circuit and operates on multiple logic levels which enables to evaluate the behavior of candidate transistor-level circuits at a reasonable level of detail. In this work, the concept of virtual reconfigurable circuit was extended to enable bidirectional data flow which represents the basic feature of transistor level circuits. According to the experimental evaluation, the proposed architecture speeds up the evolution in one order of magnitude compared to an optimized software implementation. The developed accelerator is utilized in the evolution of basic logic circuits having up to 5 inputs. It is shown that solutions competitive to the circuits obtained by conventional design methods can be discovered.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"How to evolve complex combinational circuits from scratch?","authors":"Z. Vašíček, L. Sekanina","doi":"10.1109/ICES.2014.7008732","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008732","url":null,"abstract":"One of the serious criticisms of the evolutionary circuit design method is that it is not suitable for the design of complex large circuits. This problem is especially visible in the evolutionary design of combinational circuits, such as arithmetic circuits, in which a perfect response is requested for every possible combination of inputs. This paper deals with a new method which enables us to evolve complex circuits from a randomly seeded initial population and without providing any information about the circuit structure to the evolutionary algorithm. The proposed solution is based on an advanced approach to the evaluation of candidate circuits. Every candidate circuit is transformed to a corresponding binary decision diagram (BDD) and its functional similarity is determined against the specification given as another BDD. The fitness value is the Hamming distance between the output vectors of functions represented by the two BDDs. It is shown in the paper that the BDD-based evaluation procedure can be performed much faster than evaluating all possible assignments to the inputs. It also significantly increases the success rate of the evolutionary design process. The method is evaluated using selected benchmark circuits from the LGSynth91 set. For example, a correct implementation was evolved for a 28-input frg1 circuit. The evolved circuit contains less gates (a 57% reduction was obtained) than the result of a conventional optimization conducted by ABC.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116868675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Balancing performance and efficiency in a robotic fish with evolutionary multiobjective optimization","authors":"A. Clark, Jianxun Wang, Xiaobo Tan, P. McKinley","doi":"10.1109/ICES.2014.7008744","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008744","url":null,"abstract":"In this paper, we apply evolutionary multiobjective optimization to the design of a robotic fish with a flexible caudal fin. Specifically, we use the NSGA-II algorithm to discover solutions (physical dimensions, flexibility, and control parameters) that optimize both swimming performance and power efficiency. The optimization is conducted in a custom simulation environment based on an accurate yet computationally-efficient model of hydrodynamics. The results of these simulations reveal general principles that can be applied in the design of robotic fish morphology and control. To verify that the simulation results are physically relevant, we selected several of the evolved solutions, fabricated flexible caudal fins using a multi-material 3D printer, and attached them to a robotic fish prototype. Experimental results, conducted in a large water tank, correspond reasonably well to simulation results in both swimming performance and power efficiency, demonstrating the usefulness of evolutionary computation methods to this application domain.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128431465","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An Artificial Ecosystem Algorithm applied to static and Dynamic Travelling Salesman Problems","authors":"Manal T. Adham, P. Bentley","doi":"10.1109/ICES.2014.7008734","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008734","url":null,"abstract":"An ecosystem inspired algorithm that aims to take advantage of highly distributed computer architectures is proposed. The motivation behind this work is to grasp the phenomenal properties of ecosystems and use them for large-scale real-world problems. Just as an ecosystem comprises many separate components that adapt together to form a single synergistic whole, the Artificial Ecosystem Algorithm (AEA) solves a problem by adapting subcomponents of a problem such that they fit together and form a single optimal solution. AEA uses populations of solution components that are solved individually such that they combine to form the candidate solution, unlike typical biology inspired algorithms like GA, PSO, BCO, and ACO that regard each individual in a population as a candidate solution. Like species in an ecosystem, the AEA may have species of components representing sub-parts of the solution that evolve together and cooperate with the other species. Three versions of this algorithm are illustrated: the basic AEA algorithm, and two AEA with Species. These algorithms are evaluated through a series of experiments on symmetric and dynamic Travelling Salesman Problems that show very promising results compared to existing approaches. Experiments also show very promising results for the Dynamic TSP making this method potentially useful for handling dynamic routing problems.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126817780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}