Collective decision-making in living and artificial systems: editorial

decision-making


3
So far, the design of algorithms for decentralized artificial systems has been largely inspired by studies of animal behavior in which a group of animals self-organize. Studies on the selection of nest sites (Seeley et al. 2012;Detrain and Deneubourg 2008) or foraging sites (Shaffer et al. 2013;Deneubourg and Goss 1989) as well as on how a common direction of motion is chosen (Couzin et al. 2005) led to the development of algorithms and models for logically analogous robotic systems for consensus agreement (Valentini 2017), allocation to resources (Talamali et al. 2020), and coordination of motion (Ferrante et al. 2012). In this context, a new frontier for artificial systems is to design algorithms capable to explicitly deal with spatial constraints (Dorigo et al. 2020). In "Nest choice in arboreal ants is an emergent consequence of network creation under spatial constraints," Joanna Chang, Scott Powell, Elva J. H. Robinson, and Matina C. Donaldson-Matasci provide the biological basis for new developments in this direction by investigating how spatially constrained pathways affect the selection of nest sites by turtle ants. These ants live in an arboreal environment and rely on available branches to form transport networks between multiple nests and foraging locations. The selection of proper nest sites requires therefore to account for the spatial constraints imposed by their environment. Chang and colleagues collected experimental evidence in the laboratory by varying the configuration of transport networks connecting different nest sites and subsequently developed an agent-based model to further explore the behavioral mechanisms underlying their observations. They found that simple random movements coupled with a constrained environment and a tendency of turtle ants to aggregate in higher density areas suffice to converge to a collective decision.
In "Enhanced or distorted wisdom of crowds? An agent-based model of opinion formation under social influence," Pavlin Mavrodiev and Frank Schweitzer warn us about possible side effects of social influence on the wisdom of crowds. Using an agent-based model and by varying the amount of information available to individual agents to make a decision, they show that social influence generally reduces the benefits of the wisdom of the crowd. The study of Mavrodiev and Schweitzer serves as an admonishment to engineers of artificial systems that new mechanisms capable to counterbalance the side effects of social influence are necessary.
The gap between studies of living and artificial collectives is typically bridged through the use of mathematical modeling. For example, irrespective of the nature of the collective system at hand, collective decision-making processes are generally based on a combination of positive and negative feedback loops. In "Analysis and control of agreement and disagreement opinion cascades," Alessio Franci, Anastasia Bizyaeva, Shinkyu Park, and Naomi E. Leonard analyze a generic model of collective decision-making based on excitatory and inhibitory feedback loops among opinions (Bizyaeva et al. 2020). Their mathematical model generalizes a large class of decentralized voting strategies studied in the literature and based on excitatory/inhibitory feedback loops (e.g., Gray et al. 2018;Altafini 2013;Seeley et al. 2012;Reina et al. 2017); it is therefore of interest both to researchers studying natural collectives and to those engineering artificial systems. The authors show that through certain simplifications and assumptions, their model can be mathematically analyzed via a small set of control parameters. By regulating the "attention" parameter, that indicates the tendency of an individual to align with or deviate from the preferences of its peers, a collective can converge to a consensus or split into sub-populations with polarized opinions. Through a combination of bifurcation and graph theory, Franci and colleagues also illustrate efficient methods to control the decision of a collective system composed of individuals that follow simple excitation and inhibition rules.
The mechanism through which individuals combine error-prone estimates of environmental features with social information received from their peers is key to make collective decisions. Simple reactive rules, such as excitation and inhibition, have the advantage of requiring limited cognitive abilities. The benefits of simple rules, however, are counterpoised by suboptimal collective performance. More advanced mechanisms, such as sophisticated fusion operators, have the potential to grant better collective performance at the cost of increased requirements at the individual level. In this special issue, two studies explore this research direction by designing robot swarms' behaviors based on fusion operators from epistemic logic in the context of the best-of-n problem. In "Multi-featured collective perception with evidence theory: Tackling spatial correlations," Palina Bartashevich and Sanaz Mostaghim compare the performance of eight fusion operators from evidence theory (Dempster 1967;Shafer 1976) in the presence of highly variable noise. The authors consider several possible environments that differ in the type of noise experienced by individuals: from uniform noise throughout the entire environment, to highly heterogeneous levels of noise across different locations. Their results, obtained through agent-based simulations, show that swarms of limited size benefit the most by employing the fusion operator of "proportional conflict redistribution" (Smarandache and Dezert 2005). However, their results also evidence scalability limits of the tested fusion operators in the case of large swarms and for a large number of available options. A possible solution to scalability problems of fusion operations is proposed in "Negative updating applied to the best-of-n problem with noisy qualities" by Chanelle Lee, Jonathan Lawry, and Alan F. T. Winfield. The authors show that probabilistic opinion pooling operators can be successfully applied in swarm robotics. They consider a site-selection problem and allow for robots in close proximity of a site to obtain a noisy estimate of the site quality. By means of real-robot experiments, they show that the negative update of evidence allows the swarm to correct individual errors and to efficiently select the best site among a large number of alternatives, even when the number of options is larger than the number of robots comprising the swarm.
Whereas most initial studies in swarm robotics focused on binary problems , with only few examples considering a larger number of options Lee et al. 2018;Talamali et al. 2019), we can appreciate in this special issue a shift in research focus as demonstrated by the studies of Franci et al., Lee et al., and Bartashevich and Mostaghim, discussed earlier. In "Collective preference learning in the bestof-n problem: From best-of-n to ranking n," Michael Crosscombe and Jonathan Lawry also pursue this research direction and propose the ranking of all available options as a viable and more efficient alternative to repeatedly solve a series of best-of-n problems. By comparing the performance of a set of decentralized ranking algorithms over increasing levels of noise and numbers of options, they provide evidence of a trade-off between improved collective performance and lower computational costs at the level of the individuals.
In addition to reaching an agreement, the individuals of a group involved in a collective decision-making process must understand when the decision is made-a process often referred to as quorum sensing (Pratt et al. 2002;Waters and Bassler 2005). In "Quorum sensing without deliberation: Biological inspiration for externalizing computation to physical spaces in multi-robot systems" 1 , Theodore P. Pavlic, Jake Hanson, Gabriele Valentini, Sara I. Walker, and Stephen C. Pratt propose a quorum-sensing mechanism that does not require robots to accumulate information over time within their memory. Canonical implementations of quorum sensing are generally based on keeping track of encounters with other swarm members with the aim to estimate an encounter rate and, on this basis, to decide when a quorum is met. Instead, Pavlic et al. propose a mechanism that does not require the circuitry necessary to implement a digital counter but externalizes such computation into the environment. Although the ability to count encounters can be taken as granted in most types of robots, this study contributes toward the challenge of designing collective decision-making in swarms of individuals with minimal computation abilities, such as, for example, future nano-robot swarms for medical applications (Yasa et al. 2020).
As demonstrated by the diversity of contributions in this special issue, collective decision-making is a research area whose success requires a highly interdisciplinary approach. By organizing this special issue, we aimed to foster such an interdisciplinary approach and to promote an exchange of consolidated concepts and new ideas across researchers from different scientific fields. Much research is still required to advance our understanding of the many ways a group of individuals can make collective decisions and we believe this issue can serve to motivate the scientific community in this direction.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http:// creat iveco mmons. org/ licen ses/ by/4. 0/.