We demonstrate the ability of a swarm of autonomous micro-robots to perform collective decision making in a dynamic environment. This decision making is an emergent property of decentralized self-organization, which results from executing a very simple bio-inspired algorithm. This algorithm allows the robotic swarm to choose from several distinct light sources in the environment and to aggregate in the area with the highest illuminance. Interestingly, these decisions are formed by the collective, although no information is exchanged by the robots. The only communicative act is the detection of robot-to-robot encounters. We studied the performance of the robotic swarm under four environmental conditions and investigated the dynamics of the aggregation behaviour as well as the flexibility and the robustness of the solutions. In summary, we can report that the tested robotic swarm showed two main characteristic features of swarm systems: it behaved flexible and the achieved solutions were very robust. This was achieved with limited individual sensor abilities and with low computational effort on each single robot in the swarm.

/pdf/get-in-touch-cooperative-decision-making-based-on-robot-to-fjme2lyrc6.pdf

Get in touch: cooperative decision making based on robot-to-robot collisions

We consider the problem of source seeking using a group of mobile robots equipped with sensors for source concentration measurement. In the formulation, the robot team cooperatively estimates the gradient of the source field, moves to the source by tracing the gradient-ascending direction, and keeps a predefined formation in movement. We present two control algorithms with all-to-all and limited communications, respectively. For the case of all-to-all communication, rigorous analytic analysis proves that the formation center of the robots converges to the source in the presence of estimation errors with a bounded error, the upper bound of which is explicitly given. In the case of limited communication where centralized quantities are not available, distributed consensus filters are used to distributively estimate the centralized quantities, and then embedded in the distributed control laws. Numerical simulations are given to validate the effectiveness of the proposed approaches. Experimental results on the E-puck robot platform demonstrate satisfactory performances in a light source seeking application.

Cooperative Distributed Source Seeking by Multiple Robots: Algorithms and Experiments

This paper proposes a strategy for transporting a large object to a goal using a large number of mobile robots that are significantly smaller than the object. The robots only push the object at positions where the direct line of sight to the goal is occluded by the object. This strategy is fully decentralized and requires neither explicit communication nor specific manipulation mechanisms. We prove that it can transport any convex object in a planar environment. We implement this strategy on the e-puck robotic platform and present systematic experiments with a group of 20 e-pucks transporting three objects of different shapes. The objects were successfully transported to the goal in 43 out of 45 trials. When using a mobile goal, teleoperated by a human, the object could be navigated through an environment with obstacles. We also tested the strategy in a 3-D environment using physics-based computer simulation. Due to its simplicity, the transport strategy is particularly suited for implementation on microscale robotic systems.

Occlusion-Based Cooperative Transport with a Swarm of Miniature Mobile Robots

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.

Self-organized cooperation between robotic 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 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.

/pdf/majority-rule-opinion-dynamics-with-differential-latency-a-3mw0gmsoxh.pdf

Majority-rule opinion dynamics with differential latency: a mechanism for self-organized collective decision-making

In multi-robot system, communication is indispensable for effective cooperative working. In this system, direct communication by physical methods such as light, sound, radio wave is quite general. But in biological system, especially in the insect world, not only the physical but also the chemical communication methods can be observed. As the chemical methods have some unique properties, it is challenging to apply such a method to the cooperative multi-robot system. Unfortunately, to treat real chemical materials for the robots is not easy for now because of some technical difficulties. In this paper, we propose virtual pheromone system in which chemical signals are simulated with the graphics projected on the floor, and in which the robots decide their action depending on the color information of the graphics. We examined the performance of this system through the foraging task, which is one of the most popular tasks for multi-robot system and is generally observed in ant societies.

Foraging behavior of interacting robots with virtual pheromone

Division of labor is an important characteristic for multi-robot system. Especially, proportion regulation can be considered as one of the most indispensable factors for effective division of labor. In this paper, we propose a few models for optimum proportion regulation, and show some results mainly focusing on a threshold model.

http://ieeexplore.ieee.org/iel5/9240/29285/01323344.pdf

T. Kazama

Papers

Foraging behavior of interacting robots with virtual pheromone

Cooperative acceleration of task performance by simple interacting robots