{"title":"Temperature management for heterogeneous multi-core FPGAs using adaptive evolutionary multi-objective approaches","authors":"Renzhi Chen, Peter R. Lewis, X. Yao","doi":"10.1109/ICES.2014.7008728","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008728","url":null,"abstract":"Heterogeneous multi-core FPGAs contain different types of cores, which can improve efficiency when used with an effective online task scheduler. However, it is not easy to find the right cores for tasks when there are multiple objectives or dozens of cores. Inappropriate scheduling may cause hot spots which decrease the reliability of the chip. Given that, our research builds a simulating platform to evaluate all kinds of scheduling algorithms on a variety of architectures. On this platform, we provide an online scheduler which uses multi-objective evolutionary algorithm (EA). Comparing the EA and current algorithms such as Predictive Dynamic Thermal Management (PDTM) and Adaptive Temperature Threshold Dynamic Thermal Management (ATDTM), we find some drawbacks in previous work. First, current algorithms are overly dependent on manually set constant parameters. Second, those algorithms neglect optimization for heterogeneous architectures. Third, they use single-objective methods, or use linear weighting method to convert a multi-objective optimization into a single-objective optimization. Unlike other algorithms, the EA is adaptive and does not require resetting parameters when workloads switch from one to another. EAs also improve performance when used on heterogeneous architecture. A efficient Pareto front can be obtained with EAs for the purpose of multiple objectives.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"75 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122239065","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":"On using Gene Expression Programming to evolve multiple output robot controllers","authors":"J. Mwaura, E. Keedwell","doi":"10.1109/ICES.2014.7008737","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008737","url":null,"abstract":"Most evolutionary algorithms (EAs) represents a potential solution to a problem as a single-gene chromosome encoding, where the chromosome gives only one output to the problem. However, where more than one output to a problem is required such as in classification and robotic problems, these EAs have to be either modified in order to deal with a multiple output problem or are rendered incapable of dealing with such problems. This paper investigates the parallelisation of genes as independent chromosome entities as described in the Gene Expression Programming (GEP) algorithm. The aim is to investigate the capabilities of a multiple output GEP (moGEP) technique and compare its performance to that of a single-gene GEP chromosome (ugGEP). In the described work, the two GEP approaches are utilised to evolve controllers for a robotic obstacle avoidance and exploration behaviour. The obtained results shows that moGEP is a robust technique for the investigated problem class as well as for utilisation in evolutionary robotics.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"12 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":"115575250","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}
K. Glette, Andreas Leret Johnsen, Eivind Samuelsen
{"title":"Filling the reality gap: Using obstacles to promote robust gaits in evolutionary robotics","authors":"K. Glette, Andreas Leret Johnsen, Eivind Samuelsen","doi":"10.1109/ICES.2014.7008738","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008738","url":null,"abstract":"In evolutionary robotics, which concerns automatic design of robotic systems using evolutionary algorithms, the well-known reality gap phenomenon occurs when transferring results from simulation to real world robots. Several approaches have been proposed to tackle this challenge, such as improving the simulator, avoiding poorly simulated solutions, or promoting robust controllers by introducing noise in the simulation. In this paper we investigate if the addition of a set of small obstacles in the simulated environment can help promote more robust gaits when transferred to a real world robot. In total 80 robot gaits are tested in the real world, evolved using flat and obstacle-seeded ground planes, and using two different scenario difficulties. The results show that in the baseline scenario the proposed obstacle method has little impact on the reality gap of the evolved gaits, whereas there is a significant reduction for the difficult scenario: The average real world performance ratio is 2.3 times higher than the result obtained with the flat plane, and there are no null-performing gaits.","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":"129067768","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 strategy approach for improved in-flight control learning in a simulated Insect-Scale Flapping-Wing Micro Air Vehicle","authors":"Monica Sam, S. Boddhu, K. E. Duncan, J. Gallagher","doi":"10.1109/ICES.2014.7008742","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008742","url":null,"abstract":"Insect-Scale Flapping-Wing Micro-Air Vehicles (FW-MAVs), can be particularly sensitive to control deficits caused by ongoing wing damage and degradation. Since any such degradation could occur during flight and likely in ways difficult to predict apriori, any automated methods to apply correction would also need to be applied in-flight. Previous work has demonstrated effective recovery of correct flight behavior via online (in service) evolutionary algorithm based learning of new wing-level oscillation patterns. In those works, Evolutionary Algorithms (EAs) were used to continuously adapt wing motion patterns to restore the force generation expected by the flight controller. Due to the requirements for online learning and fast recovery of correct flight behavior, the choice of EA is critical. The work described in this paper replaces previously used oscillator learning algorithms with an Evolution Strategy (ES), an EA variant never previously tested for this application. This paper will demonstrate that this approach is both more effective and faster than previously employed methods. The paper will conclude with a discussion of future applications of the technique within this problem domain.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"3 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":"125980361","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":"Practical issues for configuring carbon nanotube composite materials for computation","authors":"K. Clegg, J. Miller, M. K. Massey, M. Petty","doi":"10.1109/ICES.2014.7008723","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008723","url":null,"abstract":"We report our experiences of attempting to configure a single-walled carbon nanotube (SWCNT) / polymer composite material deposited on a micro-electrode array to carry out two classification tasks based on data sets from University of California, Irvine (UCI)[1]. The tasks are attempted using hybrid “in materio” computation: a technique that uses machine search to configure materials for computation. The SWCNT / polymer composite materials are configured using static voltages so that voltage output readings from the material predict which class the data samples belong to. Our initial results suggest that the configured SWCNT materials are able to achieve good levels of predictive accuracy. However, we are in no doubt that the time and effort required to configure the samples could be improved. The parameter space when dealing with physical systems is large, often unknown and slow to test, making progress in this field difficult. Our purpose is not demonstrate the accuracy of configured samples to perform a certain classification, but to showcase the potential of configuring very small material samples with analogue voltages to solve stand alone computation tasks. Such SWCNT devices would be cheap to manufacture and require only low precision assembly, yet if correctly configured would be able to function as multipurpose, single task computational devices.","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":"133958523","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":"Evolving a lookup table based controller for robotic navigation","authors":"M. Beckerleg, Justin Matulich","doi":"10.1109/ICES.2014.7008740","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008740","url":null,"abstract":"This paper describes how lookup tables can be evolved to control the motion of a simulated two wheeled robot, whose functions are either to move towards a light source or avoid obstacles. The robot has two light sensors, six obstacle sensors and two DC motor drivers for the wheels. The lookup table controls the motion of the robot by changing the motor speeds dependent on the sensor values. For light following, the axes of the table are right and left light sensor levels, whilst for obstacle avoidance the axis is the bit combination of the six digital sensors. The parameters within both tables are left and right motor direction. The genetic algorithm using two point crossover with a mutation rate of three percent and tournament selection successfully evolved the lookup tables for both navigational tasks.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"75 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":"124743527","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":"Segmental transmission line: Its practical application the optimized PCB trace design using a genetic algorithm","authors":"M. Yasunaga, H. Shimada, K. Seki, I. Yoshihara","doi":"10.1109/ICES.2014.7008718","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008718","url":null,"abstract":"High signal integrity (SI) is an important aspect of the design of printed circuit boards (PCBs) with clock frequencies in the GHz range. Unfortunately, conventional PCB trace designs based on the matching of characteristic impedances do not work well with GHz digital signals. In order to overcome this difficulty, we previously proposed a novel PCB trace structure, the segmental transmission line (STL), in which the trace design is optimized using genetic algorithms (GAs). In this paper, we apply the STL to high-speed double data rate (DDR) memory-bus systems, backplane bus systems for basic servers, and high-density trace bus systems. We show that the performance of the STL on those real world applications has high SI by using real measurements on their prototypes.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"43 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120983236","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}
Yang Xiao, James Alfred Walker, S. Bale, M. Trefzer, A. Tyrrell
{"title":"Circuit design optimisation using a modified genetic algorithm and device layout motifs","authors":"Yang Xiao, James Alfred Walker, S. Bale, M. Trefzer, A. Tyrrell","doi":"10.1109/ICES.2014.7008715","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008715","url":null,"abstract":"Circuit performance optimisation such as increasing speed and minimizing power consumption is the most important design goal for circuit designers next to correct functionality. This is generally also a very complex problem where, in order to solve it, several factors such as device characteristics, circuit topology, and circuit functionality must be considered. Particularly, as technology has scaled to the atomistic level, the resulting uncertainty factors further affect circuit performance. In this paper, we propose combining a modified genetic algorithm with dynamic gene mutation and device layout motif selection for circuit performance improvement. We explore novel device layout motifs (O shape device) to exploit effects of device layout at the atomistic level in order to improve characteristics of circuits and combine them with a modified GA for automatic circuit optimisation. Additionally, in order to overcome local optima and premature convergence, a dynamic gene mutation rate is performed within the GA. The experimental results show that this methodology can achieve more than 30% delay reduction through mixed combinations of O shape devices and regular devices in a circuit, compared to circuits built of only regular devices. At the same time, the local optima are also reliably avoided due to the dynamic gene mutation.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"25 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":"123274518","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":"Adaptive self-assembly in swarm robotics through environmental bias","authors":"Jean-Marc Montanier, P. Haddow","doi":"10.1109/ICES.2014.7008739","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008739","url":null,"abstract":"A swarm of robots may face challenges in unknown environments where self-assembly is a necessity e.g. crossing difficult areas. When exploring such environments, the self-assembly process has to be triggered only where needed and only for those robots required, leaving other robots to continue exploration. Further, self-assembled robots should dis-assemble when assembled structures are no longer required. Strategies have thus to be learned to trigger self-assembly and dis-assembly so as to meet the needs of the environment. Research has focused on the learning of strategies where all robots of the swarm had to adopt one common strategy: either self-assembly or dis-assembly. The work herein studies how strategies using both self-assembly and dis-assembly can be learned within the same swarm. Further, the effect of the different environments on this challenge is presented.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"10 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":"126695164","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 growth of genomes for the development and replication of multicellular organisms with indirect encoding","authors":"S. Nichele, G. Tufte","doi":"10.1109/ICES.2014.7008733","DOIUrl":"https://doi.org/10.1109/ICES.2014.7008733","url":null,"abstract":"The genomes of biological organisms are not fixed in size. They evolved and diverged into different species acquiring new genes and thus having different lengths. In a way, biological genomes are the result of a self-assembly process where more complex phenotypes could benefit by having larger genomes in order to survive and adapt. In the artificial domain, evolutionary and developmental systems often have static size genomes, e.g. chosen beforehand by the system designer by trial and error or estimated a priori with complicated heuristics. As such, the maximum evolvable complexity is predetermined, in contrast to open-ended evolution in nature. In this paper, we argue that artificial genomes may also grow in size during evolution to produce high-dimensional solutions incrementally. We propose an evolutionary growth of genome representations for artificial cellular organisms with indirect encodings. Genomes start with a single gene and acquire new genes when necessary, thus increasing the degrees of freedom and expanding the available search-space. Cellular Automata (CA) are used as test bed for two different problems: replication and morphogenesis. The chosen CA encodings are a standard developmental table and an instruction based approach. Results show that the proposed evolutionary growth of genomes' method is able to produce compact and effective genomes, without the need of specifying the full set of regulatory configurations.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"16 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":"127388631","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}