Collective decision making in dynamic environments

Abstract: Collective decision making is the ability of individuals to jointly make a decision without any centralized leadership, but only relying on local interactions. A special case is represented by the best-of-n problem, whereby the swarm has to select the best option among a set of n discrete alternatives. In this paper, we perform a thorough study of the best-of-n problem in dynamic environments, in the presence of two options (n=2). Site qualities can be directly measured by agents, and we introduce abrupt changes to these qualities. We introduce two adaptation mechanisms to deal with dynamic site qualities: stubborn agents and spontaneous opinion switching. Using both computer simulations and ordinary differential equation models, we show that: (i) The mere presence of the stubborn agents is enough to achieve adaptability, but increasing its number has detrimental effects on the performance; (ii) the system adaptation increases with increasing swarm size, while it does not depend on agents’ density, unless this is below a critical threshold; (iii) the spontaneous switching mechanism can also be used to achieve adaptability to dynamic environments, and its key parameter, the probability of switching, can be used to regulate the trade-off between accuracy and speed of adaptation

Collective decision making in dynamic environments

© 2019, The Author(s). Collective decision making is the ability of individuals to jointly make a decision without any centralized leadership, but only relying on local interactions. A special case is represented by the best-of-n problem, whereby the swarm has to select the best option among a set of n discrete alternatives. In this paper, we perform a thorough study of the best-of-n problem in dynamic environments, in the presence of two options (n= 2). Site qualities can be directly measured by agents, and we introduce abrupt changes to these qualities. We introduce two adaptation mechanisms to deal with dynamic site qualities: stubborn agents and spontaneous opinion switching. Using both computer simulations and ordinary differential equation models, we show that: (i) The mere presence of the stubborn agents is enough to achieve adaptability, but increasing its number has detrimental effects on the performance; (ii) the system adaptation increases with increasing swarm size, while it does not depend on agents’ density, unless this is below a critical threshold; (iii) the spontaneous switching mechanism can also be used to achieve adaptability to dynamic environments, and its key parameter, the probability of switching, can be used to regulate the trade-off between accuracy and speed of adaptation

Collective decision making in dynamic environments

Abstract: Collective decision making is the ability of individuals to jointly make a decision without any centralized leadership, but only relying on local interactions. A special case is represented by the best-of-n problem, whereby the swarm has to select the best option among a set of n discrete alternatives. In this paper, we perform a thorough study of the best-of-n problem in dynamic environments, in the presence of two options (n=2). Site qualities can be directly measured by agents, and we introduce abrupt changes to these qualities. We introduce two adaptation mechanisms to deal with dynamic site qualities: stubborn agents and spontaneous opinion switching. Using both computer simulations and ordinary differential equation models, we show that: (i) The mere presence of the stubborn agents is enough to achieve adaptability, but increasing its number has detrimental effects on the performance; (ii) the system adaptation increases with increasing swarm size, while it does not depend on agents’ density, unless this is below a critical threshold; (iii) the spontaneous switching mechanism can also be used to achieve adaptability to dynamic environments, and its key parameter, the probability of switching, can be used to regulate the trade-off between accuracy and speed of adaptation

Quality-sensitive foraging by a robot swarm through virtual pheromone trails

Large swarms of simple autonomous robots can be employed to find objects clustered at random locations, and transport them to a central depot. This solution offers system parallelisation through concurrent environment exploration and object collection by several robots, but it also introduces the challenge of robot coordination. Inspired by ants’ foraging behaviour, we successfully tackle robot swarm coordination through indirect stigmergic communication in the form of virtual pheromone trails. We design and implement a robot swarm composed of up to 100 Kilobots using the recent technology Augmented Reality for Kilobots (ARK). Using pheromone trails, our memoryless robots rediscover object sources that have been located previously. The emerging collective dynamics show a throughput inversely proportional to the source distance. We assume environments with multiple sources, each providing objects of different qualities, and we investigate how the robot swarm balances the quality-distance trade-off by using quality-sensitive pheromone trails. To our knowledge this work represents the largest robotic experiment in stigmergic foraging, and is the first complete demonstration of ARK, showcasing the set of unique functionalities it provides

When less is more: Robot swarms adapt better to changes with constrained communication

To effectively perform collective monitoring of dynamic environments, a robot swarm needs to adapt to changes by processing the latest information and discarding outdated beliefs. We show that in a swarm composed of robots relying on local sensing, adaptation is better achieved if the robots have a shorter rather than longer communication range. This result is in contrast with the widespread belief that more communication links always improve the information exchange on a network. We tasked robots with reaching agreement on the best option currently available in their operating environment. We propose a variety of behaviors composed of reactive rules to process environmental and social information. Our study focuses on simple behaviors based on the voter model—a well-known minimal protocol to regulate social interactions—that can be implemented in minimalistic machines. Although different from each other, all behaviors confirm the general result: The ability of the swarm to adapt improves when robots have fewer communication links. The average number of links per robot reduces when the individual communication range or the robot density decreases. The analysis of the swarm dynamics via mean-field models suggests that our results generalize to other systems based on the voter model. Model predictions are confirmed by results of multiagent simulations and experiments with 50 Kilobot robots. Limiting the communication to a local neighborhood is a cheap decentralized solution to allow robot swarms to adapt to previously unknown information that is locally observed by a minority of the robots

A quantitative micro-macro link for collective decisions: the shortest path discovery/selection example

In this paper, we study how to obtain a quantitative correspondence between the dynamics of the microscopic implementation of a robot swarm and the dynamics of a macroscopic model of nest-site selection in honeybees. We do so by considering a collec- tive decision-making case study: the shortest path discovery/selection problem. In this case study, obtaining a quantitative correspondence between the microscopic and macroscopic dynamics-the so-called micro-macro link problem-is particularly challenging because the macroscopic model does not take into account the spatial factors inherent to the path discovery/selection problem. We frame this study in the context of a general engineering methodology that prescribes the inclusion of available theoretical knowledge about target macroscopic models into design patterns for the microscopic implementation. The attain- ment of the micro-macro link presented in this paper represents a necessary step towards the formalisation of a design pattern for collective decision making in distributed systems