Segregation in swarms of mobile robots based on the Brazil nut effect

We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain size and broadcast this information locally. The motion of each particle is controlled by three reactive behaviors: random walk, taxis, and repulsion by other particles. The segregation task requires the swarm to self- ranked by particle size (e.g., annular structures or stripes). Using a physics-based computer simulation, we study the segregation performance of swarms of 50 mobile robots. The robots represent particles of three different sizes. We first analyze the problem of how to combine the basic behaviors so as to minimize the percentage of errors in rank. We then show that the system is very robust with respect to noise on inter-robot perception and communication. For a noise-level of 50%, the mean percentage of errors in rank is 1%. Moreover, we investigate a simplified version of the control algorithm, which does not rely on communication. Finally, we show that the mean percentage of errors in rank decreases exponentially as the particles’ size ratio increases. As the error is bounded, one can achieve 100% error-free segregation. The reduction in error, however, comes at the expense of an increase in the required sensing/communication range

Cooperation in Swarms of Robots without Communication

Swarm robotics aims to use a large group of relatively simple robots to solve tasks that can hardly be achieved by a single robot in the group. Compared to single robot systems with increased capability, a swarm robotic system may have advantages in robustness, flexibility and scalability. However, designing cooperative behaviors for a swarm robotic system is a challenging problem, especially when the robots may not have communication capabilities and thus only know local information. For a swarm of miniature mobile robots that cannot communicate explicitly, this thesis studies fully decentralized solutions of two problems. For the problem of cooperative transport, the thesis presents a strategy to push an object that is large enough to occlude the robots' perception of the goal of the transportation. For the problem of pattern formation, the thesis investigates algorithms based on the Brazil nut effect that can organize the swarm of robots into an annular formation. These problems are studied using physics-based computer simulations as well as experimental implementations based on the e-puck robotic platform. The simplicity of the solutions make them suitable for applications that require the individual robots to be as simple as possible. Example application scenarios could be micro robot swarms working in the human body

Adaptive foraging for simulated and real robotic swarms: The dynamical response threshold approach

Developing self-organised swarm systems capable of adapting to environmental changes as well as to dynamic situations is a complex challenge. An efficient labour division model, with the ability to regulate the distribution of work among swarm robots, is an important element of this kind of system. This paper extends the popular response threshold model and proposes a new adaptive response threshold model (ARTM). Experiments were carried out in simulation and in real-robot scenarios with the aim of studying the performance of this new adaptive model. Results presented in this paper verify that the extended approach improves on the adaptability of previous systems. For example, by reducing collision duration among robots in foraging missions, our approach helps small swarms of robots to adapt more efficiently to changing environments, thus increasing their self-sustainability (survival rate). Finally, we propose a minimal version of ARTM, which is derived from the conclusions drawn through real-robot and simulation results

Supervisory Control Theory for Controlling Swarm Robotics Systems

Swarm robotics systems have the potential to tackle many interesting problems. Their control software is mostly created by ad-hoc development. This makes it hard to deploy swarm robotics systems in real-world scenarios as it is difficult to analyse, maintain, or extend these systems. Formal methods can contribute to overcome these problems. However, they usually do not guarantee that the implementation matches the specification because the system’s control code is typically generated manually. This thesis studies the application of the supervisory control theory (SCT) framework in swarm robotics systems. SCT is widely applied and well established in the man- ufacturing context. It requires the system and the desired behaviours (specifications) to be defined as formal languages. In this thesis, regular languages are used. Regular languages, in the form of deterministic finite state automata, have already been widely applied for controlling swarm robotics systems, enabling a smooth transition from the ad-hoc development currently in practice. This thesis shows that the control code for swarm robotics systems can be automatically generated from formal specifications. Several case studies are presented that serve as guidance for those who want to learn how to specify swarm behaviours using SCT formally. The thesis provides the tools for the implementation of controllers using formal specifications. Controllers are validated on swarms of up to 600 physical robots through a series of systematic experiments. It is also shown that the same controllers can be automatically ported onto different robotics platforms, as long as they offer the required capabilities. The thesis extends and incorporates techniques to the supervisory control theory framework; specifically, the concepts of global events and the use of probabilistic generators. It can be seen as a step towards making formal methods a standard practice in swarm robotics

Swarm Robotic Systems with Minimal Information Processing

This thesis is concerned with the design and analysis of behaviors in swarm robotic systems using minimal information acquisition and processing. The motivation for this work is to contribute in paving the way for the implementation of swarm robotic systems at physically small scales, which will open up new application domains for their operation. At these scales, the space and energy available for the integration of sensors and computational hardware within the individual robots is at a premium. As a result, trade-offs in performance can be justified if a task can be achieved in a more parsimonious way. A framework is developed whereby meaningful collective behaviors in swarms of robots can be shown to emerge without the robots, in principle, possessing any run-time memory or performing any arithmetic computations. This is achieved by the robots having only discrete-valued sensors, and purely reactive controllers. Black-box search methods are used to automatically synthesize these controllers for desired collective behaviors. This framework is successfully applied to two canonical tasks in swarm robotics: self-organized aggregation of robots, and self-organized clustering of objects by robots. In the case of aggregation, the robots are equipped with one binary sensor, which informs them whether or not there is another robot in their line of sight. This makes the structure of the robots’ controller simple enough that its entire space can be systematically searched to locate the optimal controller (within a finite resolution). In the case of object clustering, the robots’ sensor is extended to have three states, distinguishing between robots, objects, and the background. This still requires no run-time memory or arithmetic computations on the part of the robots. It is statistically shown that the extension of the sensor to have three states leads to a better performance as compared to the cases where the sensor is binary, and cannot distinguish between robots and objects, or robots and the background

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Software integration in mobile robotics, a science to scale up machine intelligence

The present work tackles integration in mobile robotics. Integration is often considered to be a mere technique, unworthy of scientific investigation. On the contrary, we show that integrating capabilities in a mobile robot entails new questions that the parts alone do not feature. These questions reflect the structure of the application and the physics of the world. We also show that a successful integration process transforms the parts themselves and allows to scale up mobile-robot intelligence in real-world applications. In Chapter 2 we present the hardware. In Chapter 3, we show that building a low-level control architecture considering the mechanic and electronic reality of the robot improves the performances and allows to integrate a large number of sensors and actuators. In Chapter 4, we show that globally optimising mechatronic parameters considering the robot as a whole allows to implement slam using an inexpensive sensor with a low processor load. In Chapter 5, we show that based on the output from the slam algorithm, we can combine infrared proximity sensors and vision to detect objects and to build a semantic map of the environment. We show how to find free paths for the robot and how to create a dual geometric-symbolic representation of the world. In Chapter 6, we show that the nature of scenarios influences the implementation of a task-planning algorithm and changes its execution properties. All these chapters contribute results that together prove that integration is a science. In Chapter 7, we show that combining these results improves the state of the art in a difficult application : autonomous construction in unknown environments with scarce resources. This application is interesting because it is challenging at multiple levels : For low-level control, manipulating objects in the real world to build structures is difficult. At the level of perceptions, the fusion of multiple heterogeneous inexpensive sensors is not trivial, because these sensors are noisy and the noise is non-Gaussian. At the level of cognition, reasoning about elements from an unknown world in real time on a miniature robot is demanding. Building this application upon our other results proves that integration allows to scale up machine intelligence, because this application shows intelligence that is beyond the state of the art, still only combining basic components that are individually slightly behind the state of the art

Evolutionary Computation

This book presents several recent advances on Evolutionary Computation, specially evolution-based optimization methods and hybrid algorithms for several applications, from optimization and learning to pattern recognition and bioinformatics. This book also presents new algorithms based on several analogies and metafores, where one of them is based on philosophy, specifically on the philosophy of praxis and dialectics. In this book it is also presented interesting applications on bioinformatics, specially the use of particle swarms to discover gene expression patterns in DNA microarrays. Therefore, this book features representative work on the field of evolutionary computation and applied sciences. The intended audience is graduate, undergraduate, researchers, and anyone who wishes to become familiar with the latest research work on this field