Antje Strauß
email: antje.strauss@gipsa-lab.fr

Christophe Savariaux

Sonia Kandel

Jean-Luc Schwartz

Visual lip information supports auditory word segmentation

C'est la mare » V2: « C'est la mare » V1: « C'est l'amarre »

• Speech segmentation has been shown to depend on statistical learning of auditory regularities, e.g. transitional probabilities between syllables [1] and prosodic cues including fluctuations in intensity, F0, segment durations and various articulatory components [2,3]. • However, up to now benefits of visual prosodic cues for speech segmentation have only been investigated in artificial languages [4,5]. • We hypothesize that lip information are used in natural speech when word segmentation is difficult as for example in the case of liaisons in French.

The current data suggest that visual lip information could have an impact on word segmentation processes. This is particularly relevant for ambiguous utterances like the ones that embed liaisons in French.

1. Lip movements hyper-articulating the CV-segmentation (V2, e.g. "la mare", in opposition to the VC-segmentation V1, e.g. "l'amarre") increased decisions for the CV-segmentation in all audiovisual conditions compared to audio-only. 2. Contrary to our prediction, this response gain by lip information was the same even if acoustic cues were ambiguous.

Our data are in line with studies that show an influence of visual lip information when listening to speech. The results extend evidence showing the usage of lip information in contrastive prosody [START_REF] Dohen | [END_REF], during multi-stable speech perception [8], and to trigger lexical access [9]. Thus, visual speech does not only provide segmental but also suprasegmental and prosodic cues which enable the perceiver to successfully segment words from a continuous speech stream. C. Participants cannot distinguish between A2 and AAM in 2-syllabic words (d' is not different from zero). D. When hearing ambiguous stimuli, the response bias to press R2 is higher than to press R1. • 17 French sentences were created consisting of the carrier phrase "C'est" [engl. "That is"] followed by a determiner and a noun that allowed two possible readings either with liaison (e.g., "l'amarre" [the rope] (A1)) or without liaison (e.g., "la mare" [the pond] (A2)).

• The speaker was instructed to produce 10 auditorily hyperarticulated repetitions of each possible reading (A1, A2) and 10 ambiguous utterances (AAM).

• Audiovisual stimuli were recorded using a PAL camera (SONY HDR-XR500E) with a sampling rate of 25 images per sec and an AKG (C-100S) microphone for the audio track. • Lips were colored in blue to be able to apply a chromakey on each image leaving only lip contours. Lip parameters (width, height, surface) were extracted by using the Tacle software developed at Gipsa [START_REF] Lallouache | Proceedings XVIIIèmes Journées d'études sur la Parole[END_REF].

• Afterwards, the speaker was listening to his recordings while producing lip movements in synchrony: 5 times visually hyper-articulating each possible reading (V1,V2).

Figure 1 :

 1 Figure 1: AV recordings from 17 French sentences. Sentences were spoken either with accent on the 1st or 2nd vowel of interest such that intensity/F0 and lip aperture are higher on the emphasized compared to unemphasized vowels.

Figure 4 :

 4 Figure 4: A. Compared to audio-only (Vno), R2-responses are reduced if V1-lip movements are shown and increased if V2-lip movements are shown independent of the audio-condition. B. Extracted R2-response gain.

Figure 3 :

 3 Figure 3: Analysis of stimuli characterisitcs separated for 2-and 3-or 4-syllabic words. A ratio between the two vowels of interest (difference divided by sum) is

Figure 5 .Figure 6 .

 56 Figure 5. A. Revision of the ambiguous condition such that F0 of AAM really falls in-between A1 and A2. R2-responses should be around 50% B. Is the usage of visual prosodic cues weaker if lip movements are not hyper-but only normally articulating? Is the AV-gain only present when information are congruent?

  4-syllabic wordsR1 to A1 vs. AAM R2 to A2 vs. AAM

/ѕ/ /ε/ /а/ /


Thomas Breton
email: thomas.breton@irit.fr

Yves Duthen
email: yves.duthen@irit.fr

A Model for Virtual Reconfigurable Modular Robots

This paper presents a model for virtual reconfigurable modular robots in order to evolve artificial creatures, able of selfadaptation to the environment as well as good adjustment to various given tasks. For this purpose, a simulator has been entirely developed with the assistance of a physics engine to represent force activities. One of the most crucial points in modular robot construction is the choice of module type, complexity and diversity. We took interest on existing elements to obtain realistic results but assume simplifications to focus on our main goal that is algorithmic.

Introduction

Self-reconfiguring modular robots are one of the grand challenges of robotics [START_REF] Yim | Modular self-reconfigurable robot systems: Challenges and opportunities for the future[END_REF]. That points out the difficulty of such process creation at each step of development, as well in hardware as in software. First and foremost, a simulation is essential to test feasibility and evaluate performance of such modular robots, all the more so since only a few of virtual creatures have been brought to the real world.

To evolve these modular robots, rules have been defined to represent and reconfigure shapes as well as internal controller. This last one must be able to accomplish various different tasks and not only motion planning. As our main goal is to transform external structures, this objective has to be divided in a sequence of simpler tasks. Neural networks suit well these requirements and are relatively insensitive to noise; one will be used in our model. A genetic algorithm then trains the controller to emerge an adapted behavior. Afterwards, an example of a moving creature is given to show the learning ability of a modular robot with only basic oscillatory displacements, evolving together shape and motion.

As our goal is to evolve virtual modular robots, we focus on the algorithmic standpoint. That allows us to abstract from technical constraints and provides more liberty in conception. In fact, not only purely mechanical problems have to be solved but also energy management and communication methods. We propose here a model to accomplish different tasks such as motion planning, object displacement, and structure reconfiguration; evolving a controller (a neural network) by the mean of a genetic algorithm.

It is true that any consideration taken in modular robotic representation determines fundamentally the later possible description and evolution strategy. So we first present a brief modular robotics review, showing also the wide extension of this domain. Then we describe our objectives, the corresponding needs and technical concerns before detailing the whole model and its implementation. Afterwards a simplified experience is conduct and the results discussed.

Related Work

Historically, the first modular robots appear in the last 1980s with CEBOT [START_REF] Fukuda | Self organizing robots based on cell structures-cebot[END_REF] and several models have been built since then. CEBOT units are the very first independent modules equipped with a processor able to communicate with other ones, approach, attach and separate each other. Almost all modular robots are composed of several identical elementary components, fixed dynamically or statically. Conventional robots have often few degrees of freedom and can success to a very few specific tasks, whereas modular ones are more suited to adapt themselves to their environment and may achieve numerous problems by the means of evolutionary algorithms. Modules that compose these creatures have also a low degree of freedom but their combination exhibits complex behaviors and allows adaptation in various situations. They can be classified in several different classes: mobile (CEBOT), stochastic, lattice, chain, and hybrid. Stochastic modular robots are placed in a specified 2D or 3D environment (with other modules or/and in a substrate) and move randomly. They create structure by bonding to the substrate and/or to another element, evolving for instance in an oscillatory flow [START_REF] White | Three dimensional stochastic reconfiguration of modular robots[END_REF].

Lattice systems arrange modules in a two or three dimensional grid structure, simplifying greatly reconfiguration problems as the scene is a discrete world. ATRON modules (Figure 1), developed by Stoy et al. [START_REF] Ostergaard | Design of the atron lattice-based self-reconfigurable robot[END_REF] are some of the most popular ones. Each module can rotate some multiple of 90 degrees in the lattice structure. On the right picture, we can see a car-like structure; this ability is an improvement of lattice based system, the system allowing continuous rotation of a module (rubber bands have been placed on the outmost of the hemisphere wheels). Furthermore, the connection mechanism is particularly robust that makes a reliable lattice system with some of the chain system flexibility. In a chain system, robots are composed of groups of connected serial chains (with possible internal loops). The modules move in a continuous space that makes many tasks such as motion planning, reconfiguration, and collision detection complex to achieve but it seems promising to future research. An example is presented above (Figure 2) from [START_REF] Zykov | Molecubes extended: Diversifying capabilities of open-source modular robotics[END_REF]. Other recent works have focused on self reconfiguration of modular robots Roombots (molecube-like with one degree of freedom more by a combination of two elementary modules) by the mean of lo-cal communication and virtual force field [START_REF] Spröwitz | Roombots-Towards Decentralized Reconfiguration with Self-Reconfiguring Modular Robotic Metamodules[END_REF]. Experiments were based on handmade configuration goals in a random starting position. Several strategies have been tested and some managed to achieve the reconfiguration without any collision. Hybrid systems can be presented as a combination of previous ones. A great example is given by M-TRAN [START_REF] Yoshida | Self-reconfigurable modular robots harware and software development in aist[END_REF] modular robots (Figure 3). These modules can behave as lattice as well as chain type, allowing combining advantages of each other. Easy reconfiguration and large possibility of freedom for many tasks like locomotion. Nevertheless, motion planning for chain or hybrid modular robots is still a challenge [START_REF] Teo | Darwin + robots = evolutionary robotics: Challenges in automatic robot synthesis[END_REF]. Another challenging domain relative to our main goal is the external structure reconfiguration. Some recent works focused on this particular problem on truss structure reconfiguration (Figure 4); on one hand in a theoretical (algorithmic) sense [START_REF] Yun | Optimal distributed planning for self assembly of modular manipulators[END_REF][START_REF] Lobo | Reconfiguration algorithms for robotically manipulatable structures[END_REF], on the other hand in a practical (constructible robots and truss elements) meaning [START_REF] Hjelle | A robotically reconfigurable truss[END_REF]. The truss is represented by a tree structure and structure modification rules are defined. From a given truss configuration, the goal is to find a realizable elementary reconfiguration operation sequence to tend to a given functional goal. A genetic algorithm evolves this sequence and results have already proven physical feasibility.

Simulation

In order to develop virtual reconfigurable modular robots, our simulator has to achieve several problems. First, we attach a lot of importance to the fact that the resulting simulation must be as realistic as possible. As for, a physic model is used, taking into account gravity, static and kinetic friction, and force activities. Another important point is that evolutionary algorithms are large computer-time consumers and, at least in a first time, we will try to evolve creatures on a single computer, so the application has to be optimized in this way while preserving reliability. Furthermore, the simulator has to accomplish these tasks:

• Robot description: at each evolution step of each robot, a descriptor should define the creature shape as well as his internal controller.

• Creature evolution: a modular robot must be able to change his shape and his internal controller by the mean of different rules.

• Simulation: each robot have to be robustly simulate in a 3D space in a given trial period, no rendering is needed at this stage.

• Creature evaluation: to permit evolution, each creature is evaluated after simulation. A fitness function has to be created for each given task.

• Visual rendering: once a creature has been evolved the results have to be displayed in a three dimensional environment.

Finally, the simulator must be able to evolve a large population of creatures and allow diversity in modules. Relatively to existing open source simulators, if some are available, none fit completely our needs, even if a current development looks interesting in this way: SYMBRION and REPLICA-TOR [START_REF] Winkler | Symbricator3d -a distributed simulation environment for modular robots[END_REF]. Some projects already successfully used them [START_REF] Schmickl | Major feedbacks that support artificial evolution in multimodular robotics[END_REF][START_REF] Hamann | Artificial hormone reaction networks: Towards higher evolvability in evolutionary multi-modular robotics[END_REF]. Another one, named USSR (Unified Simulator for Self-Reconfigurable Robots) and written in JAVA permits to simulate different kinds of modular robots: ATRON [START_REF] Lund | Selfreconfigurable robots with atron modules[END_REF], Odin [START_REF] Garcia | A self-reconfigurable communication network for modular robots[END_REF][START_REF] Lyder | Representation and shape estimation of odin, a parallel under-actuated modular robot[END_REF], and M-TRAN [START_REF] Kamimura | Automatic locomotion design and experiments for a modular robotic system[END_REF]. It was used to simulate the combination between an ATRON and an Odin modular robots in virtual then in real world [START_REF] Bordignon | Towards Interactive Programming of Modular Robots[END_REF]. However, developing our own platform gives us a lot of possibilities in evolution and optimization.

Technical considerations

Regarding to physics engine, its a crucial element for the simulation in terms of stability, reliability, and robustness. Some are available but they greatly differ in possibilities and performances [START_REF] Boeing | Evaluation of real-time physics simulation systems[END_REF]. Most popular are Open Dynamics Engine (ODE), Bullet, Nvidia PhysX, and Havok. For instance, ODE doesnt propose dynamic convex mesh (useful for collision detection), Bullet doesnt manage fixed joints (this can be done by object combination) nor kinetic friction and Havok is a commercial solution and so not attractive for our case. Tests have been realized with the first three engines and results show best performance in time computation for Nvidia Physx, just ahead Bullet.

Additionally, PhysX includes all essential functionalities and is currently the first used engine in game development. By now, the rigid bodies calculation is done by the CPUs but Nvidia announced its GPU computation in the next SDK (Software Development Kit) version (to appear this year). It should accelerate significantly performances with a dedicated adapted graphic card and let the CPUs free of charge for other tasks. However, new features are only available for Windows (XP, Vista, Seven) and no more support is given to Linux older versions from nearly two years.

Like Nvidia PhysX physics engine, our simulator is written in C++, which allows an excellent global performance and many possibilities of optimization. To keep physics engine version up to date we decide to write the code under Windows Seven rather than Linux. Nevertheless, the code is relatively easy to transfer to another operating system like Linux; main changes rely on multithreading functions. So if complex evolution strategy requires long time computation, we will transfer the code to Linux and test algorithms on a grid computing.

Model Implementation

From our main virtual modular robot goal, we will detail our implementation selection about module, and controller choices, then representation, evolution, and evaluation methods.

Global objective

The overall goal of this project is to transform external structures by virtual autonomous reconfigurable modular robots. To realize this task many points have to be considered. First the main representation of a robot is a hybrid representation able to solve complex tasks, as described as necessary in the literature [START_REF] Duro | On the need of hybrid intelligent systems in modular and multi robotics[END_REF]. Elementary modules can be fixed together to form parts able to achieve different particularly tasks, like motion or object displacement. These parts can then be attached or detached dynamically to form a more complex entity, a robot with a more global goal, such as structure reconfiguration.

Module types

One of crucial point in modular robotics development is the choice of elementary module types. In most cases modular robots are composed of only one identical type with a few degrees of freedom, linked up according to a chain or a lattice structure. It is true that evolution complexity grows up with module diversity. Our model is inspired by existing elements called molecubes (Figure 5) which have been well experimented in virtual and real life [START_REF] Zykov | Molecubes extended: Diversifying capabilities of open-source modular robotics[END_REF]. But as our goal is to test virtual complex tasks we allow ourselves some liberty in their manipulation. Molecube is a cube divided in two parts, rotating around an axis defined by to opposite corners. It as then one degree of freedom and can be fixed to another module. Originally, the structure model was a chain type where a module can fix dynamically only two other elements (more if handconnected), but we overcome this feature in our model, introducing a way to attach up four modules. To represent such an arrangement, we will use a tree structure, allowing complex configurations and avoiding loop structures. Other parts have also already been manufactured, such as wheels, grippers, digital cameras, batteries and passive modules. By now, our model only makes use of standard molecubes but is planed to accept more types, especially passive modules. Another simplification has been done relatively to module communication: as we dont consider technical specifications, we assume that all modules can communicate directly with no latency. In a same way, energy management isnt part of our preoccupations.

Internal controller

Evolving robot behavior is a real challenge in modular robotics. To carry out this achievement one can use different approaches: stimulus-response rules, neural networks or state machines [START_REF] Sofge | Challenges and opportunities of evolutionary robotics[END_REF]. For stimulus-response, continuous inputs have to be transformed in discrete outputs and it is really hard to determine transitional goals, even for simple tasks. State machines are more suited for discrete charge. Furthermore, both two approaches are very sensitive to noise, whereas neural networks offer a good alternative to each of these problems; all the more so since a large variety of input signals helps to evolve such a system, which is our case as we will see.

Computer modeling with a physics engine bring over many advantages and opportunities with few computational effort. In our creatures, a lot of internal sensors are directly provided by the physics engine and some external ones are easily computable. First, each molecube module, as describe above, is composed of two halves with a rotation axis. At each step of a simulation, Nvidia PhysX engine allows the application to get back various data comparable to internal sensors such as module position, orientation, its linear and angular velocity, torque forces and for the rotation axis the motor state, its velocity and angle of rotation. Other elements can be easily retrieved like global mass, global position, and external sensors can be thought, such as distance detector, infrared sensor, digital camera, etc. These data are then bringing in the neural network as inputs which will compute creature comportment by the means of its outputs, applying forces and angular velocity to module rotational axes. After all, the evolutionary algorithm will be ready to train the neural network.

Internal representation

At this stage, robot parts, as described above, can be fully considered as entire robots and defined by a set of elementary modules in a tree structure. They are encoded in a gene according to a simple representation with a very low memory cost but which exactly describes creature shape. First, tree structure is a depth-first one and each elementary element is encoded on two bytes (16 bits) as follow:

• Bits 12 -15: elementary module type.

• Bits 8 -11: orientation.

• Bits 6 -7: currently unused.

• Bits 0 -5: next elements.

Thus the model accepts up to sixteen elementary module types (molecube, passive module, etc.) and gives an orientation: for instance molecube can have four possible ones, according to its rotation axis direction. Next elements stand for "is linked to another module in a given direction" (from 0 to 5: front, back, up, down, left, and right). This representation permits short gene length (fixed in our model for practical and efficiency reasons). Many useful functions have been directly encoded in the depth-first tree structure, nearly all recursive but fast enough for relatively small trees. Then a robot can be fully describe and functional with a gene, a spatial position and one or more controller for a given task.

Shape evolution

In order to evolve different module configurations, several structure reconfigurations have been built, well suited to tree structures:

• Add branch: add a random branch of another creature to a random free place in the tree (cross-over).

• Remove branch: remove a random branch (mutation).

• Swap branch: swap two random branches from two creatures (cross-over) or swap two random branches of the same creature (mutation).

• Add leaf: add leaf at a random free place (mutation).

• Remove leaf: remove a random leaf of the creature (mutation).

These rules are not always applicable; the number of modules is limited (lower and upper), a sub-branch cannot swap with one of its parent, and some configurations cant be built (modules intersection), so achievability tests have to be executed for each transformation. Once mutations and crossover have been done, the simulator can run simulations to evolve a controller.

Evaluation

Simulations are run (in parallel for multi-core computers) for a given period of time (without the need of a visual representation), after what an evaluation is given to each creature of the population, according to the given task. A fitness function takes charge to grade resulting robots, depending of its performance. Then, as commonly for genetic algorithms, creatures are classified and bests ones reused for mutation and cross-over for next generations. The simulator stops when a given number of generations and/or when a valuable fitness grade is reached. Then results are saved. After all, a visualizing tool has been built in OpenGL to ensure rendering of evolved creatures.

First Experiments

As the project is still in development and the neural network not yet implemented, very first tests have been conducted with some simplifications in order to validate other functionalities, physics engine use and in a larger domain, feasibility. In a first stage, we tried to evolve creatures with basic oscillatory movements, and without any sensor (only collisions are managed by the physics engine). The controller is then distributed on all modules (which are here independents) and some major modifications have then been realized in the model presented above:

• If the gene tree structure is preserved, a motion directive has been added to each module (encoded in gene).

• For all mutations and cross-over, the motion directives are copied out.

• Two move mutations have been added:

-Change move: randomly modify motion directive in one or more module. -Smooth change move: randomly lightly modify motion directive in one or more module.

Experimentation

One of our goals was to validate this approach with very simple movements, no bias and realized on a single computer. Virtual modular robots are randomly built in a first stage, then simulated and evaluated by a fitness function. The simulation positions virtual creature on the ground and starts moving for fifteen (simulated) seconds after five (simulated) seconds of resting (to avoid falling displacements of unstable robots). Then shape and motion directives are co-evolved by mutations and cross-over of best individuals.

The motion directive is a given by the following formula:

v = 2 i=1 α i . sin ( ω i .π.t τ + ϕ i ) (1)
Where:

• v is the velocity target applied to the rotational axis,

• α i the amplitude,

• ω i the frequency,

• t the time,

• τ a regulation factor,

• ϕ i the phase.

And the fitness function rewards creatures that move forward, with the less side deviation:

Φ = y -y i + 0.5.|x i -x| (2)
Where:

• Φ is the fitness value (cube size is one unit),

• x, y the final x, y centre of mass robot position,

• x i , y i the initial x, y centre of mass robot position (after resting).

Results

Some other parameters have to be fixed, such as limits of forces, number of modular elements (here from eight to thirty), cross-over and mutation rates, etc. Tests have been realized on a population of 1 024 modular robots (keeping 256 bests individuals at each step) on a single computer with an Intel core i7 processor @ 3 GHz (four cores with hyper threading technology, i.e. eight virtual cores).

From the 50 th generation (more than half an hour of computation), bests creatures act as well and after the 70 th one (about one hour of calculation) no significant improvement appears (Figure 8). A video of the best individual is available here: http://www.youtube.com/watch?v=J_ 0nBlmSFHs . However, purely random creature construction doesnt give any acceptable result in a same period of time.

We can first see that almost all best virtual creatures (Figure 6) have the lower number of elements (all in the lasts generations). It is due to two major reasons: on one hand, adding a module to a creature grows up motion directive search field significantly and then slows down convergence as same (large creatures easily deviate and are less graded than smallest ones). In the other hand, small creatures earn good graduation earlier than others, so big creatures are less and less retained for next generations.

We have also notice that the large number of parameters greatly influences convergence and its rate speed (Figure 7, Figure 9). They have here been hand-fixed with reasonably values, as describe below. For instance, a simplest sinus function gives some poorer results but keep some convergence and more sinus combination increases the search field too much and therefore decreases results quality. The resulting robot movement is in addition very sensitive to noise and light changes in a motion directive can greatly interfere on final progression. Incorporating it to mutation directives helps to obtain a swift convergence.

Technical implementation

These values are:

• The amplitude: from Then new genes are built from these ones with 30 % of cross-over and 45 % of mutation, dispatched as follow:

• Cross-over:

-25 % branch swapping (removes a branch and substitutes it by another creature one). -5 % add a branch (from another creature).

• Mutation:

-15 % change move (randomly change from one to three motion directives). -10 % smooth change move (randomly change lightly from one to three motion directives). -5 % add leaf -5 % remove leaf -5 % move branch (internal branch displacement) -5 % swap two branches (internally) Notice that if an operation is not achievable, it is replaced by a single random move directive modification.

Conclusion

In this paper we have presented a model for virtual reconfigurable modular robots, able to evolve virtual creatures in a modeled physical world. As the project is still in development we have implemented a simplified motion controller to test our virtual simulator. These very first results have shown a convergence with only basic motion directives and are then suitable enough to compare future ones with an evolved neural network controller, that greatly encourage us to pursue development in this way. Furthermore, directive movements are very sensitive to noise, a problem that neural network should reduce significantly.

Future Work

Current program expansion is a neural network encoding in order to achieve several tasks, from motion to structure reconfiguration. Virtual modular robot displacement could be placed in continuation of some older works with a new kind of evolution. In 1994, Karl Sims stepped across a new challenge, realizing virtual autonomous creatures able to learn dynamically motion planning [START_REF] Sims | Evolving virtual creatures[END_REF]. Some other works have then been achieve from with more sophisticated tasks, such as bloc pushing, stair climbing and skating [START_REF] Lassabe | A new step for evolving creatures[END_REF]. A review and a presentation can be found here [START_REF] Duthen | An introduction to the Bio-Logic of Artificial Creatures[END_REF]. Our project fits to these achievements but not in a similar approach: evolving virtual realistic modular robots by the mean of neural networks which should also consider collision control and be able to accomplish particular tasks like object displacement in a virtual world.

Figure 1 :

 1 Figure 1: Left: ATRON reconfiguring. Right: three types of seven modules arrangement.

Figure 2 :

 2 Figure 2: A chain type modular robot composed of molecubes and grippers.

Figure 3 :

 3 Figure 3: A six legs hybrid M-TRAN 9 modules robot.

Figure 4 :

 4 Figure 4: Model of robots reconfiguring a truss.

Figure 5 :

 5 Figure 5: An elementary module: molecube.

Figure 6 :

 6 Figure 6: eight modules moving robots. Second picture shows a two legs-like motion strategy.

  -4.0 to 4.0 (step 0.125) • The frequency: form -1.5 to 1.5 (step 0.125) • The time step is 1/60 second • The regulatory factor is 60 • The phase is inferior to π • The resulting angular velocity in absolute value is then inferior or equal to 8.0 ≈ 2.5.π rad/s At each generation, creatures are sorted by grade and 25 % of best individuals are kept with no modification.

Figure 7 :

 7 Figure 7: A ten modules moving robot, obtained after evolution, setting minimal module number to ten.

Figure 8 :

 8 Figure 8: Fitness evolution towards generations, 1024 creature population of eight modules minimum; 5 seconds resting, 15 seconds moving.

Figure 9 :

 9 Figure 9: Fitness evolution towards generations, 1024 creature population of ten modules minimum; 5 seconds resting, 15 seconds moving.