2018
DOI: 10.1007/978-3-030-00533-7_29
|View full text |Cite
|
Sign up to set email alerts
|

Embodied Evolution of Self-organised Aggregation by Cultural Propagation

Abstract: Probabilistic aggregation is a self-organised behaviour studied in swarm robotics. It aims at gathering a population of robots in the same place, in order to favour the execution of other more complex collective behaviours or tasks. However, probabilistic aggregation is extremely sensitive to experimental conditions, and thus requires specific parameter tuning for different conditions such as population size or density. To tackle this challenge, in this paper, we present a novel embodied evolution approach for… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
15
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
4
2

Relationship

4
2

Authors

Journals

citations
Cited by 9 publications
(15 citation statements)
references
References 31 publications
0
15
0
Order By: Relevance
“…For each experiment, we have three different conditions, in which we varied the swarm size (N). As aggregation performance are heavily influenced by swarm density (Cambier et al, 2018), in this paper we have decided to study scalability with respect to the swarm size by keeping the swarm density constant. Therefore, the diameter of the area as well as the diameters of the aggregation sites are varied in proportion to N. Table 1 reports a summary of all experimental conditions.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…For each experiment, we have three different conditions, in which we varied the swarm size (N). As aggregation performance are heavily influenced by swarm density (Cambier et al, 2018), in this paper we have decided to study scalability with respect to the swarm size by keeping the swarm density constant. Therefore, the diameter of the area as well as the diameters of the aggregation sites are varied in proportion to N. Table 1 reports a summary of all experimental conditions.…”
Section: Methodsmentioning
confidence: 99%
“…with b = 2.2. This function was also introduced in (Cambier et al, 2018). A robot that decides to leave the aggregation site based on P leave transitions from state S to state L. Both P stay and P leave are sampled every 20 time steps.…”
Section: The Robots' Controllermentioning
confidence: 99%
“…Each robot is controlled by a probabilistic finite state machine (PFSM, see also Figure 1a), similar to the one employed in [20,2,9,6]. The robots' controller is made of three states: Random Walk (RW), Stay (S), and Leave (L).…”
Section: Methodsmentioning
confidence: 99%
“…with n corresponding to the number of other robots currently stationing on the site that are perceived by the robot currently deciding whether to stop or not; and a = 0.6. This function was first introduced in [6]. It interpolates the probability table considered in classical studies such as [20,9].…”
Section: Methodsmentioning
confidence: 99%
“…Under specific density conditions, robots split into a controllable quantity of coalitions, each characterized by a different word used as identifier. In Cambier et al ( 2018 ), a further interaction was considered, as the words used within the MNG encode the parameter of the aggregation controller, directly impacting the quality of the self-organized aggregation behavior. As a matter of fact, in the MNG, words supported by highly-connected agents propagate more (Baronchelli, 2011 ).…”
Section: Language Games For Robot Swarmsmentioning
confidence: 99%