<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="review-article" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Robot. AI</journal-id>
<journal-title>Frontiers in Robotics and AI</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Robot. AI</abbrev-journal-title>
<issn pub-type="epub">2296-9144</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1134841</article-id>
<article-id pub-id-type="doi">10.3389/frobt.2023.1134841</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Robotics and AI</subject>
<subj-group>
<subject>Review</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Recent trends in robot learning and evolution for swarm robotics</article-title>
<alt-title alt-title-type="left-running-head">Kuckling</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frobt.2023.1134841">10.3389/frobt.2023.1134841</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Kuckling</surname>
<given-names>Jonas</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/761476/overview"/>
</contrib>
</contrib-group>
<aff>
<institution>IRIDIA</institution>, <institution>Universit&#xe9; Libre de Bruxelles</institution>, <addr-line>Brussels</addr-line>, <country>Belgium</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/11640/overview">Phil Husbands</ext-link>, University of Sussex, United Kingdom</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/144353/overview">Larry Bull</ext-link>, University of the West of England, United Kingdom</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/134050/overview">Andrea Roli</ext-link>, University of Bologna, Italy</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Jonas Kuckling, <email>jonas.kuckling@ulb.be</email>
</corresp>
<fn fn-type="other">
<p>This article was submitted to Robot Learning and Evolution, a section of the journal Frontiers in Robotics and AI</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>24</day>
<month>04</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>10</volume>
<elocation-id>1134841</elocation-id>
<history>
<date date-type="received">
<day>30</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>21</day>
<month>03</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Kuckling.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Kuckling</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>Swarm robotics is a promising approach to control large groups of robots. However, designing the individual behavior of the robots so that a desired collective behavior emerges is still a major challenge. In recent years, many advances in the automatic design of control software for robot swarms have been made, thus making automatic design a promising tool to address this challenge. In this article, I highlight and discuss recent advances and trends in offline robot evolution, embodied evolution, and offline robot learning for swarm robotics. For each approach, I describe recent design methods of interest, and commonly encountered challenges. In addition to the review, I provide a perspective on recent trends and discuss how they might influence future research to help address the remaining challenges of designing robot swarms.</p>
</abstract>
<kwd-group>
<kwd>swarm robotics</kwd>
<kwd>robot evolution</kwd>
<kwd>robot learning</kwd>
<kwd>automatic design</kwd>
<kwd>neuro-evolution</kwd>
<kwd>automatic modular design</kwd>
<kwd>embodied evolution</kwd>
<kwd>imitation learning</kwd>
</kwd-group>
<contract-num rid="cn002">681872</contract-num>
<contract-sponsor id="cn001">Fonds De La Recherche Scientifique&#x2014;FNRS<named-content content-type="fundref-id">10.13039/501100002661</named-content>
</contract-sponsor>
<contract-sponsor id="cn002">European Research Council<named-content content-type="fundref-id">10.13039/501100000781</named-content>
</contract-sponsor>
<contract-sponsor id="cn003">F&#xe9;d&#xe9;ration Wallonie-Bruxelles<named-content content-type="fundref-id">10.13039/501100002910</named-content>
</contract-sponsor>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>Robot swarms are decentralized systems of relatively simple robots that only rely on local information to operate (<xref ref-type="bibr" rid="B6">Beni, 2005</xref>; <xref ref-type="bibr" rid="B107">&#x15e;ahin, 2005</xref>; <xref ref-type="bibr" rid="B17">Brambilla&#xa0;et&#xa0;al., 2013</xref>; <xref ref-type="bibr" rid="B29">Dorigo&#xa0;et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B54">Hamann, 2018</xref>). Like animal swarms in nature, a robot swarm is a group of robots that are efficient at performing tasks due to their cooperation. Robot swarms are multi-robot systems that exhibit some particular characteristics. They are decentralized and highly redundant. The high redundancy requires that there is no role in the swarm that can only be executed by a single robot<xref ref-type="fn" rid="fn1">
<sup>1</sup>
</xref>. Furthermore, in a robot swarm, there exists no single central point of control (neither internal nor external to the swarm), as a centralized point of control would be a single point of failure. Therefore, complex collective behaviors, such as task allocation, cannot be planned and orchestrated by an operator. Instead, the swarm is required to be self-organizing: the collective behavior of the swarm must emerge from the interactions between the individual robots. Additionally, the robots in the swarm are relatively simple (both in terms of hardware and software) with respect to the task they perform and have only local sensing and communication capabilities.</p>
<p>These inherent characteristics of robot swarms promote the development and implementation of robotic systems that exhibit desirable properties (<xref ref-type="bibr" rid="B107">&#x15e;ahin, 2005</xref>; <xref ref-type="bibr" rid="B29">Dorigo&#xa0;et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B54">Hamann, 2018</xref>). The self-organized nature of robot swarms promotes the design of flexible systems: the swarm can adapt to different and potentially changing environments. Additionally, the redundancy of the swarm facilitates the creation of systems that are fault tolerant. The failure of any individual robot (or sometimes significant portions of the swarm) will not prevent the swarm from achieving its task. Lastly, as robots only interact with their immediate neighboring peers, swarms are scalable systems. That is, the addition or removal of robots from the swarm does not significantly affect the performance of the swarm. Thanks to these properties, swarm robotics is considered a prominent approach to control large groups of autonomous robots (<xref ref-type="bibr" rid="B106">Rubenstein&#xa0;et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B128">Werfel&#xa0;et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B86">Mathews&#xa0;et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B40">Garattoni and Birattari, 2018</xref>; <xref ref-type="bibr" rid="B114">Slavkov&#xa0;et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B133">Yu&#xa0;et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B78">Li&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B130">Xie&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B31">Dorigo&#xa0;et&#xa0;al., 2020</xref>) and has been recently highlighted as one of the grand challenges of robotics research for the upcoming years (<xref ref-type="bibr" rid="B132">Yang&#xa0;et&#xa0;al., 2018</xref>). The use of robot swarms has been proposed for coordinating groups of robots in missions in dynamic or unknown environments, such as for space exploration, search and retrieval in disaster situations, or agricultural applications (<xref ref-type="bibr" rid="B24">Carrillo-Zapata&#xa0;et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B31">Dorigo&#xa0;et&#xa0;al., 2020</xref>). While no real-world application of swarm robotics exists yet, they are projected to be developed within the next ten to 15&#xa0;years (<xref ref-type="bibr" rid="B31">Dorigo&#xa0;et&#xa0;al., 2020</xref>).</p>
<p>Although the realization of robot swarms offers several advantages, their decentralized and self-organized nature makes them challenging to design. The requirements for the desired behavior of the swarm are usually expressed at the collective level, but it is not possible to program the swarm directly. Instead, the individual robots need to be programmed in such a way that the desired collective behavior arises. The problem is that each robot can only act based on the local information that it can perceive. When programming the robots, the designer needs to predict how the local behaviors and local interactions between robots will contribute to the emergence of the desired collective behavior.</p>
<p>Swarm robotics originated from the application of bio-inspired swarm intelligence principles to robotics (<xref ref-type="bibr" rid="B4">Beckers&#xa0;et&#xa0;al., 1994</xref>; <xref ref-type="bibr" rid="B6">Beni, 2005</xref>). Since then, swarm robotics has moved towards a more matured engineering discipline&#x2014;often referred to as swarm engineering (<xref ref-type="bibr" rid="B129">Winfield&#xa0;et&#xa0;al., 2005</xref>; <xref ref-type="bibr" rid="B17">Brambilla&#xa0;et&#xa0;al., 2013</xref>). Swarm engineering concerns the creation of arbitrary (not necessarily bio-inspired) collective behaviors for a robot swarm. The most common approach to the design of robot swarms is manual design: a human designer manually implements the control software for the robots. The designer can refine the control software through a trial-and-error process until they find the result satisfactory. While this design process often yields reasonably good results, it can be error-prone, costly, time-consuming and the quality of the control software strongly depends on the expertise of the designer. Furthermore, there is no guarantee that the performance will reach a satisfactory level within any reasonably available time budget. Several principled methods and design patterns for designing collective behaviors have been developed to overcome the limitations of pure trial-and-error design (<xref ref-type="bibr" rid="B52">Halloy&#xa0;et&#xa0;al., 2007</xref>; <xref ref-type="bibr" rid="B116">Soysal and &#x15e;ahin, 2007</xref>; <xref ref-type="bibr" rid="B55">Hamann and W&#xf6;rn, 2008</xref>; <xref ref-type="bibr" rid="B131">Yamins and Nagpal, 2008</xref>; <xref ref-type="bibr" rid="B7">Berman&#xa0;et&#xa0;al., 2009</xref>; <xref ref-type="bibr" rid="B69">Kazadi, 2009</xref>; <xref ref-type="bibr" rid="B101">Prorok&#xa0;et&#xa0;al., 2009</xref>; <xref ref-type="bibr" rid="B8">Berman&#xa0;et&#xa0;al., 2011</xref>; <xref ref-type="bibr" rid="B3">Beal&#xa0;et&#xa0;al., 2012</xref>; <xref ref-type="bibr" rid="B16">Brambilla&#xa0;et&#xa0;al., 2014</xref>; <xref ref-type="bibr" rid="B105">Reina&#xa0;et&#xa0;al., 2015</xref>; <xref ref-type="bibr" rid="B83">Lopes&#xa0;et&#xa0;al., 2016</xref>; <xref ref-type="bibr" rid="B99">Pinciroli and Beltrame, 2016</xref>; <xref ref-type="bibr" rid="B54">Hamann, 2018</xref>). Yet, these methods are restricted to specific assumptions and no generally applicable methodology has been proposed yet (<xref ref-type="bibr" rid="B17">Brambilla&#xa0;et&#xa0;al., 2013</xref>; <xref ref-type="bibr" rid="B37">Francesca and Birattari, 2016</xref>; <xref ref-type="bibr" rid="B109">Schranz&#xa0;et&#xa0;al., 2021</xref>).</p>
<p>An alternative to principled methods are (semi-)automatic design methods, which are built upon techniques such as robot evolution or robot learning. In semi-automatic design, a human designer remains in the loop during the development and optimization of the control software. That is, the human designer can observe and intervene in the design process, if necessary. For example, the human designer could observe the result found by the design process, change some parameters used in the algorithms to produce the control software and restart them with the new parameter values. The semi-automatic design terminates when the human designer is satisfied with the generated control software. In a research setting, semi-automatic design allows to assess the underlying feasibility of these design methods. However, in practice, semi-automatic design exhibits similar drawbacks as manual design. Namely, the quality of the generated control software depends on the human designer and their ability to steer the design process. In fully automatic design (<xref ref-type="bibr" rid="B10">Birattari&#xa0;et&#xa0;al., 2019</xref>), no human intervention beyond the mission specification is possible (<xref ref-type="bibr" rid="B12">Birattari&#xa0;et&#xa0;al., 2020</xref>). That is, the design process runs completely automatic until it terminates with the generation of an appropriate instance of control software. (Semi-)Automatic design methods can be further categorized into online and offline methods (<xref ref-type="bibr" rid="B19">Bredeche&#xa0;et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B12">Birattari&#xa0;et&#xa0;al., 2020</xref>). In online design, the design process is executed while the swarm performs its mission in the target environment, whereas in offline design, the design process is executed before the swarm is deployed to perform its mission.</p>
<p>In this work, I discuss recent advances in robot evolution and robot learning in the context of swarm robotics (see <xref ref-type="table" rid="T1">Tables&#xa0;1</xref>&#x2013;<xref ref-type="table" rid="T7">7</xref> for an index of the considered design methods). The work is organized as follows. In <xref ref-type="sec" rid="s2">Section&#xa0;2</xref>, I present offline design methods that rely on evolutionary algorithms or related techniques. In <xref ref-type="sec" rid="s3">Section&#xa0;3</xref>, I present online design methods. In <xref ref-type="sec" rid="s4">Section&#xa0;4</xref>, I present offline design methods based on robot learning. In <xref ref-type="sec" rid="s5">Section&#xa0;5</xref>, I provide a perspective on important open questions on the application of robot learning and evolution in swarm robotics.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Overview of selected neuro-evolutionary research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Network topology</th>
<th align="left">Algorithm</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B124">Trianni and Nolfi (2011)</xref>
</td>
<td align="left">3 s-bot robots</td>
<td align="left">Synchronization</td>
<td align="left">Single layer perceptron</td>
<td align="left">Evolutionary algorithm</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B42">Gauci&#xa0;et&#xa0;al. (2014a)</xref>
</td>
<td align="left">10 e-puck robots</td>
<td align="left">Aggregation</td>
<td align="left">Fully-recurrent network</td>
<td align="left">Classical Evolutionary Programming</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B34">Duarte&#xa0;et&#xa0;al. (2016)</xref>
</td>
<td align="left">5&#x2013;10 aquatic drones</td>
<td align="left">Homing,</td>
<td align="left">Feedforward network</td>
<td align="left">NEAT</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">dispersion,</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">clustering,</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">area monitoring</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B47">Gomes&#xa0;et&#xa0;al. (2019)</xref>
</td>
<td align="left">1 aerial, 1 ground robot</td>
<td align="left">Foraging</td>
<td align="left">Feedforward network</td>
<td align="left">NEAT</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B59">Hasselmann&#xa0;et&#xa0;al. (2021)</xref>
</td>
<td align="left">20 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">Single layer perceptron,</td>
<td align="left">CMA-ES, xNES, NEAT,</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">homing</td>
<td align="left">multi-layer perceptron</td>
<td align="left">evolutionary algorithm</td>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">foraging</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">sheltering</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">gate passing</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B126">van&#xa0;Diggelen&#xa0;et&#xa0;al. (2022)</xref>
</td>
<td align="left">14 ground robots</td>
<td align="left">Gradient following</td>
<td align="left">Fully connected reservoir</td>
<td align="left">Differential evolution</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left">network</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Overview of selected automatic modular design research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Architecture</th>
<th align="left">Modules</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B60">Hecker&#xa0;et&#xa0;al. (2012)</xref>
</td>
<td align="left">1&#x2013;3 ground robots</td>
<td align="left">Foraging</td>
<td align="left">Finite-state machine</td>
<td align="left">Manually implemented</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B35">Duarte&#xa0;et&#xa0;al. (2014)</xref>
</td>
<td align="left">50 aquatic drones</td>
<td align="left">Patrolling</td>
<td align="left">Finite-state machine</td>
<td align="left">Evolved continuous-time</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left">recurrent network</td>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B38">Francesca&#xa0;et&#xa0;al. (2014)</xref>
</td>
<td align="left">20 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">Finite-state machine</td>
<td align="left">Manually implemented</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">foraging</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B36">Ferrante&#xa0;et&#xa0;al. (2015)</xref>
</td>
<td align="left">4 foot-bot robots</td>
<td align="left">Foraging</td>
<td align="left">Rule set</td>
<td align="left">Manually implemented</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B65">Jones&#xa0;et&#xa0;al. (2018)</xref>
</td>
<td align="left">25 kilobot robots</td>
<td align="left">Foraging</td>
<td align="left">Behavior tree</td>
<td align="left">Manually implemented</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B90">Neupane and Goodrich (2019)</xref>
</td>
<td align="left"/>
<td align="left">Foraging,</td>
<td align="left">Behavior tree</td>
<td align="left">Manually implemented</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">co-op. transport,</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">nest maintenance</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B81">Ligot&#xa0;et&#xa0;al. (2020a)</xref>
</td>
<td align="left">20 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">Finite-state machine</td>
<td align="left">Evolved feedforward</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">foraging</td>
<td align="left"/>
<td align="left">networks</td>
<td align="left"/>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Overview of selected novelty search research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B50">Gomes&#xa0;et&#xa0;al. (2013)</xref>
</td>
<td align="left">5&#x2013;7 e-puck robots</td>
<td align="left">Aggregation, resource sharing</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B48">Gomes&#xa0;et&#xa0;al. (2017)</xref>
</td>
<td align="left">3&#x2013;8 ground robots</td>
<td align="left">Predator-prey, herding,</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">cooperative foraging</td>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B46">Gomes and Christensen (2018)</xref>
</td>
<td align="left">5&#x2013;10 ground robots</td>
<td align="left">Aggregation, clustering, coverage,</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">border coverage, dispersion,</td>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">phototaxis, flocking</td>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B58">Hasselmann&#xa0;et&#xa0;al. (2023)</xref>
</td>
<td align="left">20 e-puck robots</td>
<td align="left">Foraging, aggregation, sheltering</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Overview of selected other evolution-based research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Approach</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B53">Hamann (2014)</xref>
</td>
<td align="left">20 particles</td>
<td align="left">Collective motion</td>
<td align="left">Minimizing surprise</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B43">Gauci&#xa0;et&#xa0;al. (2014b)</xref>
</td>
<td align="left">5&#x2013;50 e-puck robots</td>
<td align="left">Clustering</td>
<td align="left">Computation-free control</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B123">Trianni and L&#xf3;pez-Ib&#xe1;&#xf1;ez (2015)</xref>
</td>
<td align="left">6&#x2013;10 foot-bot robots</td>
<td align="left">Flocking,</td>
<td align="left">Multi-objective optimization</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">collaboration</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B68">Kaiser and Hamann (2019)</xref>
</td>
<td align="left">100 grid-world agents</td>
<td align="left">Collective motion</td>
<td align="left">Minimizing surprise</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>Overview of selected embodied evolution research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Algorithm</th>
<th align="left">Controller update</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B9">Bianco and Nolfi (2004)</xref>
</td>
<td align="left">64 s-bot robots</td>
<td align="left">Self-assembly</td>
<td align="left">Not identified</td>
<td align="left">Encounter, time-out</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B100">Prieto&#xa0;et&#xa0;al. (2010)</xref>
</td>
<td align="left">8 e-puck robots</td>
<td align="left">Cleaning</td>
<td align="left">r-ASiCo</td>
<td align="left">Energy</td>
<td align="left"/>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B20">Bredeche&#xa0;et&#xa0;al. (2012)</xref>
</td>
<td align="left">9&#x2013;100 e-puck robots</td>
<td align="left">Foraging</td>
<td align="left">mEDEA</td>
<td align="left">Energy, time-out</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B113">Silva&#xa0;et&#xa0;al. (2015)</xref>
</td>
<td align="left">5 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">odNEAT</td>
<td align="left">Energy</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">phototaxis,</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">collective motion</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B66">Jones&#xa0;et&#xa0;al. (2019)</xref>
</td>
<td align="left">9 e-puck robots</td>
<td align="left">Collective transport</td>
<td align="left">Parallel island model</td>
<td align="left">Time-out</td>
<td align="left"/>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left">distributed evolution</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B22">Cambier&#xa0;et&#xa0;al. (2021)</xref>
</td>
<td align="left">25&#x2013;200 kilobot robots</td>
<td align="left">Aggregation</td>
<td align="left">Cultural evolution</td>
<td align="left">Encounter</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T6" position="float">
<label>TABLE 6</label>
<caption>
<p>Overview of selected multi-agent reinforcement learning research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Algorithm</th>
<th align="left">State-space</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B84">Matari&#x107; (1997)</xref>
</td>
<td align="left">4 IS Robotics R2 robots</td>
<td align="left">Foraging</td>
<td align="left">Q-learning</td>
<td align="left">Individual</td>
<td align="left"/>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B63">H&#xfc;ttenrauch&#xa0;et&#xa0;al. (2019)</xref>
</td>
<td align="left">2&#x2013;10 ground robots</td>
<td align="left">Rendez-vous,</td>
<td align="left">Trust Region Policy Optimization</td>
<td align="left">Individual</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">predator-prey</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B13">Bloom&#xa0;et&#xa0;al. (2022)</xref>
</td>
<td align="left">4&#x2013;8 foot-bot robots</td>
<td align="left">Collective transport</td>
<td align="left">ADAM</td>
<td align="left">Individual</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap id="T7" position="float">
<label>TABLE 7</label>
<caption>
<p>Overview of selected imitation learning research in swarm robotics.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">Publication</th>
<th align="left">Swarm composition</th>
<th align="left">Mission</th>
<th align="left">Algorithm</th>
<th align="left">Demonstration</th>
<th align="center">Sim.</th>
<th align="center">Real.</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">
<xref ref-type="bibr" rid="B79">Li&#xa0;et&#xa0;al. (2016)</xref>
</td>
<td align="left">5&#x2013;11 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">Turing learning</td>
<td align="left">Motion trajectories</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">object clustering</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B115">&#x160;o&#x161;i&#x107;&#xa0;et&#xa0;al. (2017)</xref>
</td>
<td align="left">200 particles</td>
<td align="left">Synchronization</td>
<td align="left">Inverse reinforcement learning</td>
<td align="left">Motion trajectories</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B2">Alharthi&#xa0;et&#xa0;al. (2022)</xref>
</td>
<td align="left">20 ground robots</td>
<td align="left">Not identified</td>
<td align="left">Behavior cloning</td>
<td align="left">Video recordings</td>
<td align="center">&#x2022;</td>
<td align="left"/>
</tr>
<tr>
<td align="left">
<xref ref-type="bibr" rid="B44">Gharbi&#xa0;et&#xa0;al. (2023)</xref>
</td>
<td align="left">20 e-puck robots</td>
<td align="left">Aggregation,</td>
<td align="left">Apprenticeship learning</td>
<td align="left">Robot positions</td>
<td align="center">&#x2022;</td>
<td align="center">&#x2022;</td>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">dispersion,</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
<tr>
<td align="left"/>
<td align="left"/>
<td align="left">sheltering</td>
<td align="left"/>
<td align="left"/>
<td align="left"/>
<td align="left"/>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2">
<title>2 Robot evolution</title>
<p>The application of evolutionary robotics principles (<xref ref-type="bibr" rid="B62">Husbands and Harvey, 1992</xref>; <xref ref-type="bibr" rid="B92">Nolfi and Floreano, 2000</xref>) to swarm robotics is called <italic>evolutionary swarm robotics</italic> (<xref ref-type="bibr" rid="B121">Trianni, 2008</xref>; <xref ref-type="bibr" rid="B91">Nolfi, 2021</xref>). In evolutionary swarm robotics, the control software of the robots is generated through an artificial evolutionary process. Unless otherwise specified, the same generated control software is uploaded to each robot to be executed individually. The evolutionary process optimizes instances of control software with respect to a mission-specific <italic>objective function</italic>, often also called fitness function. The objective function is used to assess the quality of instances of control software, and in a way, provides selection pressure to direct the optimization process. Poorly performing instances are discarded and the well performing ones are <italic>selected</italic> to generate new instances through <italic>recombination</italic> and <italic>mutation</italic>. The methods presented in this section are automatic offline design methods. That is, methods in which the design process is executed in a centralized manner using simulations and before the robots are deployed. For design methods that run the evolutionary process directly on the robots, see <xref ref-type="sec" rid="s3">Section&#xa0;3</xref>.</p>
<p>In the context of swarm robotics, robot evolution is the most studied automatic design approach. Indeed, evolutionary swarm robotics has been used to create control software for robot swarms in a wide variety of mission such as foraging, collective transport, or pattern formation (<xref ref-type="bibr" rid="B17">Brambilla&#xa0;et&#xa0;al., 2013</xref>; <xref ref-type="bibr" rid="B110">Schranz&#xa0;et&#xa0;al., 2020</xref>). Traditionally, evolutionary swarm robotics has relied on <italic>neuro-evolution</italic>&#x2014;the control software in the form of an artificial neural network is optimized using a centralized evolutionary algorithm (see Section&#xa0;2.1). Other related approaches include <italic>automatic modular design</italic> (see Section&#xa0;2.2) and <italic>novelty-search-based design</italic> (see Section&#xa0;2.3). In automatic modular design, the control software is composed of modules that are assembled into more complex control architectures, such as finite-state machines or behavior trees. In novelty-search-based design methods, the selection pressure does not arise from the mission-specific objective function, but rather from a metric of behavioral novelty. While evolutionary swarm robotics design methods have demonstrated promising results in the past, they still face some important challenges that remain unsolved: notably, the generation of control software that is robust to the reality gap and the engineering of appropriate objective functions that can produce a desired collective behavior.</p>
<p>
<xref ref-type="bibr" rid="B125">Trianni&#xa0;et&#xa0;al. (2014)</xref> and <xref ref-type="bibr" rid="B37">Francesca and Birattari (2016)</xref> provide overviews of robot evolution in the context of swarm robotics. For reviews of evolutionary robotics in the single-robot case, see <xref ref-type="bibr" rid="B28">Doncieux&#xa0;et&#xa0;al. (2011)</xref>, <xref ref-type="bibr" rid="B14">Bongard (2013)</xref>, <xref ref-type="bibr" rid="B120">Trianni (2014)</xref>, <xref ref-type="bibr" rid="B27">Doncieux&#xa0;et&#xa0;al. (2015)</xref>, and <xref ref-type="bibr" rid="B112">Silva&#xa0;et&#xa0;al. (2016)</xref>.</p>
<sec id="s2-1">
<title>2.1 Neuro-evolution</title>
<boxed-text id="dBox1">
<p>
<italic>Neuro-evolution</italic>: Robots are controlled by an artificial neural network that maps sensor inputs to actuator outputs. The weights of the neural network, and possibly its topology, are optimized using an evolutionary algorithm with regard to a mission-specific objective function. The design process results in a single well-performing instance of control software.</p>
</boxed-text>
<p>Neuro-evolution is one of the earliest automatic design methods in swarm robotics (<xref ref-type="bibr" rid="B32">Dorigo&#xa0;et&#xa0;al., 2003</xref>; <xref ref-type="bibr" rid="B103">Quinn&#xa0;et&#xa0;al., 2003</xref>; <xref ref-type="bibr" rid="B122">Trianni&#xa0;et&#xa0;al., 2003</xref>). In this approach, neural networks are used as <italic>black-box</italic> controllers, and the search performed by the evolutionary algorithm does not require domain-specific heuristic information. For this reason, neuro-evolutionary design methods are expected to allow the design of control software with no domain knowledge. For a review of early neuro-evolutionary design methods, see <xref ref-type="bibr" rid="B17">Brambilla&#xa0;et&#xa0;al. (2013)</xref>.</p>
<p>More recently, several authors have focused on systematically using neuro-evolution to design control software for various robotic platforms&#x2014;mainly targeting those that could be possibly used in real-world deployments. For example, Trianni and Nolfi evolved a perceptron network to synchronize the movement of a swarm of s-bot robots (<xref ref-type="bibr" rid="B124">Trianni and Nolfi, 2011</xref>). <xref ref-type="bibr" rid="B34">Duarte&#xa0;et&#xa0;al. (2016)</xref> used NEAT (<xref ref-type="bibr" rid="B119">Stanley and Miikkulainen, 2002</xref>) to design control software a swarm of aquatic robots performing tasks such as homing or dispersion (<xref ref-type="bibr" rid="B34">Duarte&#xa0;et&#xa0;al., 2016</xref>). <xref ref-type="bibr" rid="B47">Gomes&#xa0;et&#xa0;al. (2019)</xref> generated control software for robot teams composed of aerial and ground robots in a foraging task. <xref ref-type="bibr" rid="B59">Hasselmann&#xa0;et&#xa0;al. (2021)</xref> compared NEAT, xNES (<xref ref-type="bibr" rid="B45">Glasmachers&#xa0;et&#xa0;al., 2010</xref>) and CMA-ES (<xref ref-type="bibr" rid="B56">Hansen and Ostermeier, 2001</xref>) to generate control software for a swarm of e-puck (<xref ref-type="bibr" rid="B88">Mondada&#xa0;et&#xa0;al., 2009</xref>) robots in five different missions such as aggregation, homing, shelter, foraging, and gate passing (<xref ref-type="bibr" rid="B59">Hasselmann&#xa0;et&#xa0;al., 2021</xref>). In a different research direction, researchers have investigated the minimal requirements to evolve specific collective behaviors. For example, <xref ref-type="bibr" rid="B42">Gauci&#xa0;et&#xa0;al. (2014a)</xref> evolved a recurrent neural network to perform aggregation. In their study, the authors tested their control software on robots with minimal capabilities: each robot had a single binary sensor that controlled the speed of its two wheels. <xref ref-type="bibr" rid="B126">van&#xa0;Diggelen&#xa0;et&#xa0;al. (2022)</xref> evolved a gradient following behavior. Notably, the robots could perceive only the local value of the gradient, not its direction, and they could not communicate with other robots.</p>
<p>Neuro-evolutionary approaches have shown many promising results. Yet, two main challenges remain in the field: fitness engineering and the reality gap. The first challenge is fitness engineering, or how to produce appropriate objective functions to drive the evolutionary process. It is well understood that incorrectly defined objective functions pose two challenges to the evolutionary process: <italic>bootstrapping</italic> and <italic>deception</italic> (<xref ref-type="bibr" rid="B112">Silva&#xa0;et&#xa0;al., 2016</xref>). The issue of bootstrapping arises when the objective function fails to apply meaningful selection pressure in low-performance regions of the search space. As a result, the design process explores the low-performance regions in an undirected manner and is unable to converge towards higher performance regions of the search space. The issue of deception describes the case in which the objective function contains easily reachable local optima. In this case, the design process can easily converge towards the local optima and will result in the generation of a suboptimal collective behavior. These two issues can usually be overcome by introducing <italic>a priori</italic> knowledge into the objective function (fitness engineering) (<xref ref-type="bibr" rid="B124">Trianni and Nolfi, 2011</xref>; <xref ref-type="bibr" rid="B26">Divband&#xa0;Soorati and Hamann, 2015</xref>; <xref ref-type="bibr" rid="B112">Silva&#xa0;et&#xa0;al., 2016</xref>). However, the necessity of <italic>a priori</italic> knowledge conditions the effectiveness of a neuro-evolutionary design method; as it will largely depend on the expertise of the designer of the objective function. The second challenge of neuro-evolution is the reality gap. The reality gap are the inescapable differences between the design and deployment environment, and often manifests in a performance drop when designing control software in simulation and assessing it on real robots. Yet, not all design methods are affected similarly by the reality gap, and it is therefore imperative to assess all automatic design methods not only in simulation but on real robots (<xref ref-type="bibr" rid="B10">Birattari&#xa0;et&#xa0;al., 2019</xref>). In the context of neuro-evolution, Hasselmann et&#xa0;al. investigated the effects of the reality gap on different neuro-evolutionary design methods (<xref ref-type="bibr" rid="B59">Hasselmann&#xa0;et&#xa0;al., 2021</xref>). They showed that, without further mitigation strategies or mission-specific adaptations, sophisticated neuro-evolutionary design methods perform similarly poor in reality as a simple perceptron network.</p>
</sec>
<sec id="s2-2">
<title>2.2 Automatic modular design</title>
<boxed-text id="dBox2">
<p>
<italic>Automatic modular design</italic>: Robots are controlled by an instance of control software assembled from modules. Typical architectures of the control software include finite-state machines and behavior trees. An optimization algorithm possibly assembles the modules within the architecture and further fine-tunes the parameters of the modules, according to a mission-specific objective function. The design process results in a single well-performing instance of control software.</p>
</boxed-text>
<p>Neuro-evolution enables, in practice, the design of control software without prior domain knowledge. Yet, in cases that domain knowledge is available, it might be incorporated into the design method to achieve better results. Instead of relying on artificial neural networks, automatic modular design methods generate control software that is composed of software modules that are assembled into a more complex control architecture&#x2014;e.g., finite-state machines or behavior trees (<xref ref-type="bibr" rid="B25">Colledanchise and &#xd6;gren, 2018</xref>). Through the choice and implementation of these modules, domain knowledge can be incorporated into the design process.</p>
<p>
<xref ref-type="bibr" rid="B35">Duarte&#xa0;et&#xa0;al. (2014)</xref> manually decomposed a complex object removal task into simpler subtasks. They evolved continuous-time recurrent neural networks that were then assembled, in a modular way, into a hierarchical controller (according to the manual decomposition). <xref ref-type="bibr" rid="B36">Ferrante&#xa0;et&#xa0;al. (2015)</xref> used grammatical evolution to design control software for a foraging scenario with task allocation. They designed behavioral rules from basic behavioral and conditional modules. <xref ref-type="bibr" rid="B60">Hecker&#xa0;et&#xa0;al. (2012)</xref> used a genetic algorithm to optimize a finite-state machine that controls the behavior of robots in a foraging swarm. The authors pre-programmed an initial finite-state machine, which was inspired by the foraging behavior observed in ants. They used the genetic algorithm to optimize parameters of the finite-state machine that were not chosen at design time. <xref ref-type="bibr" rid="B38">Francesca&#xa0;et&#xa0;al. (2014)</xref> proposed AutoMoDe-Vanilla, an automatic modular design method that assembles finite-state machines out of a set of twelve handcrafted modules. Several flavors (i.e., implementations) of AutoMoDe have been proposed to study different elements of the design process, such as different module sets (<xref ref-type="bibr" rid="B81">Ligot&#xa0;et&#xa0;al., 2020a</xref>; <xref ref-type="bibr" rid="B41">Garz&#xf3;n&#xa0;Ramos and Birattari, 2020</xref>; <xref ref-type="bibr" rid="B57">Hasselmann and Birattari, 2020</xref>; <xref ref-type="bibr" rid="B117">Spaey&#xa0;et&#xa0;al., 2020</xref>; <xref ref-type="bibr" rid="B87">Mendiburu&#xa0;et&#xa0;al., 2022</xref>), hardware-software co-design (<xref ref-type="bibr" rid="B108">Salman&#xa0;et&#xa0;al., 2019</xref>), or optimization algorithms (<xref ref-type="bibr" rid="B74">Kuckling&#xa0;et&#xa0;al., 2020a</xref>; <xref ref-type="bibr" rid="B75">Kuckling&#xa0;et&#xa0;al., 2020b</xref>; <xref ref-type="bibr" rid="B23">Cambier and Ferrante, 2022</xref>). Besides finite-state machines, behavior trees have recently gained attention in the literature on automatic modular design. They offer several advantages over finite-state machines, like enhanced modularity and better human readability (<xref ref-type="bibr" rid="B25">Colledanchise and &#xd6;gren, 2018</xref>). <xref ref-type="bibr" rid="B65">Jones&#xa0;et&#xa0;al. (2018)</xref> evolved behavior trees for a foraging swarm of kilobot (<xref ref-type="bibr" rid="B106">Rubenstein&#xa0;et&#xa0;al., 2014</xref>) robots. Kuckling et&#xa0;al. investigated the use of behavior trees within the AutoMoDe framework (<xref ref-type="bibr" rid="B73">Kuckling&#xa0;et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B74">Kuckling&#xa0;et&#xa0;al., 2020a</xref>; <xref ref-type="bibr" rid="B82">Ligot&#xa0;et&#xa0;al., 2020b</xref>; <xref ref-type="bibr" rid="B76">Kuckling&#xa0;et&#xa0;al., 2022</xref>). Neupane and Goodrich used grammatical evolution to design software for a swarm of 100 robots performing a foraging task (<xref ref-type="bibr" rid="B90">Neupane and Goodrich, 2019</xref>).</p>
<p>Automatic modular design methods are an emerging field of research with promising prospects. Preliminary results indicate that they are a viable alternative to neuro-evolutionary design methods, with comparable performance and better transferability between simulation and real robots. However, this advantage comes at the cost of devoting effort to specify the modules. An artificial neural network can map all possible sensory inputs to all possible actuator outputs. As a result, neuro-evolutionary design methods can be used to design control software to perform any mission that is within the capabilities of the robots. In the case of automatic modular design, a human designer must manually implement the modules. The choice of modules implicitly restricts the space of possible missions that can be addressed by an automatic modular design method (<xref ref-type="bibr" rid="B41">Garz&#xf3;n&#xa0;Ramos and Birattari, 2020</xref>). If the set of modules is too limited, the design method would only produce satisfactory results for the mission it was conceived for, and the design space might not contain well-performing instances of control software for other missions. In other words, the design method will underperform in most cases. In this situation, the underperforming method can be accepted as it is or it will become necessary to develop a new design method&#x2014;which ultimately turns into a manual design method rather than an automatic one. An important question to be addressed is, therefore, how to develop general automatic modular design methods that still remain robust to the reality gap.</p>
</sec>
<sec id="s2-3">
<title>2.3 Novelty search and quality diversity algorithms</title>
<boxed-text id="dBox3">
<p>
<italic>Novelty search</italic>: Robots are controlled by an instance of control software in an arbitrary form, although commonly an artificial neural network is used. Instead of optimizing a mission-specific objective function, novelty search algorithms are selecting for control software that exhibits behavioral novelty with regard to previously encountered behaviors. The design process results in a set of behaviorally diverse instances of control software.</p>
<p>
<italic>Quality diversity algorithms</italic>: Robots are controlled by an instance of control software in an arbitrary form. The design process considers two criteria: the quality with respect to a mission-specific objective function and the behavioral novelty with respect to previously encountered instances of control software. The design process returns either a single well-performing instance of control software or a set of diverse and relatively well-performing instances of control software.</p>
</boxed-text>
<p>Some recent studies focus on the application of novelty search in swarm robotics. Instead of optimizing a mission-specific performance measure, novelty search generates a set of behaviorally diverse instances of control software (<xref ref-type="bibr" rid="B77">Lehman and Stanley, 2011</xref>). This approach promises to avoid the issue of deception in objective function engineering. The design method avoids premature convergence by optimizing behavioral diversity instead of the mission-specific objective function.</p>
<p>
<xref ref-type="bibr" rid="B50">Gomes&#xa0;et&#xa0;al. (2013)</xref> used novelty search to generate aggregation and resource sharing behaviors in a swarm. Additionally, the authors combined the novelty metric with a performance metric to overcome limitations where novelty search could not escape large, low-performance regions of the search space. In a follow-up work, <xref ref-type="bibr" rid="B48">Gomes&#xa0;et&#xa0;al. (2017)</xref> applied novelty search to co-evolutionary problems. Gomes and Christensen also investigated how to generate task-agnostic behavior repertoires using novelty search (<xref ref-type="bibr" rid="B46">Gomes and Christensen, 2018</xref>). <xref ref-type="bibr" rid="B58">Hasselmann&#xa0;et&#xa0;al. (2023)</xref> proposed AutoMoDe-Nata, an automatic modular design method that uses novelty search to create basic behavioral modules, which then are combined into probabilistic finite-state machines.</p>
<p>In the papers mentioned above, novelty search-based methods have shown to generate simple swarm robotics behaviors. Yet, for more complex collective behaviors, novelty search has not produced control software that performs as well as control software generated with a mission-specific objective function (<xref ref-type="bibr" rid="B46">Gomes and Christensen, 2018</xref>; <xref ref-type="bibr" rid="B58">Hasselmann&#xa0;et&#xa0;al., 2023</xref>). The outcome of novelty search methods is not a single instance of control software but a set of them&#x2014;each of which is a behavior with sufficiently different traits. Therefore, the design method must also include a strategy to select the most appropriate behavior of the set (either manually or automatically). Quality diversity algorithms (<xref ref-type="bibr" rid="B102">Pugh&#xa0;et&#xa0;al., 2016</xref>) combine the benefits of novelty search with the directed search of evolutionary robotics. Beyond the difficulties of generating complex collective behaviors, novelty search further faces the challenge of defining characteristic traits that describe the collective behavior of the robots. So far, the selection of behavioral characteristics has been done <italic>ad hoc</italic> (<xref ref-type="bibr" rid="B50">Gomes&#xa0;et&#xa0;al., 2013</xref>; <xref ref-type="bibr" rid="B46">Gomes and Christensen, 2018</xref>; <xref ref-type="bibr" rid="B58">Hasselmann&#xa0;et&#xa0;al., 2023</xref>). However, this <italic>ad hoc</italic> selection requires expertise and it can result in potential drawbacks to the design process when done incorrectly. Vast behavior spaces defined by too general behavior characteristics will contain dimensions unrelated to the mission at hand, and they will cause the novelty search to perform poorly (<xref ref-type="bibr" rid="B49">Gomes&#xa0;et&#xa0;al., 2014</xref>). Furthermore, it remains open whether the behavioral characteristics of a collective behavior should be defined on a collective level, on an individual level, or with a combination of the two.</p>
</sec>
<sec id="s2-4">
<title>2.4 Other approaches</title>
<p>As discussed previously, a major issue in evolutionary swarm robotics is the definition of an appropriate objective function. Other researchers have addressed this issue besides those that focus on novelty search&#x2014;although they are less prominent in the literature.</p>
<boxed-text id="dBox4">
<p>
<italic>Multi-objective optimization</italic>: Robots are controlled by an instance of control software in an arbitrary form. Instead of optimizing a single mission-specific objective function, several objectives are considered at the same time. The design process results in a set of non-dominated instances of control software.</p>
</boxed-text>
<p>
<xref ref-type="bibr" rid="B123">Trianni and L&#xf3;pez-Ib&#xe1;&#xf1;ez (2015)</xref> investigated the use of an evolutionary multi-objective optimization algorithm in a strictly collaborative mission. Next to the (singular) objective of the mission, the authors specified a secondary auxiliary objective to overcome the convergence to certain sub-optimal behaviors&#x2014;although the auxiliary conflicted with the main objective. They showed that multi-objective optimization indeed avoided premature convergence, and that properly chosen auxiliary objectives have the potential to overcome the bootstrap problem.</p>
<boxed-text id="dBox5">
<p>
<italic>Minimizing surprise</italic>: Robots are controlled by two artificial neural networks. The first neural network is an action network that maps sensor inputs to actuator outputs; the other is a predictor network that maps sensor inputs to the predicted sensor inputs of the next control step. An evolutionary algorithm is used to optimize both neural networks together, minimizing only the prediction error of the predictor network. The design process results in a single instance of control software that minimizes the prediction error of the predictor network.</p>
</boxed-text>
<p>Kaiser and Hamann investigated an approach named &#x201c;minimizing surprise.&#x201d; Inspired by the <italic>free energy principle</italic> (<xref ref-type="bibr" rid="B39">Friston, 2010</xref>), Hamann used offline evolution to generate control software in the form of two neural networks, a prediction network and an action network (<xref ref-type="bibr" rid="B53">Hamann, 2014</xref>). The action network controlled the robot, whereas the prediction network predicted the next sensor state. The design process aimed to minimize the prediction error. Results showed that, despite not selecting for swarm behaviors, basic self-organizing collective behaviors emerged during the design process. Kaiser and Hamann extended their work and proposed a system to systematically engineer self-organizing assembly behaviors using the &#x201c;minimizing surprise&#x201d; approach (<xref ref-type="bibr" rid="B68">Kaiser and Hamann, 2019</xref>).</p>
<boxed-text id="dBox6">
<p>
<italic>Computation-free control</italic>: Robots are controlled by a look-up table that contains the actuator output for every possible sensor input. The look-up table is optimized with respect to a mission-specific objective function. Typically, CMA-ES is used as optimization algorithm, but other algorithms are possible (e.g., exhaustive search). The design process results in a single well-performing instance of control software.</p>
</boxed-text>
<p>
<xref ref-type="bibr" rid="B43">Gauci&#xa0;et&#xa0;al. (2014b)</xref> studied the emergence of collective behaviors for robots with minimal capabilities. In their study, the robots only had a single line-of-sight sensor and could set their velocity based on the discrete readings of this sensor. The authors used CMA-ES to optimize the mappings of the sensor to velocities in missions such as clustering, shepherding (<xref ref-type="bibr" rid="B96">&#xd6;zdemir&#xa0;et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B33">Dosieah&#xa0;et&#xa0;al., 2022</xref>), decision making (<xref ref-type="bibr" rid="B95">&#xd6;zdemir&#xa0;et&#xa0;al., 2018</xref>), and coverage (<xref ref-type="bibr" rid="B97">&#xd6;zdemir&#xa0;et&#xa0;al., 2019</xref>).</p>
<p>The approaches described in this section are promising alternatives for the design of control software for robot swarms, but they require further research before they will become robust engineering techniques. Multi-objective design methods might overcome issues of deception and bootstrapping, similar to novelty search. However, they do not require the definition of behavioral characteristics. Instead, a secondary mission-specific objective is defined. This also poses a major challenge, as the definition of secondary objectives requires knowledge of any undesired behaviors. Minimizing surprise has shown to generate spatially organized behaviors in which the sensors states are stable. By defining partial expected sensor readings, generated instances of control software can be biased towards desired behaviors, yet other less desired behaviors were still generated. More research will be necessary to develop techniques to reliably generate desired behaviors (or classes of desired behaviors) <italic>via</italic> minimizing surprise. Similarly, computation-free control has been successful in some relatively simple missions, but further research will be necessary to show its viability in more complex missions.</p>
</sec>
</sec>
<sec id="s3">
<title>3 Embodied evolution and social learning</title>
<boxed-text id="dBox7">
<p>
<italic>Embodied evolution</italic>: Robots are controlled by instance of control software in an arbitrary form, though, typically, an artificial neural network is chosen. While performing the mission, the robots also run a decentralized evolutionary algorithm and periodically select a new instance of control software to execute. Repeatedly during the execution, the robots may exchange information about the performance of their executed instances of control software. The design process results in a single well-performing instance of control software.</p>
</boxed-text>
<p>Online design processes in which each robot in the swarm executes part of a distributed evolutionary algorithm are called embodied evolution. For example, in the design process, every robot in the swarm is initialized with and maintains its own set of genomes. From this genome set, each robot selects one genome and executes the control software encoded in it. Periodically, all robots exchange genomes among each other (which may be subjected to mutation or crossover operations) and they select a new genome to execute. Embodied evolution provides important advantages with respect to offline approaches (<xref ref-type="bibr" rid="B127">Watson&#xa0;et&#xa0;al., 2002</xref>). As evolution takes place directly in the mission environment, transferability is no concern. Besides, the distributed nature of the design process allows exploring different solutions in parallel. The parallelization of the design process allows to speed up the production of control software if compared with centralized online evolutionary methods.</p>
<p>Recent works (<xref ref-type="bibr" rid="B61">Heinerman&#xa0;et&#xa0;al., 2015</xref>; <xref ref-type="bibr" rid="B111">Silva&#xa0;et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B18">Bredeche and Fontbonne, 2021</xref>) have framed the concepts behind embodied evolution as a form of robot learning. The authors argue that embodied evolution is conceptually closer to robot learning (see <xref ref-type="sec" rid="s4">Section&#xa0;4</xref>), as the robots are updating their control software while performing the mission. Yet, the most common technique to implement embodied evolution remains the application of evolutionary algorithms.</p>
<p>Only a few studies have been conducted using embodied evolution in swarm robotics. For example, <xref ref-type="bibr" rid="B9">Bianco and Nolfi (2004)</xref> investigated an embodied evolutionary approach in which robots share their genomes when physically connecting to other robots. <xref ref-type="bibr" rid="B100">Prieto&#xa0;et&#xa0;al. (2010)</xref> used embodied evolution to program a swarm of e-puck robots in a cleaning task. <xref ref-type="bibr" rid="B20">Bredeche&#xa0;et&#xa0;al. (2012)</xref> investigated the adaptivity of open-ended evolution to changes in the environment. <xref ref-type="bibr" rid="B113">Silva&#xa0;et&#xa0;al. (2015)</xref> developed an online, distributed version of NEAT (<xref ref-type="bibr" rid="B119">Stanley and Miikkulainen, 2002</xref>) and used it to evolve control software in three missions. <xref ref-type="bibr" rid="B66">Jones&#xa0;et&#xa0;al. (2019)</xref> evolved behavior trees for a collective pushing task. <xref ref-type="bibr" rid="B22">Cambier&#xa0;et&#xa0;al. (2021)</xref> used an evolutionary language model to tune the parameters of a probabilistic aggregation controller. For more detailed surveys, including online evolution for single and multi-robot systems, see <xref ref-type="bibr" rid="B19">Bredeche&#xa0;et&#xa0;al. (2018)</xref>; <xref ref-type="bibr" rid="B37">Francesca and Birattari (2016)</xref>.</p>
<p>Embodied evolution still faces several challenges in the context of the design of control software for robot swarms. For example, robots need to execute not only their own control software but also the design process. This may not be feasible for robots with limited computational hardware. Furthermore, to conduct the evolutionary process, the swarm must operate for a relatively long time (as compared to the normal mission duration), posing more demand on batteries and increasing the likelihood of sensor or actuator failures. Additionally, without further safety measures implemented <italic>a priori</italic>, the robots risk to damage themselves or the environment, especially in early parts of the design process. More importantly, the evolutionary process can only be achieved if the individuals of the swarm can assess the performance of their chosen genome&#x2014;ideally this should be computed for the whole swarm, however, without further infrastructure this information is not directly available to the robots as they rely only on local perception.</p>
<p>Three main solutions have been proposed to address the aforementioned issue: open-ended evolution, decomposition and simulation-based assessment. In open-ended evolution, the design process is not driven by an explicit objective function. Instead, open-ended evolution ties the survival of an instance of control software to its ability to &#x201c;reproduce.&#x201d; Over time, instances of control software that successfully reproduce will replace instances of control software that cannot. Implicit selection pressure can be exerted by tying the chance to reproduce to certain desired actions or outcomes (<xref ref-type="bibr" rid="B9">Bianco and Nolfi, 2004</xref>; <xref ref-type="bibr" rid="B100">Prieto&#xa0;et&#xa0;al., 2010</xref>; <xref ref-type="bibr" rid="B20">Bredeche&#xa0;et&#xa0;al., 2012</xref>). For example, Bianco and Nolfi consider encounters between robots as opportunity for reproduction. As the task is self-assembly, this implicitly rewards instances of control software that manage to encounter and assemble with other robots. Another typical choice is to model the performance of the individual robots by energy levels: taking an action depletes the energy, but certain outcomes of the actions replenish it. While the robot is active (with available energy), its control software is periodically exchanged with neighboring robots. Once the energy is fully depleted, the instance of control software that was active in the robot is replaced by another one. Over time, instances of control software that are more successful at managing their energy level (by achieving the desired outcomes) will have more opportunities to spread to other robots, thus prevailing in the swarm and displacing less successful instances of control software. Like novelty search, open-ended evolution does not necessarily aim to generate a particular behavior, but rather for the spontaneous emergence of complex behaviors. As an alternative, a designer could manually decompose the objective function for the desired collective behavior into rewards for the actions (or their outcomes) of individual robots (<xref ref-type="bibr" rid="B113">Silva&#xa0;et&#xa0;al., 2015</xref>). Although viable, this decomposition is especially difficult in tasks that strictly require cooperation or only provide delayed rewards&#x2014;e.g., taking an action does not immediately increase the fitness of the swarm, as it requires an appropriate second subsequent action to effectively increase the fitness. This decomposition is similar to the credit assignment problem encountered in robot learning (see <xref ref-type="sec" rid="s4">Section&#xa0;4</xref>). Recently, <xref ref-type="bibr" rid="B66">Jones&#xa0;et&#xa0;al. (2019)</xref> proposed an online evolutionary method in which robots performed simulations to evaluate the quality of genomes. This method allows the robots to estimate the performance of a genome as if it was deployed to the whole swarm&#x2014;without the need for decomposing the objective function. However, assessing the performance in simulation might overestimate the degree of cooperation and coordination of the robots, as other members of the swarm might execute different instances of control software and not cooperate as expected.</p>
</sec>
<sec id="s4">
<title>4 Robot learning</title>
<p>Reinforcement learning is a method for producing control software in which an agent attempts to learn a policy that encodes the set of optimal actions in a dynamic environment (<xref ref-type="bibr" rid="B67">Kaelbling&#xa0;et&#xa0;al., 1996</xref>). Classically, reinforcement learning only considers a single agent interacting with the environment. In this case, the system is then often modelled as a Markov decision process. As robot swarms are composed of several individuals, they are usually modelled as <italic>multi-agent reinforcement learning</italic> problems (see <xref ref-type="sec" rid="s4-1">Section&#xa0;4.1</xref>). Robot learning in swarm robotics faces similar challenges as robot evolution. Namely, <italic>reward shaping</italic>, the problem of specifying an appropriate reward function to generate the desired behavior, and the <italic>reality gap</italic>, the drop in performance observed when the control software is designed in simulation and assessed in reality. In multi-agent reinforcement learning methods, all members of the swarm typically act independently. Therefore, they are often affected by the <italic>curse of dimensionality</italic>, where the action space grows with the number of robots and the degrees of freedom of each robot. A variant of reinforcement learning that has found recent application in swarm robotics is <italic>imitation learning</italic> (see Section&#xa0;4.2). Instead of optimizing the rewards gained from a known reward function, imitation learning aims to imitate a demonstrated behavior.</p>
<p>For reviews of robot learning in the single and multi-robot domain, see <xref ref-type="bibr" rid="B70">Kober&#xa0;et&#xa0;al. (2013)</xref>; <xref ref-type="bibr" rid="B134">Zhao&#xa0;et&#xa0;al. (2020)</xref>.</p>
<sec id="s4-1">
<title>4.1 Multi-agent reinforcement learning</title>
<boxed-text id="dBox8">
<p>
<italic>Multi-agent reinforcement learning</italic>: Robots are controlled by an instance of control software in an arbitrary form. A reinforcement learning algorithm is used to optimize the instance of control software according to a mission-specific reward function. The design process results in a single well-performing instance of control software.</p>
</boxed-text>
<p>Although multi-agent reinforcement learning has been largely studied in the literature, it has seen little application in swarm robotics so far. The first application of reinforcement learning in a swarm robotics scenario is possibly the one of Matari&#x107;. Matari&#x107; studied reinforcement learning with a swarm of 4 robots that perform a foraging mission (<xref ref-type="bibr" rid="B84">Matari&#x107;, 1997</xref>). In a follow-up work, Matari&#x107; introduced robot communication in the swarm to synchronize rewards between the robots (<xref ref-type="bibr" rid="B85">Matari&#x107;, 1998</xref>). More recently, <xref ref-type="bibr" rid="B63">H&#xfc;ttenrauch&#xa0;et&#xa0;al. (2019)</xref> used deep reinforcement learning to generate control software for a swarm of virtual agents. <xref ref-type="bibr" rid="B13">Bloom&#xa0;et&#xa0;al. (2022)</xref> investigated the use of four deep reinforcement learning techniques in a collective transport experiment.</p>
<p>The application of multi-agent reinforcement learning poses several challenges that still hinder its application in swarm robotics. A first challenge arises from the fact that, in swarm robotics, the desired behavior is usually expressed at the collective level, whereas the learning must happen at the individual level. Thus, when designing control software using reinforcement learning, the mission designer needs to decompose the reward function of the whole swarm into rewards that can be assigned for individual contributions. This problem is also known as <italic>spatial credit assignment</italic>. To this date, no generally applicable methodology exists to address this problem and most works use manual credit assignment (<xref ref-type="bibr" rid="B85">Matari&#x107;, 1998</xref>; <xref ref-type="bibr" rid="B63">H&#xfc;ttenrauch&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B13">Bloom&#xa0;et&#xa0;al., 2022</xref>).</p>
<p>Another important issue is the representation of the state and action spaces in the learning process. Typically, a multi-agent reinforcement learning uses joint action and state spaces, which are concatenated over the individual action and state spaces of each individual agent. These joint spaces, however, suffer heavily from the curse of dimensionality, as they scale poorly both in the size of the individual spaces and in the number of agents. Consequently, addressing large swarm sizes is infeasible in practice. Furthermore, the joint space is not observable by any individual agent, due to the locality of information in a robot swarm. In this sense, the problem of multi-agent reinforcement learning for swarms is more correctly modelled by a partially observable Markov decision process (<xref ref-type="bibr" rid="B67">Kaelbling&#xa0;et&#xa0;al., 1996</xref>). In the literature, two techniques have been mostly used to overcome the partial observability: reducing the joint action and state space to those that are pertinent to a single robot (<xref ref-type="bibr" rid="B63">H&#xfc;ttenrauch&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B13">Bloom&#xa0;et&#xa0;al., 2022</xref>); or sharing information to synchronize the state beliefs of all members of the swarm (<xref ref-type="bibr" rid="B85">Matari&#x107;, 1998</xref>). In the first technique, a robot has no model of the behavior of its peers and they are assumed to be part of the environment. The environment that a robot experiences is therefore non-stationary; the state transitions depend not only on the actions of the individual robot but also the (changing, due to learning) behavior of its peers. In the second technique, the swarm retains some level of homogeneity by sharing information between robots. Thus, the learning process does not run independently for each robot but requires some mechanism for synchronization. When using simulations, the centralized-learning/decentralized-execution approach can be used (<xref ref-type="bibr" rid="B63">H&#xfc;ttenrauch&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B13">Bloom&#xa0;et&#xa0;al., 2022</xref>). In this approach, observations of all robots are collected centrally and used to update the policy during the learning phase. However, the policy is executed decentralized on each individual robot.</p>
</sec>
<sec id="s4-2">
<title>4.2 Imitation learning</title>
<boxed-text id="dBox9">
<p>
<italic>Imitation learning</italic>: Given demonstrations of a desired behavior, an algorithm generates an instance of control software that performs the desired behavior. Different techniques, such as behavior cloning, Turing learning, and imitation learning, have been proposed to imitate the demonstrated behavior.</p>
</boxed-text>
<p>A research field in reinforcement learning that has become of interest for swarm robotics researchers is imitation learning (<xref ref-type="bibr" rid="B94">Osa&#xa0;et&#xa0;al., 2018</xref>). In imitation learning, the reward function is assumed to be unknown. Instead, the learning process has access to demonstrations of the desired behavior. The agents attempt to learn a policy that results in a behavior that is similar to the behavior that has been provided in a demonstration. By its own nature, imitation learning methods face a similar challenge as those of novelty search (see <xref ref-type="sec" rid="s2-3">Section&#xa0;2.3</xref>). Namely, how to represent a behavior numerically and how to quantitatively measure the similarity of two behaviors.</p>
<boxed-text id="dBox10">
<p>
<italic>Turing learning</italic>: The robots are controlled by an artificial neural network. Demonstrations are used to learn another artificial neural network that discriminates between the demonstrated behavior and the generated ones. The design process iterates between generating an instance of control software and updating the discriminator. New instances of control software are generated in such a way that they can fool the discriminator. Afterwards, the discriminator is updated to once more correctly distinguish between the demonstrated behavior and previously generated ones. The design process results in a single instance of control software, that is behaviorally similar to the demonstrated behavior, and the learned discriminator.</p>
</boxed-text>
<p>Within the research on imitation learning and swarm robotics, <xref ref-type="bibr" rid="B79">Li&#xa0;et&#xa0;al. (2016)</xref> proposed Turing learning for swarm systems. Inspired by the Turing test, the system learns two programs. A first program controls the robots in the swarm, whereas the second program attempts to distinguish between trajectories from the originally demonstrated behavior and trajectories from the behaviors that are being generated through learning.</p>
<boxed-text id="dBox11">
<p>
<italic>Behavior cloning</italic>: Robots are controlled by an instance of control software in an arbitrary form. Demonstrations are used to learn an instance of control software that, under the same conditions, behaves the same as the demonstrated behavior. The reward function computes the similarity of the generated behavior with regard to the demonstrated one. The design process results in a single instance of control software that closely reproduces the demonstrated behavior.</p>
</boxed-text>
<p>
<xref ref-type="bibr" rid="B2">Alharthi&#xa0;et&#xa0;al. (2022)</xref> used video recordings of simulated robots to learn a behavior tree corresponding to the demonstrated collective behavior. The authors measure several swarm-level metrics, such as center of mass or length of communication paths in the swarm, and use the Jaccard distance to compute similarity with the original behavior.</p>
<boxed-text id="dBox12">
<p>
<italic>Inverse reinforcement learning</italic>: Robots are controlled by an instance of control software in an arbitrary form. Demonstrations are used to learn the reward function that would be maximized by the demonstrated behavior. The design process results in the learned reward function, which can then be used to learn an instance of control software for the robots.</p>
</boxed-text>
<p>
<xref ref-type="bibr" rid="B115">&#x160;o&#x161;i&#x107;&#xa0;et&#xa0;al. (2017)</xref> used inverse reinforcement learning to learn the behavior of two predefined particle models. Using SwarmMDP (a variant of decentralized, partially observable Markov decision processes), they reduced the multi-agent reinforcement learning problem to a single-agent problem. <xref ref-type="bibr" rid="B44">Gharbi&#xa0;et&#xa0;al. (2023)</xref> used apprenticeship learning (<xref ref-type="bibr" rid="B1">Abbeel and Ng, 2004</xref>) to learn collective behaviors from demonstrations of desired spatial organizations for a swarm.</p>
<p>Few studies have focused on the application of imitation learning in swarm robotics. Methods that are being currently developed face two challenges. The first challenge is that existing methods typically require detailed demonstrations to produce their corresponding control software. The more detailed the demonstrations, the easier it is to imitate them. Most work on imitation learning in swarm robotics uses an already available behavior to generate trajectories that must be learned again by the swarm (<xref ref-type="bibr" rid="B79">Li&#xa0;et&#xa0;al., 2016</xref>; <xref ref-type="bibr" rid="B115">&#x160;o&#x161;i&#x107;&#xa0;et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B2">Alharthi&#xa0;et&#xa0;al., 2022</xref>). The obvious drawback of this approach is that it is only suitable for cases in which an implementation of the desired collective behavior already exists. Alternatively, other approaches have focused on only demonstrating a few key elements of the collective behavior, instead of a full trajectory (<xref ref-type="bibr" rid="B44">Gharbi&#xa0;et&#xa0;al., 2023</xref>). The second challenge is that there is no well-established method to measure the similarity between a demonstrated behavior and a generated one. As in novelty search (see <xref ref-type="sec" rid="s2-3">Section&#xa0;2.3</xref>), a collective behavior can be described by several possible forms of representations; with both characteristics at the collective and local level. The definition of characteristics at the collective level requires less domain-specific expertise to decide on, but their mathematical formulation is challenging. Individual characteristics are comparably simpler to compute, yet decomposing the desired collective behavior into its individual parts requires prior knowledge of the mission at hand.</p>
<p>As discussed in this section, few studies in swarm robotics have considered robot learning but have shown it to be a viable alternative to robot evolution for the design of robot swarms. Among these studies, multi-agent reinforcement learning aims to learn policies for a given reward function. Yet, like robot evolution, it faces two major challenges: reward shaping (the corresponding problem to fitness engineering) and the reality gap. Imitation learning, conversely, produces control software by imitating a demonstrated desired behavior without the reward function being known. However, it faces a similar challenge as novelty search; it relies on computing behavioral similarity (as opposed to behavioral novelty in novelty search).</p>
</sec>
</sec>
<sec id="s5">
<title>5 Perspectives</title>
<p>As highlighted in the previous sections, the research on the design of control software for robot swarms has resulted in many promising automatic design methods. Yet, several important challenges remain. In this section, I discuss the issues that affect broad categories of automatic design methods. Additionally, I give an outlook on techniques and methods that I believe could become useful in addressing the challenges in the automatic design of control software for robot swarms.</p>
<p>
<italic>How can we develop design methods that are robust to the reality gap?</italic>
</p>
<p>While offline design has shown many promising results, a major challenge remains in the issue of the reality gap. Several approaches have been proposed to reduce the effects of the reality gap. For example, <italic>system identification</italic> can be used to develop more realistic simulators that intend to minimize the differences between simulation and reality (<xref ref-type="bibr" rid="B15">Bongard and Lipson, 2004</xref>; <xref ref-type="bibr" rid="B134">Zhao&#xa0;et&#xa0;al., 2020</xref>). However, this approach is unlikely to succeed (<xref ref-type="bibr" rid="B64">Jakobi, 1997</xref>), especially in swarm robotics. First, a simulation can never be identical to the system that is being simulated (<xref ref-type="bibr" rid="B64">Jakobi, 1997</xref>). Although investing more resources to make high-fidelity simulations more accurate can indeed reduce the effects of the reality gap to some extent. Performing these high-fidelity simulations for up to thousands (or possibly more) individual robots would require more computing power than can reasonably be provided at the moment. Second, the robots in a swarm are relatively simple and some fault or inaccuracy in their sensors and actuators is acceptable, or even expected. Consequently, if the simulation accurately models the inaccuracies of each robot, the robots of the swarm would not be longer interchangeable: different robots are modeled to behave differently under the same circumstances. This assumption would negatively impact the desirable properties of a robot swarm. In a more general sense, research has shown that the reality gap does not affect all design methods equally and can lead to rank inversions across design methods. Indeed, a design method can perform better in simulation but worse in reality when compared to another design method (<xref ref-type="bibr" rid="B80">Ligot and Birattari, 2020</xref>). Therefore, I contend the focus should be on developing design methods that are inherently robust to the reality gap.</p>
<p>In evolutionary swarm robotics, it is often assumed that no or very little domain knowledge exists. Consequently, control software is commonly generated from scratch. However, in many tasks, there exists a reasonable amount of prior domain knowledge that could be used to ease the design process. Automatic modular design allows to incorporate this domain knowledge in the form of software modules (<xref ref-type="bibr" rid="B11">Birattari&#xa0;et&#xa0;al., 2021</xref>). Furthermore, the transferability of individual modules can be tested during the conception of the design method. However, the correct introduction of prior domain knowledge remains dependent on the expertise of the designer. Future research will therefore need to consider automatic modular design methods in which the modules are conceived in a mission-agnostic way; thus reducing the dependency on mission-specific domain knowledge.</p>
<p>When no domain knowledge is available <italic>a priori</italic>, other methods could be used. For example, other possible approach could be to periodically assess the transferability of the generated control software during the design process (<xref ref-type="bibr" rid="B71">Koos&#xa0;et&#xa0;al., 2013</xref>). The design method will therefore solve a multi-objective optimization problem, in which both the performance in simulation and in reality are considered. Assessing the control software in reality is expensive in comparison to the assessment performed in simulation. Therefore, such a design method would need to also select which instances of control software are assessed on physical robots. An often-made assumption is that control software that results in similar behaviors in simulation will transfer similarly well into reality. Starting from this assumption, one could possibly restrict the assessment of control software on real robots to instances that are behaviorally novel<xref ref-type="fn" rid="fn2">
<sup>2</sup>
</xref>. Ideally, the assessment should be further limited to promising solutions that have the potential to perform well in reality. However, the overly strict application of this idea might result in design methods that risk overlooking solutions that perform worse in simulation but transfer well into reality.</p>
<p>A further improvement could be to include a secondary simulation context (<italic>pseudo-reality</italic>) to assess the transferability of the control software. Ligot and Birattari have shown that the effects of the reality gap can be reproduced in simulation-only experiments (<xref ref-type="bibr" rid="B80">Ligot and Birattari, 2020</xref>). If combined with other transferability techniques, pseudo-reality could offer an inexpensive context to quickly assess the transferability of many instances of control software. Periodically, some instances of control software are assessed on real robots to validate the results of the pseudo-reality context and to refine it, if necessary.</p>
<p>
<italic>How can we create online design methods for robot swarms?</italic>
</p>
<p>Online design does not face the reality gap problem, which makes it an interesting research direction. However, the online design of robot swarms still faces several challenges. Most notably, the robots in the swarm require a way to assess their own performance solely on the local information available to them.</p>
<p>Another important challenge is how to avoid endangering the robots while they are interacting in an unknown environment, without the need to implement safety features <italic>a priori</italic>. Ideally, one could imagine that a rather general baseline behavior (or a set of baseline behaviors) is designed offline in simulation. Once the swarm is deployed in the mission environment, the swarm would then use the baseline behavior as a starting point to design its control software for the specific mission. In the simplest case, the swarm might perform a tuning of the parameters of the control software to counteract the reality gap. In more advanced scenarios, the robots might choose and combine from a set of baseline control software to find an appropriate behavior for the mission on-the-fly, and then fine-tune the parameter of the resulting control software.</p>
<p>
<italic>How can we design control software for complex missions?</italic>
</p>
<p>While robot swarms have already been successfully employed in a wide variety of common abstract missions, these missions usually are too simple when compared to real-world applications. More complex missions could include those with multiple, possibly conflicting objectives, or missions with dynamic environments. It is well understood that the shaping of reward and objective functions is critical, as the design process is likely to exploit any unintended local optima of the objective function (<xref ref-type="bibr" rid="B26">Divband&#xa0;Soorati and Hamann, 2015</xref>; <xref ref-type="bibr" rid="B112">Silva&#xa0;et&#xa0;al., 2016</xref>). Further study is required to develop engineering techniques and patterns to define appropriate objective functions.</p>
<p>Alternatively, incremental evolution (<xref ref-type="bibr" rid="B51">Gomez and Miikkulainen, 1997</xref>) and curriculum learning (<xref ref-type="bibr" rid="B5">Bengio&#xa0;et&#xa0;al., 2009</xref>) might find application in swarm robotics. In these approaches, a complex task is decomposed into simpler ones. The design process designs control software in increasingly complex tasks, using the previously found instances of control software as starting points for the following designs.</p>
<p>Orthogonal to previously mentioned approaches is (cooperative) co-evolution (<xref ref-type="bibr" rid="B93">Nolfi and Floreano, 1998</xref>), in which multiple subgroups of robots are evolved independently of each other to cooperate or compete in the same environment. While it is not an approach directly applicable to homogeneous systems, this approach could be beneficial for the design of heterogeneous robot swarms.</p>
<p>
<italic>How can we design control software from other mission specifications than objective functions?</italic>
</p>
<p>As mentioned before, the choice of an objective function is not straightforward. With the problems of bootstrapping and deception present, the designer of an objective function requires not only domain knowledge of the task at hand, but also expertise in modeling collective behaviors as mathematical functions.</p>
<p>Novelty search has shown promising results to overcome some of these issues, however, it might lack some of the domain knowledge that can be introduced through the objective function, and that is required to obtain good performing control software. Quality-diversity algorithms combine the search for well-performing solutions commonly found in robot evolution with the exploratory search of novelty search (<xref ref-type="bibr" rid="B89">Mouret and Clune, 2015</xref>). Other approaches could include open-ended evolution or open-ended learning to generate varieties of different sophisticated swarm behaviors (<xref ref-type="bibr" rid="B118">Stanley&#xa0;et&#xa0;al., 2017</xref>; <xref ref-type="bibr" rid="B98">Packard&#xa0;et&#xa0;al., 2019</xref>).</p>
<p>Looking beyond swarm robotics, several different approaches in machine learning and evolutionary robotics have moved beyond mission-specific objective functions. For example, large language models are trained to predict the probability that a certain symbol follows the previous sequence of symbols, in an effort to imitate the texts encountered in the training set (<xref ref-type="bibr" rid="B104">Radford&#xa0;et&#xa0;al., 2019</xref>; <xref ref-type="bibr" rid="B21">Brown&#xa0;et&#xa0;al., 2020</xref>)<xref ref-type="fn" rid="fn3">
<sup>3</sup>
</xref>. Notably, language models are not trained on other desirable objectives except the imitation, such as grammatical correctness, reading comprehension, or trivia knowledge, yet perform well on benchmarks evaluating such objectives (<xref ref-type="bibr" rid="B21">Brown&#xa0;et&#xa0;al., 2020</xref>). In the context of swarm robotics, imitating examples obtained from nature might be also a viable approach to designing collective behaviors. Early works in the field were inspired by swarms in nature and often aimed at engineering artificial swarms that behaved similarly. Using imitation learning, it could be possible to automatically learn collective behaviors from swarms found in nature. Additionally, in single robot systems, another research direction makes use of demonstrations provided by human teachers (<xref ref-type="bibr" rid="B94">Osa&#xa0;et&#xa0;al., 2018</xref>; <xref ref-type="bibr" rid="B72">Krishnan&#xa0;et&#xa0;al., 2019</xref>). If these notions are applied to swarm robotics, a human teacher could demonstrate a desired collective behavior that is then used to learn the individual behavior of the robots.</p>
</sec>
<sec sec-type="conclusion" id="s6">
<title>6 Conclusion</title>
<p>The design problem in swarm robotics arises from the complexity of predicting the numerous interactions of the robots at design time. Automatic design of control software has shown to be a promising approach to tackle the design problem. However, it faces two major challenges: overcoming the reality gap and engineering appropriate objective functions. In this work, I first presented recent advances in the automatic design of control software for robot swarms. After, I discussed shortcomings of proposed approaches and provided perspectives on how to possibly overcome those.</p>
</sec>
</body>
<back>
<sec id="s7">
<title>Author contributions</title>
<p>JK performed the review and wrote the manuscript.</p>
</sec>
<sec id="s8">
<title>Funding</title>
<p>The project has received funding from the European Research Council (ERC) under the European Union&#x2019;s Horizon 2020 research and innovation programme (DEMIURGE Project, grant agreement No 681872); from Belgium&#x2019;s Wallonia-Brussels Federation through the ARC Advanced Project GbO&#x2013;Guaranteed by Optimization; and from the Belgian Fonds de la Recherche Scientifique&#x2013;FNRS <italic>via</italic> the cr&#xe9;dit d&#x2019;&#xe9;quippement SwarmSim. Jonas Kuckling acknowledges support from the Belgian Fonds de la Recherche Scientifique&#x2013;FNRS.</p>
</sec>
<ack>
<p>I would like to thank Mauro Birattari, David Garz&#xf3;n Ramos, Guillermo Legarda Herranz, and Ilyes Gharbi for their valuable discussions, which have shaped some of the ideas presented here.</p>
</ack>
<sec sec-type="COI-statement" id="s9">
<title>Conflict of interest</title>
<p>The author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s10">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<fn-group>
<fn id="fn1">
<label>1</label>
<p>Classically, a robot swarm is a homogeneous system&#x2014;i.e., all robots have the same capabilities and execute the same software. There have been examples of heterogeneous robot swarms (<xref ref-type="bibr" rid="B30">Dorigo&#xa0;et&#xa0;al., 2013</xref>), in which parts of the swarm are specialized in such a way that their role cannot be performed by some of the other robots in the swarm. Yet, in these examples, heterogeneous swarms are also redundant to some degree, as each role has at least several robots being able to perform it.</p>
</fn>
<fn id="fn2">
<label>2</label>
<p>Similar considerations as for novelty search and imitation learning&#x2014;regarding what metrics can be used to characterize a behavior&#x2014;apply also to this criterion.</p>
</fn>
<fn id="fn3">
<label>3</label>
<p>In the context of language models, a symbol is not necessarily only a character but could also be a representation of any other syntactic element, such as words.</p>
</fn>
</fn-group>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Abbeel</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Ng</surname>
<given-names>A. Y.</given-names>
</name>
</person-group> (<year>2004</year>). &#x201c;<article-title>Apprenticeship learning via inverse reinforcement learning</article-title>,&#x201d; in <source>Icml 2004</source>. Editor <person-group person-group-type="editor">
<name>
<surname>Brodley</surname>
<given-names>C.</given-names>
</name>
</person-group> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>). <pub-id pub-id-type="doi">10.1145/1015330.1015430</pub-id>
</citation>
</ref>
<ref id="B2">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Alharthi</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Abdallah</surname>
<given-names>Z. S.</given-names>
</name>
<name>
<surname>Hauert</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Understandable controller extraction from video observations of swarms</article-title>,&#x201d; in <conf-name>Swarm intelligence: 13th international conference, ANTS 2022</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>L&#xf3;pez-Ib&#xe1;&#xf1;ez</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Garc&#xed;a-Nieto</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Engelbrecht</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Pinciroli</surname>
<given-names>C.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>41</fpage>&#x2013;<lpage>53</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-031-20176-9_4</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Beal</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dulman</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Usbeck</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Viroli</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Correll</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2012</year>). &#x201c;<article-title>Organizing the aggregate: Languages for spatial computing</article-title>,&#x201d; in <source>Formal and practical aspects of domain-specific languages: Recent developments</source>. Editor <person-group person-group-type="editor">
<name>
<surname>Marjan</surname>
<given-names>M.</given-names>
</name>
</person-group> (<publisher-loc>Hershey, PA, USA</publisher-loc>: <publisher-name>IGI Global</publisher-name>), <fpage>436</fpage>&#x2013;<lpage>501</lpage>. <pub-id pub-id-type="doi">10.4018/978-1-4666-2092-6.ch016</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Beckers</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Holland</surname>
<given-names>O. E.</given-names>
</name>
<name>
<surname>Deneubourg</surname>
<given-names>J.-L.</given-names>
</name>
</person-group> (<year>1994</year>). &#x201c;<article-title>From local actions to global tasks: Stigmergy and collective robotics</article-title>,&#x201d; in <conf-name>Artificial life IV: Proceedings of the fourth international workshop on the synthesis and simulation of living systems</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Brooks</surname>
<given-names>R. A.</given-names>
</name>
<name>
<surname>Maes</surname>
<given-names>P.</given-names>
</name>
</person-group> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>181</fpage>&#x2013;<lpage>189</lpage>. <pub-id pub-id-type="doi">10.7551/mitpress/1428.003.0022</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Bengio</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Louradour</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Collobert</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Weston</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2009</year>). &#x201c;<article-title>Curriculum learning</article-title>,&#x201d; in <conf-name>ICML&#x2019;09 proceedings of the 26th annual international conference on machine learning</conf-name> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>41</fpage>&#x2013;<lpage>48</lpage>. <pub-id pub-id-type="doi">10.1145/1553374.1553380</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Beni</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>From swarm intelligence to swarm robotics</article-title>,&#x201d; in <conf-name>Swarm robotics: SAB 2004 international workshop</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Spears</surname>
<given-names>W. M.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>1</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-30552-1_1</pub-id>
</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Berman</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Hal&#xe1;sz</surname>
<given-names>&#xc1;. M.</given-names>
</name>
<name>
<surname>Hsieh</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Optimized stochastic policies for task allocation in swarms of robots</article-title>. <source>IEEE Trans. Robotics</source> <volume>25</volume>, <fpage>927</fpage>&#x2013;<lpage>937</lpage>. <pub-id pub-id-type="doi">10.1109/TRO.2009.2024997</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Berman</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Nagpal</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2011</year>). &#x201c;<article-title>Design of control policies for spatially inhomogeneous robot swarms with application to commercial pollination</article-title>,&#x201d; in <conf-name>2011 IEEE international conference on robotics and automation (ICRA)</conf-name> (<publisher-loc>Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>378</fpage>&#x2013;<lpage>385</lpage>. <pub-id pub-id-type="doi">10.1109/ICRA.2011.5980440</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bianco</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2004</year>). <article-title>Toward open-ended evolutionary robotics: Evolving elementary robotic units able to self-assemble and self-reproduce</article-title>. <source>Connect. Sci.</source> <volume>16</volume>, <fpage>227</fpage>&#x2013;<lpage>248</lpage>. <pub-id pub-id-type="doi">10.1080/09540090412331314759</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bozhinoski</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Brambilla</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Francesca</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Garattoni</surname>
<given-names>L.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Automatic off-line design of robot swarms: A manifesto</article-title>. <source>Front. Robotics AI</source> <volume>6</volume>, <fpage>59</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2019.00059</pub-id>
</citation>
</ref>
<ref id="B11">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Francesca</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>AutoMoDe: A modular approach to the automatic off-line design and fine-tuning of control software for robot swarms</article-title>,&#x201d; in <source>Automated design of machine learning and search algorithms</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Pillay</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Qu</surname>
<given-names>R.</given-names>
</name>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>73</fpage>&#x2013;<lpage>90</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-72069-8_5</pub-id>
</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hasselmann</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Disentangling automatic and semi-automatic approaches to the optimization-based design of control software for robot swarms</article-title>. <source>Nat. Mach. Intell.</source> <volume>2</volume>, <fpage>494</fpage>&#x2013;<lpage>499</lpage>. <pub-id pub-id-type="doi">10.1038/s42256-020-0215-0</pub-id>
</citation>
</ref>
<ref id="B13">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Bloom</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Mukherjee</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Pinciroli</surname>
<given-names>C.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>A study of reinforcement learning algorithms for aggregates of minimalistic robots</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://arxiv.org/abs/2203.15129">https://arxiv.org/abs/2203.15129</ext-link>
</comment>.</citation>
</ref>
<ref id="B14">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bongard</surname>
<given-names>J. C.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Evolutionary robotics</article-title>. <source>Commun. ACM</source> <volume>56</volume>, <fpage>74</fpage>&#x2013;<lpage>83</lpage>. <pub-id pub-id-type="doi">10.1145/2493883</pub-id>
</citation>
</ref>
<ref id="B15">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Bongard</surname>
<given-names>J. C.</given-names>
</name>
<name>
<surname>Lipson</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2004</year>). &#x201c;<article-title>Once more unto the breach: Co-evolving a robot and its simulator</article-title>,&#x201d; in <conf-name>Artificial life IX: Proceedings of the ninth international conference on the simulation and synthesis of living systems</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Pollack</surname>
<given-names>J. B.</given-names>
</name>
<name>
<surname>Bedau</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Husbands</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Watson</surname>
<given-names>R. A.</given-names>
</name>
<name>
<surname>Ikegami</surname>
<given-names>T.</given-names>
</name>
</person-group> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>57</fpage>&#x2013;<lpage>62</lpage>. <pub-id pub-id-type="doi">10.7551/mitpress/1429.003.0011</pub-id>
</citation>
</ref>
<ref id="B16">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brambilla</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Brutschy</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Property-driven design for swarm robotics: A design method based on prescriptive modeling and model checking</article-title>. <source>ACM Trans. Aut. Adapt. Syst.</source> <volume>9</volume>, <fpage>1</fpage>&#x2013;<lpage>28</lpage>. <pub-id pub-id-type="doi">10.1145/2700318</pub-id>
</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Brambilla</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ferrante</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Swarm robotics: A review from the swarm engineering perspective</article-title>. <source>Swarm Intell.</source> <volume>7</volume>, <fpage>1</fpage>&#x2013;<lpage>41</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-012-0075-2</pub-id>
</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bredeche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Fontbonne</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Social learning in swarm robotics</article-title>. <source>Philosophical Trans. R. Soc. Lond. Ser. B Biol. Sci.</source> <volume>377</volume>, <fpage>20200309</fpage>. <pub-id pub-id-type="doi">10.1098/rstb.2020.0309</pub-id>
</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bredeche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Haasdijk</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Prieto</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Embodied evolution in collective robotics: A review</article-title>. <source>Front. Robotics AI</source> <volume>5</volume>, <fpage>12</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2018.00012</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Bredeche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Montanier</surname>
<given-names>J.-M.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Winfield</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2012</year>). <article-title>Environment-driven distributed evolutionary adaptation in a population of autonomous robotic agents</article-title>. <source>Math. Comput. Model. Dyn. Syst.</source> <volume>18</volume>, <fpage>101</fpage>&#x2013;<lpage>129</lpage>. <pub-id pub-id-type="doi">10.1080/13873954.2011.601425</pub-id>
</citation>
</ref>
<ref id="B21">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Brown</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Mann</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Ryder</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Subbiah</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kaplan</surname>
<given-names>J. D.</given-names>
</name>
<name>
<surname>Dhariwal</surname>
<given-names>P.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). &#x201c;<article-title>Language models are few-shot learners</article-title>,&#x201d; in <conf-name>Advances in neural information processing systems 33 (NeurIPS 2020)</conf-name> (<publisher-loc>Vancouver, Canada</publisher-loc>: <publisher-name>Curran Associates, Inc.</publisher-name>), <fpage>1877</fpage>&#x2013;<lpage>1901</lpage>.</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cambier</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Albani</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Fr&#xe9;mont</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Ferrante</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Cultural evolution of probabilistic aggregation in synthetic swarms</article-title>. <source>Appl. Soft Comput.</source> <volume>113</volume>, <fpage>108010</fpage>. <pub-id pub-id-type="doi">10.1016/j.asoc.2021.108010</pub-id>
</citation>
</ref>
<ref id="B23">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Cambier</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ferrante</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>AutoMoDe-pomodoro: An evolutionary class of modular designs</article-title>,&#x201d; in <conf-name>GECCO&#x2019;22: Proceedings of the genetic and evolutionary computation conference</conf-name>. Editor <person-group person-group-type="editor">
<name>
<surname>Fieldsend</surname>
<given-names>J. E.</given-names>
</name>
</person-group> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>100</fpage>&#x2013;<lpage>103</lpage>. <pub-id pub-id-type="doi">10.1145/3520304.3529031</pub-id>
</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Carrillo-Zapata</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Milner</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Hird</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Tzoumas</surname>
<given-names>P. J.</given-names>
</name>
<name>
<surname>GeorgiosVardanegaSooriyabandara</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Giuliani</surname>
<given-names>M.</given-names>
</name>
<etal/>
</person-group> (<year>2020</year>). <article-title>Mutual shaping in swarm robotics: User studies in fire and rescue, storage organization, and bridge inspection</article-title>. <source>Front. Robotics AI</source> <volume>7</volume>, <fpage>53</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2020.00053</pub-id>
</citation>
</ref>
<ref id="B25">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Colledanchise</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>&#xd6;gren</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Behavior trees in robotics and AI: An introduction</article-title>,&#x201d; in <source>Chapman &#x26; Hall/CRC artificial intelligence and robotics series</source>. <edition>first edn</edition> (<publisher-loc>Boca Raton, FL, USA</publisher-loc>: <publisher-name>CRC Press</publisher-name>). <pub-id pub-id-type="doi">10.1201/9780429489105</pub-id>
</citation>
</ref>
<ref id="B26">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Divband Soorati</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>The effect of fitness function design on performance in evolutionary robotics: The influence of a priori knowledge</article-title>,&#x201d; in <conf-name>GECCO&#x2019;15: Proceedings of the 2015 annual conference on genetic and evolutionary computation</conf-name>. Editor <person-group person-group-type="editor">
<name>
<surname>Silva</surname>
<given-names>S.</given-names>
</name>
</person-group> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>153</fpage>&#x2013;<lpage>160</lpage>. <pub-id pub-id-type="doi">10.1145/2739480.2754676</pub-id>
</citation>
</ref>
<ref id="B27">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Doncieux</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Bredeche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Mouret</surname>
<given-names>J.-B.</given-names>
</name>
<name>
<surname>Eiben</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Evolutionary robotics: What, why, and where to</article-title>. <source>Front. Robotics AI</source> <volume>2</volume>, <fpage>4</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2015.00004</pub-id>
</citation>
</ref>
<ref id="B28">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Doncieux</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Mouret</surname>
<given-names>J.-B.</given-names>
</name>
<name>
<surname>Bredeche</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Padois</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2011</year>). &#x201c;<article-title>Evolutionary robotics: Exploring new horizons</article-title>,&#x201d; in <conf-name>New horizons in evolutionary robotics: Extended contributions from the 2009 EvoDeRob Workshop</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>St&#xe9;phane Doncieux</surname>
<given-names>J.-B. M.</given-names>
</name>
<name>
<surname>Bred&#xe8;che</surname>
<given-names>Nicolas</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>1055</fpage>&#x2013;<lpage>1062</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-18272-3_1</pub-id>
</citation>
</ref>
<ref id="B29">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Brambilla</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Swarm robotics</article-title>. <source>Scholarpedia</source> <volume>9</volume>, <fpage>1463</fpage>. <pub-id pub-id-type="doi">10.4249/scholarpedia.1463</pub-id>
</citation>
</ref>
<ref id="B30">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Floreano</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Gambardella</surname>
<given-names>L. M.</given-names>
</name>
<name>
<surname>Mondada</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Baaboura</surname>
<given-names>T.</given-names>
</name>
<etal/>
</person-group> (<year>2013</year>). <article-title>Swarmanoid: A novel concept for the study of heterogeneous robotic swarms</article-title>. <source>IEEE Robotics Automation Mag.</source> <volume>20</volume>, <fpage>60</fpage>&#x2013;<lpage>71</lpage>. <pub-id pub-id-type="doi">10.1109/MRA.2013.2252996</pub-id>
</citation>
</ref>
<ref id="B31">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Theraulaz</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Reflections on the future of swarm robotics</article-title>. <source>Sci. Robotics</source> <volume>5</volume>, <fpage>eabe4385</fpage>. <pub-id pub-id-type="doi">10.1126/scirobotics.abe4385</pub-id>
</citation>
</ref>
<ref id="B32">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Labella</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>ThomasBaldassarre</surname>
<given-names>G.</given-names>
</name>
<etal/>
</person-group> (<year>2003</year>). <article-title>Evolving self-organizing behaviors for a Swarm-bot</article-title>. <source>Aut. Robots</source> <volume>17</volume>, <fpage>223</fpage>&#x2013;<lpage>245</lpage>. <pub-id pub-id-type="doi">10.1023/B:AURO.0000033973.24945.f3</pub-id>
</citation>
</ref>
<ref id="B33">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Dosieah</surname>
<given-names>G. Y.</given-names>
</name>
<name>
<surname>&#xd6;zdemir</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Moving mixtures of active and passive elements with robots that do not compute</article-title>,&#x201d; in <source>Ants 2022: Swarm intelligence</source> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>183</fpage>&#x2013;<lpage>195</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-031-20176-9_15</pub-id>
</citation>
</ref>
<ref id="B34">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Duarte</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Costa</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Rodrigues</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Silva</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Oliveira</surname>
<given-names>S. M.</given-names>
</name>
<etal/>
</person-group> (<year>2016</year>). <article-title>Evolution of collective behaviors for a real swarm of aquatic surface robots</article-title>. <source>PLOS ONE</source> <volume>11</volume>, <fpage>e0151834</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0151834</pub-id>
</citation>
</ref>
<ref id="B35">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Duarte</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Oliveira</surname>
<given-names>S. M.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Hybrid control for large swarms of aquatic drones</article-title>,&#x201d; in <conf-name>Alife 14: The fourteenth international conference on the synthesis and simulation of living systems</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Sayama</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Rieffel</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Risi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Doursat</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Lipson</surname>
<given-names>H.</given-names>
</name>
</person-group> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>785</fpage>&#x2013;<lpage>792</lpage>. <pub-id pub-id-type="doi">10.7551/978-0-262-32621-6-ch105</pub-id>
</citation>
</ref>
<ref id="B36">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ferrante</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Turgut</surname>
<given-names>A. E.</given-names>
</name>
<name>
<surname>Du&#xe9;&#xf1;ez-Guzm&#xe1;n</surname>
<given-names>E. A.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Wenseleers</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Evolution of self-organized task specialization in robot swarms</article-title>. <source>PLOS Comput. Biol.</source> <volume>11</volume>, <fpage>e1004273</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pcbi.1004273</pub-id>
</citation>
</ref>
<ref id="B37">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Francesca</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Automatic design of robot swarms: Achievements and challenges</article-title>. <source>Front. Robotics AI</source> <volume>3</volume>, <fpage>1</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.3389/frobt.2016.00029</pub-id>
</citation>
</ref>
<ref id="B38">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Francesca</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Brambilla</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Brutschy</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>AutoMoDe: A novel approach to the automatic design of control software for robot swarms</article-title>. <source>Swarm Intell.</source> <volume>8</volume>, <fpage>89</fpage>&#x2013;<lpage>112</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-014-0092-4</pub-id>
</citation>
</ref>
<ref id="B39">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Friston</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>The free-energy principle: A unified brain theory?</article-title> <source>Nat. Rev. Neurosci.</source> <volume>11</volume>, <fpage>127</fpage>&#x2013;<lpage>138</lpage>. <pub-id pub-id-type="doi">10.1038/nrn2787</pub-id>
</citation>
</ref>
<ref id="B40">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Garattoni</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Autonomous task sequencing in a robot swarm</article-title>. <source>Sci. Robotics</source> <volume>3</volume>, <fpage>eaat0430</fpage>. <pub-id pub-id-type="doi">10.1126/scirobotics.aat0430</pub-id>
</citation>
</ref>
<ref id="B41">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Garz&#xf3;n Ramos</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Automatic design of collective behaviors for robots that can display and perceive colors</article-title>. <source>Appl. Sci.</source> <volume>10</volume>, <fpage>4654</fpage>. <pub-id pub-id-type="doi">10.3390/app10134654</pub-id>
</citation>
</ref>
<ref id="B42">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dodd</surname>
<given-names>T. J.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2014a</year>). &#x201c;<article-title>Evolving aggregation behaviors in multi-robot systems with binary sensors</article-title>,&#x201d; in <conf-name>Distributed autonomous robotic systems: The 11th international symposium</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Hsieh</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Chirikjian</surname>
<given-names>G.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>355</fpage>&#x2013;<lpage>367</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-55146-8_25</pub-id>
</citation>
</ref>
<ref id="B43">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Dodd</surname>
<given-names>T. J.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2014b</year>). &#x201c;<article-title>Clustering objects with robots that do not compute</article-title>,&#x201d; in <conf-name>Aamas &#x2019;14: Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems</conf-name> (<publisher-loc>Richland, SC, USA</publisher-loc>: <publisher-name>International Foundation for Autonomous Agents and Multiagent Systems</publisher-name>), <fpage>421</fpage>&#x2013;<lpage>428</lpage>.</citation>
</ref>
<ref id="B44">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gharbi</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ramos</surname>
<given-names>D. G.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Show me what you want: Inverse reinforcement learning to automatically design robot swarms by demonstration</article-title>. <comment>Submitted for publication</comment>.</citation>
</ref>
<ref id="B45">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Glasmachers</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Schaul</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Wierstra</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Schmidhuber</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2010</year>). &#x201c;<article-title>Exponential natural evolution strategies</article-title>,&#x201d; in <conf-name>GECCO&#x2019;10: Proceedings of the 12th annual conference on Genetic and evolutionary computation</conf-name> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>393</fpage>&#x2013;<lpage>400</lpage>. <pub-id pub-id-type="doi">10.1145/1830483.1830557</pub-id>
</citation>
</ref>
<ref id="B46">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Task-agnostic evolution of diverse repertoires of swarm behaviours</article-title>,&#x201d; in <conf-name>Swarm intelligence: 11th international conference, ANTS 2018</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Blum</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
<name>
<surname>Reina</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>225</fpage>&#x2013;<lpage>238</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-00533-7_18</pub-id>
</citation>
</ref>
<ref id="B47">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Mariano</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Challenges in cooperative coevolution of physically heterogeneous robot teams</article-title>. <source>Nat. Comput.</source> <volume>18</volume>, <fpage>29</fpage>&#x2013;<lpage>46</lpage>. <pub-id pub-id-type="doi">10.1007/s11047-016-9582-1</pub-id>
</citation>
</ref>
<ref id="B48">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Mariano</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Novelty-driven cooperative coevolution</article-title>. <source>Evol. Comput.</source> <volume>25</volume>, <fpage>275</fpage>&#x2013;<lpage>307</lpage>. <pub-id pub-id-type="doi">10.1162/EVCO_a_00173</pub-id>
</citation>
</ref>
<ref id="B49">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Mariano</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Systematic derivation of behaviour characterisations in evolutionary robotics</article-title>,&#x201d; in <conf-name>Alife 14: The fourteenth international conference on the synthesis and simulation of living systems</conf-name> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>212</fpage>&#x2013;<lpage>219</lpage>. <pub-id pub-id-type="doi">10.7551/978-0-262-32621-6-ch036</pub-id>
</citation>
</ref>
<ref id="B50">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gomes</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Urbano</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Evolution of swarm robotics systems with novelty search</article-title>. <source>Swarm Intell.</source> <volume>7</volume>, <fpage>115</fpage>&#x2013;<lpage>144</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-013-0081-z</pub-id>
</citation>
</ref>
<ref id="B51">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gomez</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Miikkulainen</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Incremental evolution of complex general behavior</article-title>. <source>Adapt. Behav.</source> <volume>5</volume>, <fpage>317</fpage>&#x2013;<lpage>342</lpage>. <pub-id pub-id-type="doi">10.1177/105971239700500305</pub-id>
</citation>
</ref>
<ref id="B52">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Halloy</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Sempo</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Caprari</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Rivault</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Asadpour</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>T&#xe2;che</surname>
<given-names>F.</given-names>
</name>
<etal/>
</person-group> (<year>2007</year>). <article-title>Social integration of robots into groups of cockroaches to control self-organized choices</article-title>. <source>Science</source> <volume>318</volume>, <fpage>1155</fpage>&#x2013;<lpage>1158</lpage>. <pub-id pub-id-type="doi">10.1126/science.1144259</pub-id>
</citation>
</ref>
<ref id="B53">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Evolution of collective behaviors by minimizing surprise</article-title>,&#x201d; in <conf-name>Alife 14: The fourteenth international conference on the synthesis and simulation of living systems</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Sayama</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Rieffel</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Risi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Doursat</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Lipson</surname>
<given-names>H.</given-names>
</name>
</person-group> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>344</fpage>&#x2013;<lpage>351</lpage>. <pub-id pub-id-type="doi">10.1162/978-0-262-32621-6-ch055</pub-id>
</citation>
</ref>
<ref id="B54">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2018</year>). <source>Swarm robotics: A formal approach</source>. <publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-3-319-74528-2</pub-id>
</citation>
</ref>
<ref id="B55">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>W&#xf6;rn</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2008</year>). <article-title>A framework of space&#x2013;time continuous models for algorithm design in swarm robotics</article-title>. <source>Swarm Intell.</source> <volume>2</volume>, <fpage>209</fpage>&#x2013;<lpage>239</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-008-0015-3</pub-id>
</citation>
</ref>
<ref id="B56">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hansen</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ostermeier</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2001</year>). <article-title>Completely derandomized self-adaptation in evolution strategies</article-title>. <source>Evol. Comput.</source> <volume>9</volume>, <fpage>159</fpage>&#x2013;<lpage>195</lpage>. <pub-id pub-id-type="doi">10.1162/106365601750190398</pub-id>
</citation>
</ref>
<ref id="B57">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hasselmann</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Modular automatic design of collective behaviors for robots endowed with local communication capabilities</article-title>. <source>PeerJ Comput. Sci.</source> <volume>6</volume>, <fpage>e291</fpage>. <pub-id pub-id-type="doi">10.7717/peerj-cs.291</pub-id>
</citation>
</ref>
<ref id="B58">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hasselmann</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2023</year>). <article-title>Towards the automatic design of automatic methods for the design of robot swarms</article-title>. <comment>Submitted for journal publication</comment>.</citation>
</ref>
<ref id="B59">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hasselmann</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ruddick</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Empirical assessment and comparison of neuro-evolutionary methods for the automatic off-line design of robot swarms</article-title>. <source>Nat. Commun.</source> <volume>12</volume>, <fpage>4345</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-021-24642-3</pub-id>
</citation>
</ref>
<ref id="B60">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Hecker</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Letendre</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Stolleis</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Washington</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Moses</surname>
<given-names>M. E.</given-names>
</name>
</person-group> (<year>2012</year>). &#x201c;<article-title>Formica ex machina: Ant swarm foraging from physical to virtual and back again</article-title>,&#x201d; in <conf-name>Swarm intelligence: 8th international conference, ANTS 2012</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Blum</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
<name>
<surname>Engelbrecht</surname>
<given-names>A. P.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>252</fpage>&#x2013;<lpage>259</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-642-32650-9_25</pub-id>
</citation>
</ref>
<ref id="B61">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Heinerman</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Rango</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Eiben</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2015</year>). &#x201c;<article-title>Evolution, individual learning, and social learning in a swarm of real robots</article-title>,&#x201d; in <conf-name>2015 IEEE symposium series on computational intelligence, SSCI 2015</conf-name> (<publisher-loc>Los Alamitos, CA, USA</publisher-loc>: <publisher-name>IEEE Computer Society</publisher-name>), <fpage>1055</fpage>&#x2013;<lpage>1062</lpage>. <pub-id pub-id-type="doi">10.1109/SSCI.2015.152</pub-id>
</citation>
</ref>
<ref id="B62">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Husbands</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Harvey</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>1992</year>). &#x201c;<article-title>Evolution versus design: Controlling autonomous robots</article-title>,&#x201d; in <conf-name>Proceedings of the third annual conference of AI, simulation, and planning in high autonomy systems &#x2019;integrating perception, planning and action&#x2019;</conf-name> (<publisher-loc>Los Alamitos, CA, USA</publisher-loc>: <publisher-name>IEEE Computer Society</publisher-name>), <fpage>139</fpage>&#x2013;<lpage>146</lpage>. <pub-id pub-id-type="doi">10.1109/AIHAS.1992.636878</pub-id>
</citation>
</ref>
<ref id="B63">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>H&#xfc;ttenrauch</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>&#x160;o&#x161;i&#x107;</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Neumann</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Deep reinforcement learning for swarm systems</article-title>. <source>J. Mach. Learn. Res.</source> <volume>20</volume>, <fpage>1</fpage>&#x2013;<lpage>31</lpage>.</citation>
</ref>
<ref id="B64">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jakobi</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Evolutionary robotics and the radical envelope-of-noise hypothesis</article-title>. <source>Adapt. Behav.</source> <volume>6</volume>, <fpage>325</fpage>&#x2013;<lpage>368</lpage>. <pub-id pub-id-type="doi">10.1177/105971239700600205</pub-id>
</citation>
</ref>
<ref id="B65">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Jones</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Studley</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hauert</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Winfield</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Evolving behaviour trees for swarm robotics</article-title>,&#x201d; in <conf-name>Distributed autonomous robotic systems: The 13th international symposium</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Kolling</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Berman</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Frazzoli</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Martinoli</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Matsuno</surname>
<given-names>F.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>487</fpage>&#x2013;<lpage>501</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-319-73008-0_34</pub-id>
</citation>
</ref>
<ref id="B66">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Jones</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Winfield</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hauert</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Studley</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Onboard evolution of understandable swarm behaviors</article-title>. <source>Adv. Intell. Syst.</source> <volume>1</volume>, <fpage>1900031</fpage>. <pub-id pub-id-type="doi">10.1002/aisy.201900031</pub-id>
</citation>
</ref>
<ref id="B67">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kaelbling</surname>
<given-names>L. P.</given-names>
</name>
<name>
<surname>Littman</surname>
<given-names>M. L.</given-names>
</name>
<name>
<surname>Moore</surname>
<given-names>A. W.</given-names>
</name>
</person-group> (<year>1996</year>). <article-title>Reinforcement learning: A survey</article-title>. <source>J. Artif. Intell. Res.</source> <volume>4</volume>, <fpage>237</fpage>&#x2013;<lpage>285</lpage>. <pub-id pub-id-type="doi">10.1613/jair.301</pub-id>
</citation>
</ref>
<ref id="B68">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kaiser</surname>
<given-names>T. K.</given-names>
</name>
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Engineered self-organization for resilient robot self-assembly with minimal surprise</article-title>. <source>Robotics Aut. Syst.</source> <volume>122</volume>, <fpage>103293</fpage>. <pub-id pub-id-type="doi">10.1016/j.robot.2019.103293</pub-id>
</citation>
</ref>
<ref id="B69">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kazadi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>Model independence in swarm robotics</article-title>. <source>Int. J. Intelligent Comput. Cybern.</source> <volume>2</volume>, <fpage>672</fpage>&#x2013;<lpage>694</lpage>. <pub-id pub-id-type="doi">10.1108/17563780911005836</pub-id>
</citation>
</ref>
<ref id="B70">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kober</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Bagnell</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Peters</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>Reinforcement learning in robotics: A survey</article-title>. <source>Int. J. Robotics Res.</source> <volume>32</volume>, <fpage>1238</fpage>&#x2013;<lpage>1274</lpage>. <pub-id pub-id-type="doi">10.1177/0278364913495721</pub-id>
</citation>
</ref>
<ref id="B71">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Koos</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Mouret</surname>
<given-names>J.-B.</given-names>
</name>
<name>
<surname>Doncieux</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2013</year>). <article-title>The transferability approach: Crossing the reality gap in evolutionary robotics</article-title>. <source>IEEE Trans. Evol. Comput.</source> <volume>17</volume>, <fpage>122</fpage>&#x2013;<lpage>145</lpage>. <pub-id pub-id-type="doi">10.1109/TEVC.2012.2185849</pub-id>
</citation>
</ref>
<ref id="B72">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Krishnan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Garg</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Liaw</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Thananjeyan</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Miller</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Pokorny</surname>
<given-names>F. T.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Swirl: A sequential windowed inverse reinforcement learning algorithm for robot tasks with delayed rewards</article-title>. <source>Int. J. Robot. Res.</source> <volume>38</volume>, <fpage>126</fpage>&#x2013;<lpage>145</lpage>. <pub-id pub-id-type="doi">10.1177/0278364918784350</pub-id>
</citation>
</ref>
<ref id="B73">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Bozhinoski</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2018</year>). &#x201c;<article-title>Behavior trees as a control architecture in the automatic modular design of robot swarms</article-title>,&#x201d; in <conf-name>Swarm intelligence: 11th international conference, ANTS 2018</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Blum</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
<name>
<surname>Reina</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>30</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-00533-7_3</pub-id>
</citation>
</ref>
<ref id="B74">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>St&#xfc;tzle</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020a</year>). <article-title>Iterative improvement in the automatic modular design of robot swarms</article-title>. <source>PeerJ Comput. Sci.</source> <volume>6</volume>, <fpage>e322</fpage>. <pub-id pub-id-type="doi">10.7717/peerj-cs.322</pub-id>
</citation>
</ref>
<ref id="B75">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Ubeda Arriaza</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020b</year>). &#x201c;<article-title>AutoMoDe-IcePop: Automatic modular design of control software for robot swarms using simulated annealing</article-title>,&#x201d; in <source>Artificial intelligence and machine learning: Bnaic 2019, benelearn 2019</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Bogaerts</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Bontempi</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Geurts</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Harley</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Lebichot</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Lenaerts</surname>
<given-names>T.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>3</fpage>&#x2013;<lpage>17</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-65154-1_1</pub-id>
</citation>
</ref>
<ref id="B76">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>van Pelt</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>AutoMoDe-cedrata: Automatic design of behavior trees for controlling a swarm of robots with communication capabilities</article-title>. <source>SN Comput. Sci.</source> <volume>3</volume>, <fpage>136</fpage>. <pub-id pub-id-type="doi">10.1007/s42979-021-00988-9</pub-id>
</citation>
</ref>
<ref id="B77">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lehman</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Stanley</surname>
<given-names>K. O.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Abandoning objectives: Evolution through the search for novelty alone</article-title>. <source>Evol. Comput.</source> <volume>19</volume>, <fpage>189</fpage>&#x2013;<lpage>223</lpage>. <pub-id pub-id-type="doi">10.1162/EVCO_a_00025</pub-id>
</citation>
</ref>
<ref id="B78">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Batra</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Brown</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Chang</surname>
<given-names>H.-D.</given-names>
</name>
<name>
<surname>Ranganathan</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Hoberman</surname>
<given-names>C.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Particle robotics based on statistical mechanics of loosely coupled components</article-title>. <source>Nature</source> <volume>567</volume>, <fpage>361</fpage>&#x2013;<lpage>365</lpage>. <pub-id pub-id-type="doi">10.1038/s41586-019-1022-9</pub-id>
</citation>
</ref>
<ref id="B79">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Turing learning: A metric-free approach to inferring behavior and its application to swarms</article-title>. <source>Swarm Intell.</source> <volume>10</volume>, <fpage>211</fpage>&#x2013;<lpage>243</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-016-0126-1</pub-id>
</citation>
</ref>
<ref id="B80">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Simulation-only experiments to mimic the effects of the reality gap in the automatic design of robot swarms</article-title>. <source>Swarm Intell.</source> <volume>14</volume>, <fpage>1</fpage>&#x2013;<lpage>24</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-019-00175-w</pub-id>
</citation>
</ref>
<ref id="B81">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hasselmann</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020a</year>). &#x201c;<article-title>AutoMoDe-arlequin: Neural networks as behavioral modules for the automatic design of probabilistic finite state machines</article-title>,&#x201d; in <conf-name>Swarm intelligence: 12th international conference, ANTS 2020</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>St&#xfc;tzle</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Blesa</surname>
<given-names>M. J.</given-names>
</name>
<name>
<surname>Blum</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Hamann</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Heinrich</surname>
<given-names>M. K.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>109</fpage>&#x2013;<lpage>122</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-60376-2_21</pub-id>
</citation>
</ref>
<ref id="B82">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Kuckling</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Bozhinoski</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020b</year>). <article-title>Automatic modular design of robot swarms using behavior trees as a control architecture</article-title>. <source>PeerJ Comput. Sci.</source> <volume>6</volume>, <fpage>e314</fpage>. <pub-id pub-id-type="doi">10.7717/peerj-cs.314</pub-id>
</citation>
</ref>
<ref id="B83">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Lopes</surname>
<given-names>Y. K.</given-names>
</name>
<name>
<surname>Trenkwalder</surname>
<given-names>S. M.</given-names>
</name>
<name>
<surname>Leal</surname>
<given-names>A. B.</given-names>
</name>
<name>
<surname>Dodd</surname>
<given-names>T. J.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Supervisory control theory applied to swarm robotics</article-title>. <source>Swarm Intell.</source> <volume>10</volume>, <fpage>65</fpage>&#x2013;<lpage>97</lpage>. <pub-id pub-id-type="doi">10.1007/s11721-016-0119-0</pub-id>
</citation>
</ref>
<ref id="B84">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Matari&#x107;</surname>
<given-names>M. J.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Reinforcement learning in the multi-robot domain</article-title>. <source>Aut. Robots</source> <volume>4</volume>, <fpage>73</fpage>&#x2013;<lpage>83</lpage>. <pub-id pub-id-type="doi">10.1023/A:1008819414322</pub-id>
</citation>
</ref>
<ref id="B85">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Matari&#x107;</surname>
<given-names>M. J.</given-names>
</name>
</person-group> (<year>1998</year>). <article-title>Using communication to reduce locality in distributed multi-agent learning</article-title>. <source>J. Exp. Theor. Artif. Intell.</source> <volume>10</volume>, <fpage>357</fpage>&#x2013;<lpage>369</lpage>. <pub-id pub-id-type="doi">10.1080/095281398146806</pub-id>
</citation>
</ref>
<ref id="B86">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mathews</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
<name>
<surname>O&#x2019;Grady</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Mondada</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Mergeable nervous systems for robots</article-title>. <source>Nat. Commun.</source> <volume>8</volume>, <fpage>439</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-017-00109-2</pub-id>
</citation>
</ref>
<ref id="B87">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mendiburu</surname>
<given-names>F. J.</given-names>
</name>
<name>
<surname>Garz&#xf3;n Ramos</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Morais</surname>
<given-names>M. R. A.</given-names>
</name>
<name>
<surname>Lima</surname>
<given-names>A. M. N.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>AutoMoDe-mate: Automatic off-line design of spatially-organizing behaviors for robot swarms</article-title>. <source>Swarm Evol. Comput.</source> <volume>74</volume>, <fpage>101118</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2022.101118</pub-id>
</citation>
</ref>
<ref id="B88">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Mondada</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Bonani</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Raemy</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Pugh</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cianci</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Klaptocz</surname>
<given-names>A.</given-names>
</name>
<etal/>
</person-group> (<year>2009</year>). &#x201c;<article-title>The e-puck, a robot designed for education in engineering</article-title>,&#x201d; in <conf-name>Robotica 2009: Proceedings of the 9th conference on autonomous robot systems and competitions</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Gon&#xe7;alves</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Torres</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Alves</surname>
<given-names>C.</given-names>
</name>
</person-group> (<publisher-loc>Castelo Branco, Portugal</publisher-loc>: <publisher-name>Instituto Polit&#xe9;cnico de Castelo Branco</publisher-name>), <fpage>59</fpage>&#x2013;<lpage>65</lpage>.</citation>
</ref>
<ref id="B89">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Mouret</surname>
<given-names>J.-B.</given-names>
</name>
<name>
<surname>Clune</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Illuminating search spaces by mapping elites</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="http://arxiv.org/abs/1504.04909">http://arxiv.org/abs/1504.04909</ext-link>
</comment>.</citation>
</ref>
<ref id="B90">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Neupane</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Goodrich</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Learning swarm behaviors using grammatical evolution and behavior trees</article-title>,&#x201d; in <conf-name>Proceedings of the twenty-eighth international joint conference on artificial intelligence, IJCAI-19</conf-name>. Editor <person-group person-group-type="editor">
<name>
<surname>Kraus</surname>
<given-names>S.</given-names>
</name>
</person-group> (<publisher-loc>CA, USA</publisher-loc>: <publisher-name>IJCAI Organization</publisher-name>), <fpage>513</fpage>&#x2013;<lpage>520</lpage>. <pub-id pub-id-type="doi">10.24963/ijcai.2019/73</pub-id>
</citation>
</ref>
<ref id="B91">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2021</year>). <source>Behavioral and cognitive robotics: An adaptive perspective</source>. <publisher-loc>Rome, Italy</publisher-loc>: <publisher-name>Institute of Cognitive Sciences and Technologies, National Research Council</publisher-name>.</citation>
</ref>
<ref id="B92">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Floreano</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2000</year>). <source>Evolutionary robotics: The biology, intelligence, and technology of self-organizing machines</source>. <edition>first edn.</edition> <publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>.</citation>
</ref>
<ref id="B93">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Floreano</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>1998</year>). &#x201c;<article-title>How co-evolution can enhance the adaptive power of artificial evolution: Implications for evolutionary robotics</article-title>,&#x201d; in <source>EvoRobots 1998: Evolutionary robotics</source> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>22</fpage>&#x2013;<lpage>38</lpage>. <pub-id pub-id-type="doi">10.1145/1553374.1553380</pub-id>
</citation>
</ref>
<ref id="B94">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Osa</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Pajarinen</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Neumann</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Bagnell</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Abbeel</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Peters</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>An algorithmic perspective on imitation learning</article-title>. <source>Found. Trends&#xae; Robot</source> <volume>7</volume>, <fpage>1</fpage>&#x2013;<lpage>179</lpage>. <pub-id pub-id-type="doi">10.1561/2300000053</pub-id>
</citation>
</ref>
<ref id="B95">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>&#xd6;zdemir</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Gros</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Finding consensus without computation</article-title>. <source>IEEE Robotics Automation Lett.</source> <volume>3</volume>, <fpage>1346</fpage>&#x2013;<lpage>1353</lpage>. <pub-id pub-id-type="doi">10.1109/LRA.2018.2795640</pub-id>
</citation>
</ref>
<ref id="B96">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>&#xd6;zdemir</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Shepherding with robots that do not compute</article-title>,&#x201d; in <conf-name>ECAL 2017, the fourteenth European conference on artificial life</conf-name> (<publisher-loc>Cambridge, MA, USA</publisher-loc>: <publisher-name>MIT Press</publisher-name>). <pub-id pub-id-type="doi">10.7551/ecal_a_056</pub-id>
</citation>
</ref>
<ref id="B97">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>&#xd6;zdemir</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Gauci</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Kolling</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hall</surname>
<given-names>M. D.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2019</year>). &#x201c;<article-title>Spatial coverage without computation</article-title>,&#x201d; in <conf-name>2019 international conference on robotics and automation (ICRA)</conf-name> (<publisher-loc>Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>9674</fpage>&#x2013;<lpage>9680</lpage>. <pub-id pub-id-type="doi">10.1109/ICRA.2019.8793731</pub-id>
</citation>
</ref>
<ref id="B98">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Packard</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Bedau</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Channon</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Ikegami</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Rasmussen</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Stanley</surname>
<given-names>K. O.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>An overview of open-ended evolution: Editorial introduction to the open-ended evolution ii special issue</article-title>. <source>Artif. Life</source> <volume>25</volume>, <fpage>93</fpage>&#x2013;<lpage>103</lpage>. <pub-id pub-id-type="doi">10.1162/artl_a_00291</pub-id>
</citation>
</ref>
<ref id="B99">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pinciroli</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Beltrame</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Buzz: A programming language for robot swarms</article-title>. <source>IEEE Softw.</source> <volume>33</volume>, <fpage>97</fpage>&#x2013;<lpage>100</lpage>. <pub-id pub-id-type="doi">10.1109/MS.2016.95</pub-id>
</citation>
</ref>
<ref id="B100">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Prieto</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Becerra</surname>
<given-names>J. A.</given-names>
</name>
<name>
<surname>Bellas</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Duro</surname>
<given-names>R. J.</given-names>
</name>
</person-group> (<year>2010</year>). <article-title>Open-ended evolution as a means to self-organize heterogeneous multi-robot systems in real time</article-title>. <source>Robotics Aut. Syst.</source> <volume>58</volume>, <fpage>1282</fpage>&#x2013;<lpage>1291</lpage>. <pub-id pub-id-type="doi">10.1016/j.robot.2010.08.004</pub-id>
</citation>
</ref>
<ref id="B101">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Prorok</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Hsieh</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Kumar</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2009</year>). <article-title>The impact of diversity on optimal control policies for heterogeneous robot swarms</article-title>. <source>IEEE Trans. Robotics</source> <volume>33</volume>, <fpage>346</fpage>&#x2013;<lpage>358</lpage>. <pub-id pub-id-type="doi">10.1109/TRO.2016.2631593</pub-id>
</citation>
</ref>
<ref id="B102">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pugh</surname>
<given-names>J. K.</given-names>
</name>
<name>
<surname>Soros</surname>
<given-names>L. B.</given-names>
</name>
<name>
<surname>Stanley</surname>
<given-names>K. O.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Quality diversity: A new frontier for evolutionary computation</article-title>. <source>Front. Robotics AI</source> <volume>3</volume>, <fpage>40</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2016.00040</pub-id>
</citation>
</ref>
<ref id="B103">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Quinn</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Smith</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Mayley</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Husbands</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2003</year>). <article-title>Evolving controllers for a homogeneous system of physical robots: Structured cooperation with minimal sensors</article-title>. <source>Philos. Trans. A Math. Phys. Eng. Sci.</source> <volume>361</volume>, <fpage>2321</fpage>&#x2013;<lpage>2343</lpage>. <pub-id pub-id-type="doi">10.1098/rsta.2003.1258</pub-id>
</citation>
</ref>
<ref id="B104">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Radford</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Wu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Child</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Luan</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Amodei</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Sutskever</surname>
<given-names>I.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Language models are unsupervised multitask learners</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://cdn.openai.com/better-language-models/language_models_are_unsupervised_multitask_learners.pdf">https://cdn.openai.com/better-language-models/language_models_are_unsupervised_multitask_learners.pdf</ext-link>
</comment>.</citation>
</ref>
<ref id="B105">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Reina</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Valentini</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Fern&#xe1;ndez-Oto</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>A design pattern for decentralised decision making</article-title>. <source>PLOS ONE</source> <volume>10</volume>, <fpage>e0140950</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0140950</pub-id>
</citation>
</ref>
<ref id="B106">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rubenstein</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Cornejo</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Nagpal</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Programmable self-assembly in a thousand-robot swarm</article-title>. <source>Science</source> <volume>345</volume>, <fpage>795</fpage>&#x2013;<lpage>799</lpage>. <pub-id pub-id-type="doi">10.1126/science.1254295</pub-id>
</citation>
</ref>
<ref id="B107">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>Swarm robotics: From sources of inspiration to domains of application</article-title>,&#x201d; in <conf-name>Swarm robotics: SAB 2004 international workshop</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Spears</surname>
<given-names>W. M.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>10</fpage>&#x2013;<lpage>20</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-30552-1_2</pub-id>
</citation>
</ref>
<ref id="B108">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Salman</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ligot</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Concurrent design of control software and configuration of hardware for robot swarms under economic constraints</article-title>. <source>PeerJ Comput. Sci.</source> <volume>5</volume>, <fpage>e221</fpage>. <pub-id pub-id-type="doi">10.7717/peerj-cs.221</pub-id>
</citation>
</ref>
<ref id="B109">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Schranz</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Di Caro</surname>
<given-names>G. A.</given-names>
</name>
<name>
<surname>Schmickl</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Elmenreich</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Arvin</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>&#x15e;ekercio&#x11f;lu</surname>
<given-names>Y. A.</given-names>
</name>
<etal/>
</person-group> (<year>2021</year>). <article-title>Swarm intelligence and cyber-physical systems: Concepts, challenges and future trends</article-title>. <source>Swarm Evol. Comput.</source> <volume>60</volume>, <fpage>100762</fpage>. <pub-id pub-id-type="doi">10.1016/j.swevo.2020.100762</pub-id>
</citation>
</ref>
<ref id="B110">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Schranz</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Umlauft</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Sende</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Elmenreich</surname>
<given-names>W.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Swarm robotic behaviors and current applications</article-title>. <source>Front. Robotics AI</source> <volume>7</volume>, <fpage>36</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2020.00036</pub-id>
</citation>
</ref>
<ref id="B111">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Silva</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Correia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Evolutionary online behaviour learning and adaptation in real robots</article-title>. <source>R. Soc. Open Sci.</source> <volume>4</volume>, <fpage>160938</fpage>. <pub-id pub-id-type="doi">10.1098/rsos.160938</pub-id>
</citation>
</ref>
<ref id="B112">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Silva</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Duarte</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Correia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Oliveira</surname>
<given-names>S. M.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Open issues in evolutionary robotics</article-title>. <source>Evol. Comput.</source> <volume>24</volume>, <fpage>205</fpage>&#x2013;<lpage>236</lpage>. <pub-id pub-id-type="doi">10.1162/EVCO_a_00172</pub-id>
</citation>
</ref>
<ref id="B113">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Silva</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Urbano</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Correia</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Christensen</surname>
<given-names>A. L.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>odNEAT: an algorithm for decentralised online evolution of robotic controllers</article-title>. <source>Evol. Comput.</source> <volume>23</volume>, <fpage>421</fpage>&#x2013;<lpage>449</lpage>. <pub-id pub-id-type="doi">10.1162/EVCO_a_00141</pub-id>
</citation>
</ref>
<ref id="B114">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Slavkov</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Carrillo-Zapata</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Carranza</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Diego</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Jansson</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Kaandorp</surname>
<given-names>J.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>Morphogenesis in robot swarms</article-title>. <source>Sci. Robotics</source> <volume>3</volume>, <fpage>eaau9178</fpage>. <pub-id pub-id-type="doi">10.1126/scirobotics.aau9178</pub-id>
</citation>
</ref>
<ref id="B115">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>&#x160;o&#x161;i&#x107;</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Khuda Bukhsh</surname>
<given-names>W. R.</given-names>
</name>
<name>
<surname>Zoubir</surname>
<given-names>A. M.</given-names>
</name>
<name>
<surname>Koeppl</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2017</year>). &#x201c;<article-title>Inverse reinforcement learning in swarm systems</article-title>,&#x201d; in <conf-name>Aamas &#x2019;17: Proceedings of the 16th conference on autonomous agents and MultiAgent systems</conf-name> (<publisher-loc>Richland, SC, USA</publisher-loc>: <publisher-name>International Foundation for Autonomous Agents and Multiagent Systems</publisher-name>), <fpage>1413</fpage>&#x2013;<lpage>1421</lpage>.</citation>
</ref>
<ref id="B116">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Soysal</surname>
<given-names>O.</given-names>
</name>
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2007</year>). &#x201c;<article-title>A macroscopic model for self-organized aggregation in swarm robotic systems</article-title>,&#x201d; in <conf-name>Swarm robotics: Second international workshop, SAB 2006</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Spears</surname>
<given-names>W. M.</given-names>
</name>
<name>
<surname>Winfield</surname>
<given-names>A.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>27</fpage>&#x2013;<lpage>42</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-71541-2_3</pub-id>
</citation>
</ref>
<ref id="B117">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Spaey</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Kegeleirs</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Garz&#xf3;n Ramos</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Birattari</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Evaluation of alternative exploration schemes in the automatic modular design of robot swarms</article-title>,&#x201d; in <source>Artificial intelligence and machine learning: Bnaic 2019, benelearn 2019</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Bogaerts</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Bontempi</surname>
<given-names>G.</given-names>
</name>
<name>
<surname>Geurts</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Harley</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Lebichot</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Lenaerts</surname>
<given-names>T.</given-names>
</name>
<etal/>
</person-group> (<publisher-loc>Cham, Switzerland</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>18</fpage>&#x2013;<lpage>33</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-65154-1_2</pub-id>
</citation>
</ref>
<ref id="B118">
<citation citation-type="web">
<person-group person-group-type="author">
<name>
<surname>Stanley</surname>
<given-names>K. O.</given-names>
</name>
<name>
<surname>Lehman</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Soros</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Open-endedness: The last grand challenge you&#x2019;ve never heard of</article-title>. <comment>Available at: <ext-link ext-link-type="uri" xlink:href="https://www.oreilly.com/radar/open-endedness-the-last-grand-challenge-youve-never-heard-of/">https://www.oreilly.com/radar/open-endedness-the-last-grand-challenge-youve-never-heard-of/</ext-link>
</comment>.</citation>
</ref>
<ref id="B119">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Stanley</surname>
<given-names>K. O.</given-names>
</name>
<name>
<surname>Miikkulainen</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Evolving neural networks through augmenting topologies</article-title>. <source>Evol. Comput.</source> <volume>10</volume>, <fpage>99</fpage>&#x2013;<lpage>127</lpage>. <pub-id pub-id-type="doi">10.1162/106365602320169811</pub-id>
</citation>
</ref>
<ref id="B120">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Evolutionary robotics: Model or design?</article-title> <source>Front. Robotics AI</source> <volume>1</volume>, <fpage>13</fpage>. <pub-id pub-id-type="doi">10.3389/frobt.2014.00013</pub-id>
</citation>
</ref>
<ref id="B121">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
</person-group> (<year>2008</year>). <source>Evolutionary swarm robotics</source>. <publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>. <pub-id pub-id-type="doi">10.1007/978-3-540-77612-3</pub-id>
</citation>
</ref>
<ref id="B122">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Gro&#xdf;</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Labella</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Thomas&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2003</year>). &#x201c;<article-title>Evolving aggregation behaviors in a swarm of robots</article-title>,&#x201d; in <conf-name>Advances in artificial life: 7th European conference, ECAL 2003</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Banzhaf</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Ziegler</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Christaller</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Dittrich</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>J. T.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>865</fpage>&#x2013;<lpage>874</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-39432-7_93</pub-id>
</citation>
</ref>
<ref id="B123">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>L&#xf3;pez-Ib&#xe1;&#xf1;ez</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>Advantages of task-specific multi-objective optimisation in evolutionary robotics</article-title>. <source>PLOS ONE</source> <volume>10</volume>, <fpage>e0136406</fpage>. <pub-id pub-id-type="doi">10.1371/journal.pone.0136406</pub-id>
</citation>
</ref>
<ref id="B124">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Nolfi</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Engineering the evolution of self-organizing behaviors in swarm robotics: A case study</article-title>. <source>Artif. Life</source> <volume>17</volume>, <fpage>183</fpage>&#x2013;<lpage>202</lpage>. <pub-id pub-id-type="doi">10.1162/artl_a_00031</pub-id>
</citation>
</ref>
<ref id="B125">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Trianni</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Tuci</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Ampatzis</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Dorigo</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2014</year>). &#x201c;<article-title>Evolutionary swarm robotics: A theoretical and methodological itinerary from individual neuro-controllers to collective behaviours</article-title>,&#x201d; in <source>The horizons of evolutionary robotics</source>. Editors <person-group person-group-type="editor">
<name>
<surname>Vargas</surname>
<given-names>P. A.</given-names>
</name>
<name>
<surname>Paolo</surname>
<given-names>E. A. D.</given-names>
</name>
<name>
<surname>Harvey</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Husbands</surname>
<given-names>P.</given-names>
</name>
</person-group> (<publisher-loc>Boston, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>153</fpage>&#x2013;<lpage>178</lpage>. <pub-id pub-id-type="doi">10.7551/mitpress/8493.003.0008</pub-id>
</citation>
</ref>
<ref id="B126">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>van Diggelen</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Luo</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Cambier</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Ferrante</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Eiben</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2022</year>). &#x201c;<article-title>Environment induced emergence of collective behavior in evolving swarms with limited sensing</article-title>,&#x201d; in <conf-name>GECCO&#x2019;22: Proceedings of the genetic and evolutionary computation conference</conf-name>. Editor <person-group person-group-type="editor">
<name>
<surname>Fieldsend</surname>
<given-names>J. E.</given-names>
</name>
</person-group> (<publisher-loc>New York, NY, USA</publisher-loc>: <publisher-name>ACM</publisher-name>), <fpage>31</fpage>&#x2013;<lpage>39</lpage>. <pub-id pub-id-type="doi">10.1145/3512290.3528735</pub-id>
</citation>
</ref>
<ref id="B127">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Watson</surname>
<given-names>R. A.</given-names>
</name>
<name>
<surname>Ficici</surname>
<given-names>S. G.</given-names>
</name>
<name>
<surname>Pollack</surname>
<given-names>J. B.</given-names>
</name>
</person-group> (<year>2002</year>). <article-title>Embodied evolution: Distributing an evolutionary algorithm in a population of robots</article-title>. <source>Robotics Aut. Syst.</source> <volume>39</volume>, <fpage>1</fpage>&#x2013;<lpage>18</lpage>. <pub-id pub-id-type="doi">10.1016/S0921-8890(02)00170-7</pub-id>
</citation>
</ref>
<ref id="B128">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Werfel</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Petersen</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Nagpal</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Designing collective behavior in a termite-inspired robot construction team</article-title>. <source>Science</source> <volume>343</volume>, <fpage>754</fpage>&#x2013;<lpage>758</lpage>. <pub-id pub-id-type="doi">10.1126/science.1245842</pub-id>
</citation>
</ref>
<ref id="B129">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Winfield</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Harper</surname>
<given-names>C. J.</given-names>
</name>
<name>
<surname>Nembrini</surname>
<given-names>J.</given-names>
</name>
</person-group> (<year>2005</year>). &#x201c;<article-title>Towards dependable swarms and a new discipline of swarm engineering</article-title>,&#x201d; in <conf-name>Swarm robotics: SAB 2004 international workshop</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>&#x15e;ahin</surname>
<given-names>E.</given-names>
</name>
<name>
<surname>Spears</surname>
<given-names>W. M.</given-names>
</name>
</person-group> (<publisher-loc>Berlin, Germany</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>126</fpage>&#x2013;<lpage>142</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-540-30552-1_11</pub-id>
</citation>
</ref>
<ref id="B130">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Xie</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Sun</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Lin</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>L.</given-names>
</name>
<etal/>
</person-group> (<year>2019</year>). <article-title>Reconfigurable magnetic microrobot swarm: Multimode transformation, locomotion, and manipulation</article-title>. <source>Sci. Robotics</source> <volume>4</volume>, <fpage>eaav8006</fpage>. <pub-id pub-id-type="doi">10.1126/scirobotics.aav8006</pub-id>
</citation>
</ref>
<ref id="B131">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Yamins</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Nagpal</surname>
<given-names>R.</given-names>
</name>
</person-group> (<year>2008</year>). &#x201c;<article-title>Automated global-to-local programming in 1-D spatial multi-agent systems</article-title>,&#x201d; in <conf-name>Aamas &#x2019;08: The seventh international conference on autonomous agents and multiagent systems</conf-name>. Editors <person-group person-group-type="editor">
<name>
<surname>Padgham</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Parkes</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>M&#xfc;ller</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Parsons</surname>
<given-names>S.</given-names>
</name>
</person-group> (<publisher-loc>Richland, SC, USA</publisher-loc>: <publisher-name>International Foundation for Autonomous Agents and Multiagent Systems</publisher-name>), <fpage>615</fpage>&#x2013;<lpage>622</lpage>.</citation>
</ref>
<ref id="B132">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yang</surname>
<given-names>G.-Z.</given-names>
</name>
<name>
<surname>Bellingham</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Dupont</surname>
<given-names>P. E.</given-names>
</name>
<name>
<surname>Fischer</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Floridi</surname>
<given-names>L.</given-names>
</name>
<name>
<surname>Full</surname>
<given-names>R.</given-names>
</name>
<etal/>
</person-group> (<year>2018</year>). <article-title>The grand challenges of Science Robotics</article-title>. <source>Sci. Robotics</source> <volume>3</volume>, <fpage>eaar7650</fpage>. <pub-id pub-id-type="doi">10.1126/scirobotics.aar7650</pub-id>
</citation>
</ref>
<ref id="B133">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Yu</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Ultra-extensible ribbon-like magnetic microswarm</article-title>. <source>Nat. Commun.</source> <volume>9</volume>, <fpage>3260</fpage>. <pub-id pub-id-type="doi">10.1038/s41467-018-05749-6</pub-id>
</citation>
</ref>
<ref id="B134">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Zhao</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Queralta</surname>
<given-names>J. P.</given-names>
</name>
<name>
<surname>Westerlund</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2020</year>). &#x201c;<article-title>Sim-to-real transfer in deep reinforcement learning for robotics: A survey</article-title>,&#x201d; in <conf-name>2020 IEEE symposium series on computational intelligence (SSCI)</conf-name> (<publisher-loc>Piscataway, NJ, USA</publisher-loc>: <publisher-name>IEEE</publisher-name>), <fpage>737</fpage>&#x2013;<lpage>744</lpage>. <pub-id pub-id-type="doi">10.1109/SSCI47803.2020.9308468</pub-id>
</citation>
</ref>
</ref-list>
</back>
</article>