A novel distributed swarm control strategy based on coupled signal oscillators

The miniaturization of microrobots is accompanied by limitations of signaling, sensing and agility. Control of a swarm of simple microrobots has to cope with such constraints in a way which still guarantees the accomplishment of a task. A recently proposed communication method, which is based on the coupling of signal oscillators of individual agents [13], may provide a basis for a distributed control of a simulated swarm of simple microrobots (similar to I-Swarm microrobots) engaged in a cleaning scenario. This self-organized communication method was biologically inspired from males of chorusing insects which are known for the rapid synchronization of their acoustic signals in a chorus. Signal oscillator properties were used to generate waves of synchronized signaling (s-waves) among a swarm of agents. In a simulation of a cleaning scenario, agents on the dump initiated concentrically spreading s-waves by shortening their intrinsic signal period. Dirt-carrying agents localized the dump by heading against the wave front. After optimization of certain control parameters the properties of this distributed control strategy were investigated in different variants of a cleaning scenario. These include a second dump, obstacles, different agent densities, agent drop-out and a second signal oscillator.     

Flocking for multi-robot systems via the Null-Space-based Behavioral control

Flocking is the way in which populations of animals like birds, fishes, and insects move together. In such cases, the global behavior of the team emerges as a consequence of local interactions among the neighboring members. This paper approaches the problem of letting a group of robots flock by resorting to a behavior-based control architecture, namely Null-Space-based Behavioral (NSB) control. Following such a control architecture, very simple behaviors for each robot are defined and properly arranged in priority in order to achieve the assigned mission. In particular, flocking is performed in a decentralized manner, that is, the behaviors of each robot only depend on local information concerning the robot’s neighbors. In this paper, the flocking behavior is analyzed in a variety of conditions: with or without a moving rendez-vous point, in a two- or three-dimensional space and in presence of obstacles. Extensive simulations and experiments performed with a team of differential-drive mobile robots show the effectiveness of the proposed algorithm.     

Designing pheromone communication in swarm robotics: Group foraging behavior mediated by chemical substance

In swarm robotics, communication among the robots is essential. Inspired by biological swarms using pheromones, we propose the use of chemical compounds to realize group foraging behavior in robot swarms. We designed a fully autonomous robot, and then created a swarm using ethanol as the trail pheromone allowing the robots to communicate with one another indirectly via pheromone trails. Our group recruitment and cooperative transport algorithms provide the robots with the required swarm behavior. We conducted both simulations and experiments with real robot swarms, and analyzed the data statistically to investigate any changes caused by pheromone communication in the performance of the swarm in solving foraging recruitment and cooperative transport tasks. The results show that the robots can communicate using pheromone trails, and that the improvement due to pheromone communication may be non-linear, depending on the size of the robot swarm.     

Task partitioning in swarms of robots: an adaptive method for strategy selection

Task partitioning is the decomposition of a task into two or more sub-tasks that can be tackled separately. Task partitioning can be observed in many species of social insects, as it is often an advantageous way of organizing the work of a group of individuals. Potential advantages of task partitioning are, among others: reduction of interference between workers, exploitation of individuals?? skills and specializations, energy efficiency, and higher parallelism. Even though swarms of robots can benefit from task partitioning in the same way as social insects do, only few works in swarm robotics are dedicated to this subject. In this paper, we study the case in which a swarm of robots has to tackle a task that can be partitioned into a sequence of two sub-tasks. We propose a method that allows the individual robots in the swarm to decide whether to partition the given task or not. The method is self-organized, relies on the experience of each individual, and does not require explicit communication between robots. We evaluate the method in simulation experiments, using foraging as testbed. We study cases in which task partitioning is preferable and cases in which it is not. We show that the proposed method leads to good performance of the swarm in both cases, by employing task partitioning only when it is advantageous. We also show that the swarm is able to react to changes in the environmental conditions by adapting the behavior on-line. Scalability experiments show that the proposed method performs well across all the tested group sizes.     

Self-organized cooperation between robotic swarms

We study self-organized cooperation between heterogeneous robotic swarms. The robots of each swarm play distinct roles based on their different characteristics. We investigate how the use of simple local interactions between the robots of the different swarms can let the swarms cooperate in order to solve complex tasks. We focus on an indoor navigation task, in which we use a swarm of wheeled robots, called foot-bots, and a swarm of flying robots that can attach to the ceiling, called eye-bots. The task of the foot-bots is to move back and forth between a source and a target location. The role of the eye-bots is to guide foot-bots: they choose positions at the ceiling and from there give local directional instructions to foot-bots passing by. To obtain efficient paths for foot-bot navigation, eye-bots need on the one hand to choose good positions and on the other hand learn the right instructions to give. We investigate each of these aspects. Our solution is based on a process of mutual adaptation, in which foot-bots execute instructions given by eye-bots, and eye-bots observe the behavior of foot-bots to adapt their position and the instructions they give. Our approach is inspired by pheromone mediated navigation of ants, as eye-bots serve as stigmergic markers for foot-bot navigation. Through simulation, we show how this system is able to find efficient paths in complex environments, and to display different kinds of complex and scalable self-organized behaviors, such as shortest path finding and automatic traffic spreading.     

Energy-efficient indoor search by swarms of simulated flying robots without global information

Swarms of flying robots are a promising alternative to ground-based robots for search in indoor environments with advantages such as increased speed and the ability to fly above obstacles. However, there are numerous problems that must be surmounted including limitations in available sensory and on-board processing capabilities, and low flight endurance. This paper introduces a novel strategy to coordinate a swarm of flying robots for indoor exploration that significantly increases energy efficiency. The presented algorithm is fully distributed and scalable. It relies solely on local sensing and low-bandwidth communication, and does not require absolute positioning, localisation, or explicit world-models. It assumes that flying robots can temporarily attach to the ceiling, or land on the ground for efficient surveillance over extended periods of time. To further reduce energy consumption, the swarm is incrementally deployed by launching one robot at a time. Extensive simulation experiments demonstrate that increasing the time between consecutive robot launches significantly lowers energy consumption by reducing total swarm flight time, while also decreasing collision probability. As a trade-off, however, the search time increases with increased inter-launch periods. These effects are stronger in more complex environments. The proposed localisation-free strategy provides an energy efficient search behaviour adaptable to different environments or timing constraints.     

Evolution of Collective Behaviors for a Real Swarm of Aquatic Surface Robots

Swarm robotics is a promising approach for the coordination of large numbers of robots. While previous studies have shown that evolutionary robotics techniques can be applied to obtain robust and efficient self-organized behaviors for robot swarms, most studies have been conducted in simulation, and the few that have been conducted on real robots have been confined to laboratory environments. In this paper, we demonstrate for the first time a swarm robotics system with evolved control successfully operating in a real and uncontrolled environment. We evolve neural network-based controllers in simulation for canonical swarm robotics tasks, namely homing, dispersion, clustering, and monitoring. We then assess the performance of the controllers on a real swarm of up to ten aquatic surface robots. Our results show that the evolved controllers transfer successfully to real robots and achieve a performance similar to the performance obtained in simulation. We validate that the evolved controllers display key properties of swarm intelligence-based control, namely scalability, flexibility, and robustness on the real swarm. We conclude with a proof-of-concept experiment in which the swarm performs a complete environmental monitoring task by combining multiple evolved controllers.     

Biologically inspired redistribution of a swarm of robots among multiple sites

We present a biologically inspired approach to the dynamic assignment and reassignment of a homogeneous swarm of robots to multiple locations, which is relevant to applications like search and rescue, environmental monitoring, and task allocation. Our work is inspired by experimental studies of ant house hunting and empirical models that predict the behavior of the colony that is faced with a choice between multiple candidate nests. We design quorum based stochastic control policies that enable the team of agents to distribute themselves among multiple candidate sites in a specified ratio, and compare our results to the linear stochastic policies described in (Halasz et al., in Proceedings of the International Conference on Intelligent Robots and Systems (IROS’07), pp. 2320–2325, 2007). We show how our quorum model consistently performs better than the linear models while minimizing computational requirements and now it can be implemented without the use of inter-agent wireless communication.     

Electroencephalography as implicit communication channel for proximal interaction between humans and robot swarms

Search and rescue, autonomous construction, and many other semi-autonomous multirobot applications can benefit from proximal interactions between an operator and a swarm of robots. Most research on proximal interaction is based on explicit communication techniques such as gesture and speech. This study proposes a new implicit proximal communication technique to approach the problem of robot selection. We use electroencephalography (EEG) signals to select the robot at which the operator is looking. This is achieved using steady-state visually evoked potential (SSVEP), a repeatable neural response to a regularly blinking visual stimulus that varies predictively based on the blinking frequency. In our experiments, each robot was equipped with LEDs blinking at a different frequency, and the operator’s SSVEP neural response was extracted from the EEG signal to detect and select the robot without requiring any conscious action by the user. This study systematically investigates several parameters affecting the SSVEP neural response: blinking frequency of the LED, distance between the robot and the operator, and color of the LED. Based on these parameters, we study two signal processing approaches and critically analyze their performance on 10 subjects controlling a set of physical robots. Our results show that despite numerous artifacts, it is possible to achieve a recognition rate higher than 85 % on some subjects, while the average over the ten subjects was 75 %.     

Swarm robotics: a review from the swarm engineering perspective

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.     

Turing learning: a metric-free approach to inferring behavior and its application to swarms

We propose Turing Learning, a novel system identification method for inferring the behavior of natural or artificial systems. Turing Learning simultaneously optimizes two populations of computer programs, one representing models of the behavior of the system under investigation, and the other representing classifiers. By observing the behavior of the system as well as the behaviors produced by the models, two sets of data samples are obtained. The classifiers are rewarded for discriminating between these two sets, that is, for correctly categorizing data samples as either genuine or counterfeit. Conversely, the models are rewarded for ‘tricking’ the classifiers into categorizing their data samples as genuine. Unlike other methods for system identification, Turing Learning does not require predefined metrics to quantify the difference between the system and its models. We present two case studies with swarms of simulated robots and prove that the underlying behaviors cannot be inferred by a metric-based system identification method. By contrast, Turing Learning infers the behaviors with high accuracy. It also produces a useful by-product—the classifiers—that can be used to detect abnormal behavior in the swarm. Moreover, we show that Turing Learning also successfully infers the behavior of physical robot swarms. The results show that collective behaviors can be directly inferred from motion trajectories of individuals in the swarm, which may have significant implications for the study of animal collectives. Furthermore, Turing Learning could prove useful whenever a behavior is not easily characterizable using metrics, making it suitable for a wide range of applications.     

Local force cues for strength and stability in a distributed robotic construction system

Construction of spatially extended, self-supporting structures requires a consideration of structural stability throughout the building sequence. For collective construction systems, where independent agents act with variable order and timing under decentralized control, ensuring stability is a particularly pronounced challenge. Previous research in this area has largely neglected considering stability during the building process. Physical forces present throughout a structure may be usable as a cue to inform agent actions as well as an indirect communication mechanism (stigmergy) to coordinate their behavior, as adding material leads to redistribution of forces which then informs the addition of further material. Here we consider in simulation a system of decentralized climbing robots capable of traversing and extending a two-dimensional truss structure, and explore the use of feedback based on force sensing as a way for the swarm to anticipate and prevent structural failures. We consider a scenario in which robots are tasked with building an unsupported cantilever across a gap, as for a bridge, where the goal is for the swarm to build any stable spanning structure rather than to construct a specific predetermined blueprint. We show that access to local force measurements enables robots to build cantilevers that span significantly farther than those built by robots without access to such information. This improvement is achieved by taking measures to maintain both strength and stability, where strength is ensured by paying attention to forces during locomotion to prevent joints from breaking, and stability is maintained by looking at how loads transfer to the ground to ensure against toppling. We show that swarms that take both kinds of forces into account have improved building performance, in both structured settings with flat ground and unpredictable environments with rough terrain.     

Cooperative navigation in robotic swarms

We study cooperative navigation for robotic swarms in the context of a general event-servicing scenario. In the scenario, one or more events need to be serviced at specific locations by robots with the required skills. We focus on the question of how the swarm can inform its members about events, and guide robots to event locations. We propose a solution based on delay-tolerant wireless communications: by forwarding navigation information between them, robots cooperatively guide each other towards event locations. Such a collaborative approach leverages on the swarm’s intrinsic redundancy, distribution, and mobility. At the same time, the forwarding of navigation messages is the only form of cooperation that is required. This means that the robots are free in terms of their movement and location, and they can be involved in other tasks, unrelated to the navigation of the searching robot. This gives the system a high level of flexibility in terms of application scenarios, and a high degree of robustness with respect to robot failures or unexpected events. We study the algorithm in two different scenarios, both in simulation and on real robots. In the first scenario, a single searching robot needs to find a single target, while all other robots are involved in tasks of their own. In the second scenario, we study collective navigation: all robots of the swarm navigate back and forth between two targets, which is a typical scenario in swarm robotics. We show that in this case, the proposed algorithm gives rise to synergies in robot navigation, and it lets the swarm self-organize into a robust dynamic structure. The emergence of this structure improves navigation efficiency and lets the swarm find shortest paths.     

How the Spatial Position of Individuals Affects Their Influence on Swarms: A Numerical Comparison of Two Popular Swarm Dynamics Models

Schools of fish and flocks of birds are examples of self-organized animal groups that arise through social interactions among individuals. We numerically study two individual-based models, which recent empirical studies have suggested to explain self-organized group animal behavior: (i) a zone-based model where the group communication topology is determined by finite interacting zones of repulsion, attraction, and orientation among individuals; and (ii) a model where the communication topology is described by Delaunay triangulation, which is defined by each individual''s Voronoi neighbors. The models include a tunable parameter that controls an individual''s relative weighting of attraction and alignment. We perform computational experiments to investigate how effectively simulated groups transfer information in the form of velocity when an individual is perturbed. A cross-correlation function is used to measure the sensitivity of groups to sudden perturbations in the heading of individual members. The results show how relative weighting of attraction and alignment, location of the perturbed individual, population size, and the communication topology affect group structure and response to perturbation. We find that in the Delaunay-based model an individual who is perturbed is capable of triggering a cascade of responses, ultimately leading to the group changing direction. This phenomenon has been seen in self-organized animal groups in both experiments and nature.     

The biological principles of swarm intelligence

The roots of swarm intelligence are deeply embedded in the biological study of self-organized behaviors in social insects. From the routing of traffic in telecommunication networks to the design of control algorithms for groups of autonomous robots, the collective behaviors of these animals have inspired many of the foundational works in this emerging research field. For the first issue of this journal dedicated to swarm intelligence, we review the main biological principles that underlie the organization of insects’ colonies. We begin with some reminders about the decentralized nature of such systems and we describe the underlying mechanisms of complex collective behaviors of social insects, from the concept of stigmergy to the theory of self-organization in biological systems. We emphasize in particular the role of interactions and the importance of bifurcations that appear in the collective output of the colony when some of the system’s parameters change. We then propose to categorize the collective behaviors displayed by insect colonies according to four functions that emerge at the level of the colony and that organize its global behavior. Finally, we address the role of modulations of individual behaviors by disturbances (either environmental or internal to the colony) in the overall flexibility of insect colonies. We conclude that future studies about self-organized biological behaviors should investigate such modulations to better understand how insect colonies adapt to uncertain worlds.     

Ant-based swarming with positionless micro air vehicles for communication relay

Swarming without positioning information is interesting in application-oriented systems because it alleviates the need for sensors which are dependent on the environment, expensive in terms of energy, cost, size and weight, or unusable at useful ranges for real-life scenarios. This principle is applied to the development of a swarm of micro air vehicles (SMAVs) for the deployment of ad hoc wireless communication networks (SMAVNETs) between ground users in disaster areas. Rather than relying on positioning information, MAVs rely on local communication with immediate neighbors and proprioceptive sensors which provide heading, speed and altitude. To solve the challenging task of designing agent controllers to achieve the swarm behavior of the SMAVNET, inspiration is taken from army ants which are capable of laying and maintaining pheromone paths leading from their nest to food sources in nature. This is analogous to the deployment of communication pathways between multiple ground users. However, instead of being physically deposited in the air or on a map, pheromone is virtually deposited on the MAVs using local communication. This approach is investigated in 3D simulation in a simplified scenario with two ground users.     

Self-Localization of an Omnidirectional Mobile Robot Based on an Optical Flow Sensor

An omnidirectional mobile robot has the advantage that three degrees of freedom of motion in a 2D plane can be set independently, and it can thus move in arbitrary directions while maintaining the same heading. Dead reckoning is often used for self-localization using onboard sensors in omnidirectional robots, by means of measuring wheel velocities from motor encoder data, as well as in car-like robots. However, omnidirectional mobile robots can easily slip because of the nature of omni-wheels with multiple free rollers, and dead reckoning will not work if even one wheel is not attached to the ground. An odometry method where the data is not affected by wheel slip must be introduced to acquire high quality self-location data for omnidirectional mobile robots. We describe a method to obtain robot ego-motion using camera images and optical flow calculation, i.e., where the camera is used as a velocity sensor. In this paper, a silicon retina vision camera is introduced as a mobile robot sensor, which has a good dynamic range under various lighting conditions. A Field-Programmable Gate Array (FPGA) optical flow circuit for the silicon retina is also developed to measure ego-motion of the mobile robot. The developed optical flow calculation system is introduced into a small omnidirectional mobile robot and evaluation experiments for the mobile robot ego-motion are carried out. In the experiments, the accuracy of self-location by the dead reckoning and optical flow methods are evaluated by comparison using motion capture. The results show that the correct position is obtained by the optical flow sensor rather than by dead reckoning.     

Artificial pheromone for path selection by a foraging swarm of robots

Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.     

Do Ants Need to Estimate the Geometrical Properties of Trail Bifurcations to Find an Efficient Route? A Swarm Robotics Test Bed

Interactions between individuals and the structure of their environment play a crucial role in shaping self-organized collective behaviors. Recent studies have shown that ants crossing asymmetrical bifurcations in a network of galleries tend to follow the branch that deviates the least from their incoming direction. At the collective level, the combination of this tendency and the pheromone-based recruitment results in a greater likelihood of selecting the shortest path between the colony''s nest and a food source in a network containing asymmetrical bifurcations. It was not clear however what the origin of this behavioral bias is. Here we propose that it results from a simple interaction between the behavior of the ants and the geometry of the network, and that it does not require the ability to measure the angle of the bifurcation. We tested this hypothesis using groups of ant-like robots whose perceptual and cognitive abilities can be fully specified. We programmed them only to lay down and follow light trails, avoid obstacles and move according to a correlated random walk, but not to use more sophisticated orientation methods. We recorded the behavior of the robots in networks of galleries presenting either only symmetrical bifurcations or a combination of symmetrical and asymmetrical bifurcations. Individual robots displayed the same pattern of branch choice as individual ants when crossing a bifurcation, suggesting that ants do not actually measure the geometry of the bifurcations when travelling along a pheromone trail. Finally at the collective level, the group of robots was more likely to select one of the possible shorter paths between two designated areas when moving in an asymmetrical network, as observed in ants. This study reveals the importance of the shape of trail networks for foraging in ants and emphasizes the underestimated role of the geometrical properties of transportation networks in general.     

A Hybrid Search Algorithm for Swarm Robots Searching in an Unknown Environment

This paper proposes a novel method to improve the efficiency of a swarm of robots searching in an unknown environment. The approach focuses on the process of feeding and individual coordination characteristics inspired by the foraging behavior in nature. A predatory strategy was used for searching; hence, this hybrid approach integrated a random search technique with a dynamic particle swarm optimization (DPSO) search algorithm. If a search robot could not find any target information, it used a random search algorithm for a global search. If the robot found any target information in a region, the DPSO search algorithm was used for a local search. This particle swarm optimization search algorithm is dynamic as all the parameters in the algorithm are refreshed synchronously through a communication mechanism until the robots find the target position, after which, the robots fall back to a random searching mode. Thus, in this searching strategy, the robots alternated between two searching algorithms until the whole area was covered. During the searching process, the robots used a local communication mechanism to share map information and DPSO parameters to reduce the communication burden and overcome hardware limitations. If the search area is very large, search efficiency may be greatly reduced if only one robot searches an entire region given the limited resources available and time constraints. In this research we divided the entire search area into several subregions, selected a target utility function to determine which subregion should be initially searched and thereby reduced the residence time of the target to improve search efficiency.