Swarm robotics is an approach to collective robotics that takes inspiration from the self-organized behaviors of social animals. Through simple rules and local interactions, swarm robotics aims at designing robust, scalable, and flexible collective behaviors for the coordination of large numbers of robots. In this paper, we analyze the literature from the point of view of swarm engineering: we focus mainly on ideas and concepts that contribute to the advancement of swarm robotics as an engineering field and that could be relevant to tackle real-world applications. Swarm engineering is an emerging discipline that aims at defining systematic and well founded procedures for modeling, designing, realizing, verifying, validating, operating, and maintaining a swarm robotics system. We propose two taxonomies: in the first taxonomy, we classify works that deal with design and analysis methods; in the second taxonomy, we classify works according to the collective behavior studied. We conclude with a discussion of the current limits of swarm robotics as an engineering discipline and with suggestions for future research directions.

We present a novel multi-robot simulator named ARGoS. ARGoS is designed to simulate complex experiments involving large swarms of robots of different types. ARGoS is the first multi-robot simulator that is at the same time both efficient (fast performance with many robots) and flexible (highly customizable for specific experiments). Novel design choices in ARGoS have enabled this breakthrough. First, in ARGoS, it is possible to partition the simulated space into multiple sub-spaces, managed by different physics engines

A Novel Concept for the Study of Heterogeneous Robotic Swarms warm robotics systems are characterized by decentralized control, limited communication between robots, use of local information, and emergence of global behavior. Such systems have shown their potential for flexibility and robustness [1]-[3]. However, existing swarm robotics systems are by and large still limited to displaying simple proof-of-concept behaviors under laboratory conditions. It is our contention that one of the factors holding back swarm robotics research is the almost universal insistence on homogeneous system components. We believe that swarm robotics designers must embrace heterogeneity if they ever want swarm robotics systems to approach the complexity required of real-world systems. To date, swarm robotics systems have almost exclusively comprised physically and behaviorally undifferentiated agents. This design decision has its roots in ethological models of self-organizing natural systems. These models serve as inspiration for swarm robotics system designers, but are often highly abstract simplifications of natural systems and, to date, have largely assumed homogeneous agents. Selected dynamics of the systems under study are shown to emerge from the interactions of identical system components, ignoring the heterogeneities (physical, spatial, functional, and informational) that one can find in almost any natural system. The field of swarm robotics currently lacks methods and tools with which to study and leverage the heterogeneity that is present in natural systems. To remedy this deficiency, we propose swarmanoid, an innovative swarm robotics system composed of three different robot types with complementary skills: foot-bots are small autonomous robots specialized in moving on both even and uneven terrains, capable of self-assembling and of transporting objects or other robots; hand-bots are autonomous robots capable of climbing some vertical surfaces and manipulating small objects; and eye-bots are autonomous flying robots that can attach to an indoor ceiling, capable of analyzing the environment from a privileged position to S

Achieving fast and accurate collective decisions with a large number of simple agents without relying on a central planning unit or on global communication is essential for developing complex collective behaviors. In this paper, we investigate the speed versus accuracy trade-off in collective decision-making in the context of a binary discrimination problem-i.e., how a swarm can collectively determine the best of two options. We describe a novel, fully distributed collective decision-making strategy that only requires agents with minimal capabilities and is faster than previous approaches. We evaluate our strategy experimentally, using a swarm of 100 Kilobots, and we study it theoretically, using both continuum and finite-size models. We find that the main factor affecting the speed versus accuracy trade-off of our strategy is the agents neighborhood size-i.e., the number of agents with whom the current opinion of each agent is shared. The proposed strategy and the associated theoretical framework can be used to design swarms that take collective decisions at a given level of speed and/or accuracy. Keywords collective decision-making • swarm robotics • majority rule • voter model • self-organization • ordinary differential equations • chemical reaction network • Gillespie algorithm • Kilobot

The ability to collectively choose the best among a finite set of alternatives is a fundamental cognitive skill for robot swarms. In this paper, we propose a formal definition of the best-of-n problem and a taxonomy that details its possible variants. Based on this taxonomy, we analyze the swarm robotics literature focusing on the decision-making problem dealt with by the swarm. We find that, so far, the literature has primarily focused on certain variants of the best-of-n problem, while other variants have been the subject of only a few isolated studies. Additionally, we consider a second taxonomy about the design methodologies used to develop collective decision-making strategies. Based on this second taxonomy, we provide an in-depth survey of the literature that details the strategies proposed so far and discusses the advantages and disadvantages of current design methodologies.

In flocking, a swarm of robots moves cohesively in a common direction. Traditionally, flocking is realized using two main control rules: proximal control, which controls the cohesion of the swarm using local range-and-bearing information about neighboring robots; and alignment control, which allows the robots to align in a common direction and uses more elaborate sensing mechanisms to obtain the orientation of neighboring robots. So far, limited attention has been given to motion control, used to translate the output of these two control rules into robot motion.In this paper, we propose a novel motion control method: magnitude-dependent motion control (MDMC). Through simulations and real robot experiments, we show that, with MDMC, flocking in a random direction is possible without the need of alignment control and of robots having a preferred direction of travel. MDMC has the advantage to be implementable on very simple robots that lack the capability to detect the orientation of their neighbors. Additionally, we introduce a small proportion of robots informed about a desired direction of travel. We compare MDMC with a motion control method used in previous robotics literature, which we call magnitudeindependent motion control (MIMC), and we show that the swarms can travel longer distances in the desired direction when using MDMC instead of MIMC. Finally, we systematically study flocking under various conditions: with or without alignment control, with or without informed robots, with MDMC or with MIMC.

We introduce an elasticity-based mechanism that drives active particles to self-organize by cascading self-propulsion energy towards lower-energy modes. We illustrate it on a simple model of self-propelled agents linked by linear springs that reach a collectively rotating or translating state without requiring aligning interactions. We develop an active elastic sheet theory, complementary to the prevailing active fluid theories, and find analytical stability conditions for the ordered state. Given its ubiquity, this mechanism could play a relevant role in various natural and artificial swarms.

Collective decision-making is a process whereby the members of a group decide on a course of action by consensus. In this paper, we propose a collective decision-making mechanism for robot swarms deployed in scenarios in which robots can choose between two actions that have the same effects but that have different execution times. The proposed mechanism allows a swarm composed of robots with no explicit knowledge about the difference in execution times between the two actions to choose the one with the shorter execution time. We use an opinion formation model that captures important elements of the scenarios in which the proposed mechanism can be used in order to predict the system's behavior. The model predicts that when the two actions have different average execution times, the swarm chooses with high probability the action with the shorter average execution time. We validate the model's predictions through a swarm robotics experiment in which robot teams Electronic supplementary material The online version of this article (306 Swarm Intell (2011) 5:305-327 must choose one of two paths of different length that connect two locations. Thanks to the proposed mechanism, a swarm made of robot teams that do not measure time or distance is able to choose the shorter path.