发布求助
文献互助 智能选刊 最新文献

Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)最新文献

筛选
英文 中文
Trajectory generation and accumulation for partner robots based on structured learning 基于结构化学习的伙伴机器人轨迹生成与积累
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1331173
Y. Nojima, N. Kubota, F. Kojima
{"title":"Trajectory generation and accumulation for partner robots based on structured learning","authors":"Y. Nojima, N. Kubota, F. Kojima","doi":"10.1109/CEC.2004.1331173","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331173","url":null,"abstract":"The aim of This work is to develop partner robots that can obtain and accumulate human-friendly behaviors. To realize it, we use a concept of structured learning which emphasizes the importance of an interactive learning of several modules through interaction with its environment. In a proposed method, a robot obtains hand-to-hand behavior by using an interactive evolutionary computation based on human evaluations estimated by fuzzy state-value functions. Moreover, a self-organizing map is used for clustering human hand positions. A state-value function and a knowledge database are assigned to each clustered positions. Furthermore, the best trajectory is stored in the knowledge database to reuse it in the same situation. Some experimental results show the effectiveness of the proposed method.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"98 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":"133997059","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}
引用次数: 1
Self adaptation of operator rates for multimodal optimization 多模态优化中算子率的自适应
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1331103
Jonatan Gómez
{"title":"Self adaptation of operator rates for multimodal optimization","authors":"Jonatan Gómez","doi":"10.1109/CEC.2004.1331103","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331103","url":null,"abstract":"This work presents a niching technique for an evolutionary algorithm that adjusts the genetic operators probabilities at the same time evolves a solution for the optimization problem. Such niching technique is based on the deterministic crowding technique and a variation of the dynamic inbreeding mating restriction. Since each individual encodes its own operator rates and uses a randomized version of a learning rule mechanism for updating them according to the performance reached by the offspring (relative to its parent performance), it is possible to apply mating restriction schemes for selecting the additional parent in the crossover. Moreover, individuals are replaced according to a variation of the deterministic crowding replacement policy. The behavior of the niching technique is studied using different genetic operators for both real and binary encoding schemes on some benchmark functions.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"6 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":"133371267","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}
引用次数: 11
Non-Euclidean distance measures in AIRS, an artificial immune classification system 人工免疫分类系统AIRS中的非欧几里得距离测量
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330980
J. S. Hamaker, L. Boggess
{"title":"Non-Euclidean distance measures in AIRS, an artificial immune classification system","authors":"J. S. Hamaker, L. Boggess","doi":"10.1109/CEC.2004.1330980","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330980","url":null,"abstract":"The AIRS classifier, based on principles derived from resource limited artificial immune systems, performs consistently well over a broad range of classification problems. This paper explores the effects of adding nonEuclidean distance measures to the basic AIRS algorithm using four well-known publicly available classification problems having various proportions of real, discrete, and nominal features.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"179 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":"115024920","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}
引用次数: 51
The influence of grid shape and asynchronicity on cellular evolutionary algorithms 网格形状和异步性对细胞进化算法的影响
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1331163
B. Dorronsoro, E. Alba, M. Giacobini, M. Tomassini
{"title":"The influence of grid shape and asynchronicity on cellular evolutionary algorithms","authors":"B. Dorronsoro, E. Alba, M. Giacobini, M. Tomassini","doi":"10.1109/CEC.2004.1331163","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331163","url":null,"abstract":"In This work we study cellular evolutionary algorithms, a kind of decentralized heuristics, and the importance of the induced exploration/exploitation balance on different problems. It is shown that, by choosing synchronous or asynchronous update policies, the selection pressure, and thus the exploration/exploitation tradeoff, can be influenced directly, without using additional ad hoc parameters. Synchronous algorithms of different neighborhood-to-topology ratio, and asynchronous update policies are applied to a set of benchmark problems. Our conclusions show that the update methods of the asynchronous versions, as well as the ratio of the decentralized algorithm, have a marked influence on its convergence and on its accuracy.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"42 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":"115622546","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}
引用次数: 27
A novel memetic algorithm with random multi-local-search: a case study of TSP 一种新的随机多局部搜索模因算法:以TSP为例
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1331189
P. Zou, Zhigang Zhou, Guoliang Chen, X. Yao
{"title":"A novel memetic algorithm with random multi-local-search: a case study of TSP","authors":"P. Zou, Zhigang Zhou, Guoliang Chen, X. Yao","doi":"10.1109/CEC.2004.1331189","DOIUrl":"https://doi.org/10.1109/CEC.2004.1331189","url":null,"abstract":"Memetic algorithms (MAs) have been shown to be very effective in finding near optimal solutions to hard combinatorial optimization problems. We propose a novel memetic algorithm (MsMA), in which a new local search scheme is introduced. We called this local search scheme as random multi-local-search (MLS). The MLS is composed of several local search schemes, each of which executes with a predefined probability to increase the diversity of the population. The combination of MsMA with the crossover operator edge assembly crossover (EAX) on the classic combinatorial optimization problem traveling salesman problem (TSP) is studied, and comparisons are also made with some best known MAs. We have found that it is significantly outperforming the known MAs on almost all of the selected instances. Furthermore, we have proposed a new crossover named M-EAX, which has more powerful local search ability than the EAX. The experimental results show that the MsMA with M-EAX has given a further improvement to the existing EAX.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"26 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":"114867247","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}
引用次数: 9
Pareto optimal sensing strategies for an active vision system 主动视觉系统的Pareto最优感知策略
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330892
Enrique Dunn, Gustavo Olague, E. Lutton, Marc Schoenauer
{"title":"Pareto optimal sensing strategies for an active vision system","authors":"Enrique Dunn, Gustavo Olague, E. Lutton, Marc Schoenauer","doi":"10.1109/CEC.2004.1330892","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330892","url":null,"abstract":"We present a multiobjective methodology, based on evolutionary computation, for solving the sensor planning problem for an active vision system. The application of different representation schemes, that allow to consider either fixed or variable size camera networks in a single evolutionary process, is studied. Furthermore, a novel representation of the recombination and mutation operators is brought forth. The developed methodology is incorporated into a 3D simulation environment and experimental results shown. Results validate the flexibility and effectiveness of our approach and offer new research alternatives in the field of sensor planning.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"32 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113935584","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}
引用次数: 11
Evolutionary behavior testing of commercial computer games 商业电脑游戏的进化行为测试
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330847
B. Chan, J. Denzinger, D. Gates, Kevin Loose, J. W. Buchanan
{"title":"Evolutionary behavior testing of commercial computer games","authors":"B. Chan, J. Denzinger, D. Gates, Kevin Loose, J. W. Buchanan","doi":"10.1109/CEC.2004.1330847","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330847","url":null,"abstract":"We present an approach to use evolutionary learning of behavior to improve testing of commercial computer games. After identifying unwanted results or behavior of the game, we propose to develop measures on how near a sequence of game states comes to the unwanted behavior and to use these measures within the fitness function of a GA working on action sequences. This allows to find action sequences that produce the unwanted behavior, if they exist. Our experimental evaluation of the method with the FIFA-99 game and scoring a goal as unwanted behavior shows that the method is able to find such action sequences, allowing for an easy reproduction of critical situations and improvements to the tested game.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"56 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":"115756342","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}
引用次数: 44
A genetic algorithm applied to graph problems involving subsets of vertices 一种应用于涉及顶点子集的图问题的遗传算法
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330871
Yaser Alkhalifah, R. L. Wainwright
{"title":"A genetic algorithm applied to graph problems involving subsets of vertices","authors":"Yaser Alkhalifah, R. L. Wainwright","doi":"10.1109/CEC.2004.1330871","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330871","url":null,"abstract":"Many graph problems seek subsets of their vertices that maximize or minimize objective functions on the vertices. Among these are the capacitated p-median problem, the geometric connected dominating set problem, the capacitated k-center problem, and the traveling tourist problem. Prior genetic algorithms research in this area applied a simple mutation of an allele by random replacement. Recently an enhanced operator called hypermutation was developed, proving to be very effective for solving the capacitated p-median problem. We propose a GA with a new heuristic called the nearest four neighbors heuristic (N4N) for solving graph problems requiring a subset of vertices. It is an extension of the hypermutation operator. Genetic algorithms that use each of these three mutation operators (simple, hypermutation, N4N) are applied to instances of the four graph-subset problems listed above. Results show that our N4N heuristic obtained superior results compared to the hypermutation and the simple mutation operators in every test case.","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":"115757664","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}
引用次数: 21
Multi-objective evolutionary search performance with explicit building-block sizes for NPC problems 具有明确构建块大小的NPC问题多目标进化搜索性能
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330931
Mark P. Kleeman, R. O. Day, G. Lamont
{"title":"Multi-objective evolutionary search performance with explicit building-block sizes for NPC problems","authors":"Mark P. Kleeman, R. O. Day, G. Lamont","doi":"10.1109/CEC.2004.1330931","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330931","url":null,"abstract":"This research uses an explicit building block based MOEA to solve the multiobjective quadratic assignment problem. We use the multiobjective messy genetic algorithm II (MOMGA-II) to determine what role certain building blocks sizes play in filling up the Pareto front. Additionally, we investigate the role of the competitive template. The algorithm uses the competitive template by propagating it through all the building block sizes and by randomizing it for each building block size. We show that randomized competitive templates produce better results due to more exploration, and larger building block sizes are more common on the outer edges of the Pareto front because they fill more chromosome characteristics in the genotype space.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"48 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":"115830593","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}
引用次数: 3
Evolution of strategies in modified sequential assessment games 改进序贯博弈策略的演化
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753) Pub Date : 2004-06-19 DOI: 10.1109/CEC.2004.1330883
Xiaolu Sun, W. Just
{"title":"Evolution of strategies in modified sequential assessment games","authors":"Xiaolu Sun, W. Just","doi":"10.1109/CEC.2004.1330883","DOIUrl":"https://doi.org/10.1109/CEC.2004.1330883","url":null,"abstract":"The sequential assessment game is one of the most important game-theoretic models of animal contests. It intends to model contests in which animals gain a progressively more accurate estimate of relative fighting ability by means of repeated bouts of fighting. The model predicts an evolutionarily stable strategy (ESS) that would correspond to an increasing sequence of thresholds for quitting the game. We report on simulated evolution of strategies in modified versions of the game and compare our results with theoretical predictions for the original model. Outcomes of these simulations corroborate some, but not all theoretical predictions for the sequential assessment game. In particular, our results suggest that theoretical analyses of the sequential assessment game with information asymmetry need to take into account factors that have hitherto been ignored in the literature.","PeriodicalId":152088,"journal":{"name":"Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753)","volume":"83 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":"115015663","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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信