Introducing novelty search in evolutionary swarm robotics

12Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Novelty search is a recent and promising evolutionary technique. The main idea behind it is to reward novel solutions instead of progress towards a fixed goal, in order to avoid premature convergence and deception. In this paper, we use novelty search together with NEAT, to evolve neuro-controllers for a swarm of simulated robots that should perform an aggregation task. In the past, novelty search has been applied to single robot systems. We demonstrate that novelty search can be applied successfully to multirobot systems, and we discuss the challenges introduced when moving from a single robot setup to a multirobot setup. Our results show that novelty search can outperform the fitness-based evolution in swarm robotic systems, finding (i) a more diverse set of successful solutions to an aggregation task, (ii) solutions with higher fitness scores earlier in the evolutionary runs, and (iii) simpler solutions in terms of the topological complexity of the evolved neural networks. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Gomes, J., Urbano, P., & Christensen, A. L. (2012). Introducing novelty search in evolutionary swarm robotics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7461 LNCS, pp. 85–96). https://doi.org/10.1007/978-3-642-32650-9_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free