{"title":"Punctuated anytime learning for evolving multi-agent capture strategies","authors":"H. Blumenthal, G. Parker","doi":"10.1109/CEC.2004.1331117","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331117","url":null,"abstract":"The evolution of a team of heterogeneous agents is challenging. To allow the greatest level of specialization team members must be evolved in separate populations, but finding acceptable partners for evaluation at trial time is difficult. Testing too few partners blinds the GA from recognizing fit solutions while testing too many partners makes the computation time unmanageable. We developed a system based on punctuated anytime learning that periodically tests a number of partner combinations to select a single individual from each population to be used at trial time. We previously tested our method with a two agent box-pushing task. In this work, we show the efficiency of our method by applying it to the predator-prey scenario.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130583262","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":"PSO approaches to coevolve IPD strategies","authors":"N. Franken, A. Engelbrecht","doi":"10.1109/CEC.2004.1330879","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330879","url":null,"abstract":"This paper investigates two different approaches using particle swarm optimisation (PSO) to evolve strategies for iterated prisoner's dilemma (IPD). Strategies evolved by the lesser known binary PSO algorithm are compared to strategies evolved by neural networks that were trained using PSO. Evolved strategies are compared against well-known game theory strategies, with positive results. The presence of noise during IPD interactions are also investigated, and evolved strategies are compared against the same well-known game theory strategies in a noisy environment.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"702 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132844647","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":"Labeled-GA with adaptive mutation rate","authors":"P. Hartono, S. Hashimoto, M. Wahde","doi":"10.1109/CEC.2004.1331121","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331121","url":null,"abstract":"In This work we propose a modified GA that assigns a unique mutation rate to each gene based on the contribution of the respective gene's contribution to the fitness of the individual. Although the proposed model is not \"parameter free\", through a number of experiments, we show that the parameters for this model are significantly insensitive to the landscape of the problems compared with the mutation rate in conventional GA, implying that this model could deal effectively with a wide range of problems the requirement to set the mutation rate empirically.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131937096","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":"The effect of noise on the performance of cultural evolution in multi-agent systems","authors":"D. Curran, C. O'Riordan","doi":"10.1109/CEC.2004.1331109","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331109","url":null,"abstract":"This work examines the effect of the addition of noise to the cultural learning process of a population of agents. Experiments are undertaken using an artificial life simulator capable of simulating population learning (through the use of genetic algorithms) and lifetime learning (through the use of neural networks). To simulate cultural learning, (the exchange of information through nongenetic means) a group of highly fit agents is selected at each generation to function as teachers which are assigned a number of pupils to instruct. Cultural exchanges occur through a hidden layer of an agent's neural network known as the verbal layer. Through the use of back-propagation, a pupil agent imitates the teacher's behaviour and overall population fitness is increased. We introduce cultural mutation into a population of agents by adding noise to cultural exchanges between teacher and pupil agents. We conduct a series of experiments with varying values of cultural mutation to study the effects of this operator on the performance of the population. We show that the addition of noise to cultural exchanges can improve on the performance of cultural learning.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130970905","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 application of graph based evolutionary algorithms for diversity preservation","authors":"K. Bryden, D. Ashlock, D. McCorkle","doi":"10.1109/CEC.2004.1330887","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330887","url":null,"abstract":"A difficult application case of evolutionary algorithms is that in which individual fitness evaluations take several processor-minutes to a few processor-hours. The design of evolutionary algorithms with such expensive fitness evaluation differs substantially from the norm where fitness evaluation is rapid. In this paper we apply evolutionary algorithms to a thermal systems engineering design problem - the design of a biomas cook stove currently in use in Central America. Fitness evaluation involves the use of computational fluid dynamics (CFD) modeling of the flow of hot air and heat transport within the stove to equalize the surface temperature. The goal is to optimize the placement and size of baffles that deflect hot gasses underneath the cook top of the stove. Three techniques are used to permit evolutionary algorithm to function on this challenging problem using a population of relatively small size. First, computations are performed on a Linux cluster machine yielding a large, fixed performance increase. Second, the resolution of the mesh for CFD computations used a minimal; mesh that yields acceptable fidelity of CFD computations. Third, a diversity preserving technique called a graph based evolutionary algorithm (GBEA) is used to retain population diversity during evolution. A usable stove design, subsequently deployed in the field, was located by the evolutionary algorithm. In this paper we demonstrate that GBEAs preserve diversity on this baffle design problem and give evidence that highly connected graphs is a good choice for future work on analogous CFD problems. Diversity preservation is a function of both tournament size and the connectivity (geography) of the graph used.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125579730","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":"Autonomous agent response learning by a multi-species particle swarm optimization","authors":"C. Chow, H. Tsui","doi":"10.1109/CEC.2004.1330938","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330938","url":null,"abstract":"An autonomous agent response learning (AARL) algorithm is presented in this paper. We proposed to decompose the award function into a set of local award functions. By optimizing this objective function set, the response function with maximum award can be determined. To tackle the optimization problem, a modified particle swarm optimization (PSO) called \"multi-species PSO (MS-PSO)\" is introduced by considering each objective function as a specie swarm. Two sets of experiments are provided to illustrate the performance of MS-PSO. The results show that it returns a more accurate response set within shorter duration by comparing with other PSO methods.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126668244","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":"Particle swarm optimization with adaptive linkage learning","authors":"Deepak Devicharan, C. Mohan","doi":"10.1109/CEC.2004.1330902","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330902","url":null,"abstract":"In many problems, the quality of solutions and computational effort required by optimization algorithms can be improved by exploiting knowledge found in the linkages or interrelations between problem dimensions or components. These linkages are sometimes known a priori from the nature of the itself; in other cases linkages can be learned by sampling the data space prior to the application of the optimization algorithm. This paper presents a new version of the particle swarm optimization algorithm (PSO) that utilizes linkages between components, performing more frequent simultaneous updates on subsets of particle position components that are strongly linked. Prior to application of this linkage-sensitive PSO algorithm, problem specific linkages can be learned by examining a randomly chosen collection of points in the search space to determine the correlations in fitness changes resulting from perturbations in pairs of components of particle positions. The resulting algorithm, adaptive-linkage PSO (ALiPSO) has performed significantly better than the classical PSO, in simulations conducted so far on several test problems.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124988591","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":"A fuzzy-optima definition based multiobjective optimization of a racing car tyre-suspension system","authors":"M. Farina, M. Gobbi","doi":"10.1109/CEC.2004.1330831","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330831","url":null,"abstract":"When dealing with multiobjective optimization of the tyre-suspension system of a racing car, a large number of objectives have to be taken into account. Two different models have been used, both validated on data coming from an instrumented car, a differential equation based physical model and a neural network purely numerical method. Up to 23 objective functions have been defined, at least 14 of which showing to be in strict clash each other. The equivalent scalar function based formulation is intentionally avoided due to its well known limitations. A fuzzy definition of optima, being a generalization of Pareto-optimality, is applied to the problem. The result of such an approach is that subsets of Pareto-optimal solutions (being on such a problem a big portion of the entire search space) can be properly selected as a consequence of inputs from the designer. The obtained optimal solutions are compared with the reference vehicle and with the optima previously obtained with design of experiments techniques and different MO optimization strategies.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125176762","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":"Symbolic regression modeling of blown film process effects","authors":"A. Kordon, C. Lue","doi":"10.1109/CEC.2004.1330907","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330907","url":null,"abstract":"The potential of symbolic regression for automatic generation of process effects empirical models has been explored on a real industrial case study. A methodology based on nonlinear variable selection and model derivation by genetic programming has been defined and successfully applied for blown film process effects modeling. The derived nonlinear models are simple, have better performance than the linear models, and predicted behavior in accordance with the process physics.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114268232","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":"High performance clustering with differential evolution","authors":"S. Paterlini, T. Krink","doi":"10.1109/CEC.2004.1331142","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331142","url":null,"abstract":"Partitional clustering poses a NP hard search problem for non-trivial problems. While genetic algorithms (GA) have been very popular in the clustering field, particle swarm optimization (PSO) and differential evolution (DE) are rather unknown. We report results of a performance comparison between a GA, PSO and DE for a medoid evolution clustering approach. Our results show that DE is clearly and consistently superior compared to GAs and PSO, both in respect to precision and robustness of the results for hard clustering problems. We conclude that DE rather than GAs should be primarily considered for tackling partitional clustering problems with numerical optimization.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131145412","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}