对进化分歧的惊奇探索
Surprise Search for Evolutionary Divergence
摘要:
受非常规发现的惊奇概念的启发,我们提出了一种通用的搜索算法,我们称之为惊奇搜索,这是一种新的进化发散搜索方法。惊喜搜索是基于发散搜索范式,并在进化搜索的原则内制造。该算法模仿自我惊讶的认知过程,并使进化搜索具有寻找偏离算法预期行为的解决方案的能力。预期解决方案的预测模型基于搜索位置的历史轨迹和关于搜索空间的本地信息。惊喜搜索在机器人迷宫导航任务中进行了广泛的测试:实验在四个编写的欺骗性迷宫和60个生成的迷宫中进行,并与基于目标的进化搜索和新奇搜索进行比较。本研究的主要发现表明,与其他两个搜索过程相比,惊喜搜索是有利的。特别是,它优于客观搜索,它是有效的新奇搜索在所有的任务检查。最重要的是,惊喜搜索是更快,平均而言,更强大的解决导航问题相比,任何其他算法检查。最后,我们的分析表明,惊喜搜索探索的行为空间更广泛,并产生更高的人口多样性相比,新奇的搜索。突击搜索与其他形式的发散搜索(如新奇搜索)的区别在于,它不是偏离先前和已知的解决方案,而是偏离所考虑领域中预测和未知的点。
英文摘要:
Inspired by the notion of surprise for unconventional discovery we introduce a general search algorithm we name surprise search as a new method of evolutionary divergent search. Surprise search is grounded in the divergent search paradigm and is fabricated within the principles of evolutionary search. The algorithm mimics the self-surprise cognitive process and equips evolutionary search with the ability to seek for solutions that deviate from the algorithm's expected behaviour. The predictive model of expected solutions is based on historical trails of where the search has been and local information about the search space. Surprise search is tested extensively in a robot maze navigation task: experiments are held in four authored deceptive mazes and in 60 generated mazes and compared against objective-based evolutionary search and novelty search. The key findings of this study reveal that surprise search is advantageous compared to the other two search processes. In particular, it outperforms objective search and it is as efficient as novelty search in all tasks examined. Most importantly, surprise search is faster, on average, and more robust in solving the navigation problem compared to any other algorithm examined. Finally, our analysis reveals that surprise search explores the behavioural space more extensively and yields higher population diversity compared to novelty search. What distinguishes surprise search from other forms of divergent search, such as the search for novelty, is its ability to diverge not from earlier and seen solutions but rather from predicted and unseen points in the domain considered.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。