Great Minds Think Different: Preserving Cognitive Diversity in an Age of Gene Editing

It is likely that gene editing technologies will become viable in the current century. As scientists uncover the genetic contribution to personality traits and cognitive styles, parents will face hard choices. Some of these choices will involve trade‐offs from the standpoint of the individual's welfare, while others will involve trade‐offs between what is best for each and what is good for all. Although we think we should generally defer to the informed choices of parents about what kinds of children to create, we argue that decisions to manipulate polygenic psychological traits will be much more ethically complicated than choosing Mendelian traits like blood type. We end by defending the principle of regulatory parsimony, which holds that when legislation is necessary to prevent serious harms, we should aim for simple rules that apply to all, rather than micro‐managing parental choices that shape the traits of their children. While we focus on embryo selection and gene editing, our arguments apply to all powerful technologies which influence the development of children

Evolving collective behavior in an artificial ecology

Collective behavior refers to coordinated group motion, common to many animals. The dynamics of a group can be seen as a distributed model, each “animal” applying the same rule set. This study investigates the use of evolved sensory controllers to produce schooling behavior. A set of artificial creatures “live” in an artificial world with hazards and food. Each creature has a simple artificial neural network brain that controls movement in different situations. A chromosome encodes the network structure and weights, which may be combined using artificial evolution with another chromosome, if a creature should choose to mate. Prey and predators coevolve without an explicit fitness function for schooling to produce sophisticated, nondeterministic, behavior. The work highlights the role of species’ physiology in understanding behavior and the role of the environment in encouraging the development of sensory systems

Embodied Evolution in Collective Robotics: A Review

This paper provides an overview of evolutionary robotics techniques applied to on-line distributed evolution for robot collectives -- namely, embodied evolution. It provides a definition of embodied evolution as well as a thorough description of the underlying concepts and mechanisms. The paper also presents a comprehensive summary of research published in the field since its inception (1999-2017), providing various perspectives to identify the major trends. In particular, we identify a shift from considering embodied evolution as a parallel search method within small robot collectives (fewer than 10 robots) to embodied evolution as an on-line distributed learning method for designing collective behaviours in swarm-like collectives. The paper concludes with a discussion of applications and open questions, providing a milestone for past and an inspiration for future research.Comment: 23 pages, 1 figure, 1 tabl

Mammalian Brain As a Network of Networks

Acknowledgements AZ, SG and AL acknowledge support from the Russian Science Foundation (16-12-00077). Authors thank T. Kuznetsova for Fig. 6.Peer reviewedPublisher PD

Algorithms for Graph-Constrained Coalition Formation in the Real World

Coalition formation typically involves the coming together of multiple, heterogeneous, agents to achieve both their individual and collective goals. In this paper, we focus on a special case of coalition formation known as Graph-Constrained Coalition Formation (GCCF) whereby a network connecting the agents constrains the formation of coalitions. We focus on this type of problem given that in many real-world applications, agents may be connected by a communication network or only trust certain peers in their social network. We propose a novel representation of this problem based on the concept of edge contraction, which allows us to model the search space induced by the GCCF problem as a rooted tree. Then, we propose an anytime solution algorithm (CFSS), which is particularly efficient when applied to a general class of characteristic functions called $m+a$ functions. Moreover, we show how CFSS can be efficiently parallelised to solve GCCF using a non-redundant partition of the search space. We benchmark CFSS on both synthetic and realistic scenarios, using a real-world dataset consisting of the energy consumption of a large number of households in the UK. Our results show that, in the best case, the serial version of CFSS is 4 orders of magnitude faster than the state of the art, while the parallel version is 9.44 times faster than the serial version on a 12-core machine. Moreover, CFSS is the first approach to provide anytime approximate solutions with quality guarantees for very large systems of agents (i.e., with more than 2700 agents).Comment: Accepted for publication, cite as "in press