How evolvable is novelty search?

D. Shorten, G. Nitschke
{"title":"How evolvable is novelty search?","authors":"D. Shorten, G. Nitschke","doi":"10.1109/ICES.2014.7008731","DOIUrl":null,"url":null,"abstract":"This research compares the efficacy of novelty versus objective based search for producing evolvable populations in the maze solving task. Populations of maze solving simulated robot controllers were evolved to solve a variety of different, relatively easy, mazes. This evolution took place using either novelty or objective-based search. Once a solution was found, the simulation environment was changed to one of a variety of more complex mazes. Here the population was evolved to find a solution to the new maze, once again with either novelty or objective based search. It was found that, regardless of whether the search in the second maze was directed by novelty or fitness, populations that had been evolved under a fitness paradigm in the first maze were more likely to find a solution to the second. These results suggest that populations of controllers adapted under novelty search are less evolvable compared to objective based search in the maze solving task.","PeriodicalId":432958,"journal":{"name":"2014 IEEE International Conference on Evolvable Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE International Conference on Evolvable Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICES.2014.7008731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

This research compares the efficacy of novelty versus objective based search for producing evolvable populations in the maze solving task. Populations of maze solving simulated robot controllers were evolved to solve a variety of different, relatively easy, mazes. This evolution took place using either novelty or objective-based search. Once a solution was found, the simulation environment was changed to one of a variety of more complex mazes. Here the population was evolved to find a solution to the new maze, once again with either novelty or objective based search. It was found that, regardless of whether the search in the second maze was directed by novelty or fitness, populations that had been evolved under a fitness paradigm in the first maze were more likely to find a solution to the second. These results suggest that populations of controllers adapted under novelty search are less evolvable compared to objective based search in the maze solving task.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
新奇搜索是如何进化的?
本研究比较了在迷宫解决任务中,新颖性与基于目标的搜索产生可进化种群的效率。迷宫求解模拟机器人控制器的种群进化,以解决各种不同的,相对容易,迷宫。这种进化是通过新奇或基于目标的搜索来实现的。一旦找到了解决方案,模拟环境就会变成各种更复杂的迷宫之一。在这里,种群进化为找到新迷宫的解决方案,同样是基于新奇或客观的搜索。研究发现,无论在第二个迷宫中寻找的是新颖性还是适应性,在第一个迷宫中以适应性范式进化的种群更有可能找到第二个迷宫的解决方案。这些结果表明,与基于目标搜索的迷宫解决任务相比,适应新颖性搜索的控制器群体的进化程度较低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Temperature management for heterogeneous multi-core FPGAs using adaptive evolutionary multi-objective approaches In-situ evolution of an antenna array with hardware fault recovery Sustainability assurance modeling for SRAM-based FPGA evolutionary self-repair Evolution-in-materio: A frequency classifier using materials How evolvable is novelty search?
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1