Fusing novelty and surprise for evolving robot morphologies
| Main Authors: | Daniele Gravina, Antonios Liapis, Georgios N. Yannakakis |
|---|---|
| Format: | Proceeding |
| Bahasa: | eng |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/1690029 |
| ctrlnum |
1690029 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><creator>Daniele Gravina</creator><creator>Antonios Liapis</creator><creator>Georgios N. Yannakakis</creator><date>2018-07-02</date><description>Traditional evolutionary algorithms tend to converge to a single good solution, which can limit their chance of discovering more diverse and creative outcomes. Divergent search, on the other hand, aims to counter convergence to local optima by avoiding selection pressure towards the objective. Forms of divergent search such as novelty or surprise search have proven to be beneficial for both the efficiency and the variety of the solutions obtained in deceptive tasks. Importantly for this paper, early results in maze navigation have shown that combining novelty and surprise search yields an even more effective search strategy due to their orthogonal nature. Motivated by the largely unexplored potential of coupling novelty and surprise as a search strategy, in this paper we investigate how fusing the two can affect the evolution of soft robot morphologies. We test the capacity of the combined search strategy against objective, novelty, and surprise search, by comparing their efficiency and robustness, and the variety of robots they evolve. Our key results demonstrate that novelty-surprise search is generally more efficient and robust across eight different resolutions. Further, surprise search explores the space of robot morphologies more broadly than any other algorithm examined.</description><identifier>https://zenodo.org/record/1690029</identifier><identifier>10.1145/3205455.3205503</identifier><identifier>oai:zenodo.org:1690029</identifier><language>eng</language><relation>info:eu-repo/grantAgreement/EC/H2020/731900/</relation><relation>info:eu-repo/grantAgreement/EC/FP7/630665/</relation><relation>url:https://zenodo.org/communities/envisageh2020</relation><rights>info:eu-repo/semantics/openAccess</rights><rights>https://creativecommons.org/licenses/by/4.0/legalcode</rights><subject>Surprise search</subject><subject>Evolutionary robotics</subject><subject>novelty search</subject><subject>divergent search</subject><subject>deception</subject><subject>evolutionary robotics</subject><subject>soft robots</subject><subject>CPPN</subject><subject>artificial life</subject><title>Fusing novelty and surprise for evolving robot morphologies</title><type>Journal:Proceeding</type><type>Journal:Proceeding</type><recordID>1690029</recordID></dc>
|
| language |
eng |
| format |
Journal:Proceeding Journal |
| author |
Daniele Gravina Antonios Liapis Georgios N. Yannakakis |
| title |
Fusing novelty and surprise for evolving robot morphologies |
| publishDate |
2018 |
| topic |
Surprise search Evolutionary robotics novelty search divergent search deception evolutionary robotics soft robots CPPN artificial life |
| url |
https://zenodo.org/record/1690029 |
| contents |
Traditional evolutionary algorithms tend to converge to a single good solution, which can limit their chance of discovering more diverse and creative outcomes. Divergent search, on the other hand, aims to counter convergence to local optima by avoiding selection pressure towards the objective. Forms of divergent search such as novelty or surprise search have proven to be beneficial for both the efficiency and the variety of the solutions obtained in deceptive tasks. Importantly for this paper, early results in maze navigation have shown that combining novelty and surprise search yields an even more effective search strategy due to their orthogonal nature. Motivated by the largely unexplored potential of coupling novelty and surprise as a search strategy, in this paper we investigate how fusing the two can affect the evolution of soft robot morphologies. We test the capacity of the combined search strategy against objective, novelty, and surprise search, by comparing their efficiency and robustness, and the variety of robots they evolve. Our key results demonstrate that novelty-surprise search is generally more efficient and robust across eight different resolutions. Further, surprise search explores the space of robot morphologies more broadly than any other algorithm examined. |
| id |
IOS16997.1690029 |
| institution |
DEFAULT |
| institution_type |
library:public library |
| library |
DEFAULT |
| collection |
DEFAULT |
| city |
DEFAULT |
| province |
DEFAULT |
| repoId |
IOS16997 |
| first_indexed |
2022-06-06T04:08:38Z |
| last_indexed |
2022-06-06T04:08:38Z |
| recordtype |
dc |
| merged_child_boolean |
1 |
| _version_ |
1739496116259389441 |
| score |
17.610533 |