I am best known for my work in the field of engineering distributed decision-making, which aims to design artificial swarm systems capable of making consensus decisions. I employ a multiscale modelling technique to deeply understand the system before implementing it on swarms composed of hundreds of robots. I have been invited by several institutes for to give lectures on this topic, illustrate the techniques I developed, and showcase robot swarm results.
One relevant decision problem is the best-of-n problem, in which the goal is to select the best option among a set of alternatives. In my studies, individual robots are simplistic as they only perform diffusive search, make local noisy estimates of the options’ quality, and exchange information with near neighbours. My main contribution has been to design decentralised algorithms, inspired by house-hunting honeybees, to efficiently aggregate noisy estimations of the individual robots in order to reach a consensus for the best option. The design of the algorithms has been based on principled multiscale modelling which consists in a combination of statistical physics techniques, computational models, and multiagent simulations. In particular, we link the macroscopic dynamics of the swarm, which we describe through ODEs and master equations, to the microscopic behaviour executed by the individ- ual robots. In my studies, I perform a gradual implementation starting with non-spatial simulations, passing to self-propelled particles that allow investigations on the effect of spatial correlations and spatial biases, moving to physics-based simulations that allow quantifying the effect of physical embodiment and interference, finally reaching robot swarm experiments that confirm the functioning of the algorithm on physical devices affected by noise and hardware failures. I conducted most of my robot experiments with the Kilobots which are minimalistic robots widespread for swarm robotics studies in academia.
In collective decisions in which the options have no quality or all have the same quality, the swarm should agree on one option and avoid to remain undecided with subgroups each favouring a different option. Through my research, I showed that while some decision models cannot break the decision deadlock and remain split into subgroups, other models prove able to show deadlock-breaking dynamics and reach consensus for one of the available options. Some models may also display value-sensitive dynamics by which the group selectively breaks or maintains the decision deadlock as a function of the opinion’s quality. If the equal-quality options have a quality above a given threshold, the group makes a decision, otherwise it refrains from deciding until a sufficient-quality option becomes available. Through my analyses, I show that these systems' dynamics are often determined by the balance between individual and social information.
The video below shows a swarm of 150 robots that take a value-sensitive decision. The robots follow a set of rules that are inspired by the behaviour of house-hunting honeybees. See the cited papers below for more information.
The minimal naming game is a model that describes basic mechanisms of how social conventions may form in a population without centralised coordination. In the naming game, a network of locally interacting individuals can spontaneously self-organise to reach global agreement. We tested how the naming game dynamics would change if we would move from computer simulations of self-propelled particles to the implementation on a swarm of physical robots.
Engineering distributed decision-making
|
Value-sensitive
decision-making |
Collective foraging with minimalist agents
|
Swarm Awareness
|