336 research outputs found

    Collective learning and optimal consensus decisions in social animal groups.

    Get PDF
    Published onlineJournal ArticleResearch Support, Non-U.S. Gov'tResearch Support, U.S. Gov't, Non-P.H.S.Learning has been studied extensively in the context of isolated individuals. However, many organisms are social and consequently make decisions both individually and as part of a collective. Reaching consensus necessarily means that a single option is chosen by the group, even when there are dissenting opinions. This decision-making process decouples the otherwise direct relationship between animals' preferences and their experiences (the outcomes of decisions). Instead, because an individual's learned preferences influence what others experience, and therefore learn about, collective decisions couple the learning processes between social organisms. This introduces a new, and previously unexplored, dynamical relationship between preference, action, experience and learning. Here we model collective learning within animal groups that make consensus decisions. We reveal how learning as part of a collective results in behavior that is fundamentally different from that learned in isolation, allowing grouping organisms to spontaneously (and indirectly) detect correlations between group members' observations of environmental cues, adjust strategy as a function of changing group size (even if that group size is not known to the individual), and achieve a decision accuracy that is very close to that which is provably optimal, regardless of environmental contingencies. Because these properties make minimal cognitive demands on individuals, collective learning, and the capabilities it affords, may be widespread among group-living organisms. Our work emphasizes the importance and need for theoretical and experimental work that considers the mechanism and consequences of learning in a social context.This research was supported by a National Science Foundation Graduate Research Fellowship and National Science Foundation Doctoral Dissertation Improvement Grant 1210029 to ABK, a National Sciences and Engineering Research Council of Canada Fellowship to NM, and National Science Foundation Award PHY-0848755 and EAGER Grant IOS-1251585, Office of Naval Research Award N00014-09-1-1074, Army Research Office Grant W911NG-11-1-0385, and Human Frontiers Science Program Award RGP0065/2012 to IDC

    On Steering Swarms

    Full text link
    The main contribution of this paper is a novel method allowing an external observer/controller to steer and guide swarms of identical and indistinguishable agents, in spite of the agents' lack of information on absolute location and orientation. Importantly, this is done via simple global broadcast signals, based on the observed average swarm location, with no need to send control signals to any specific agent in the swarm

    Dynamical modeling of collective behavior from pigeon flight data: flock cohesion and dispersion

    Get PDF
    Several models of flocking have been promoted based on simulations with qualitatively naturalistic behavior. In this paper we provide the first direct application of computational modeling methods to infer flocking behavior from experimental field data. We show that this approach is able to infer general rules for interaction, or lack of interaction, among members of a flock or, more generally, any community. Using experimental field measurements of homing pigeons in flight we demonstrate the existence of a basic distance dependent attraction/repulsion relationship and show that this rule is sufficient to explain collective behavior observed in nature. Positional data of individuals over time are used as input data to a computational algorithm capable of building complex nonlinear functions that can represent the system behavior. Topological nearest neighbor interactions are considered to characterize the components within this model. The efficacy of this method is demonstrated with simulated noisy data generated from the classical (two dimensional) Vicsek model. When applied to experimental data from homing pigeon flights we show that the more complex three dimensional models are capable of predicting and simulating trajectories, as well as exhibiting realistic collective dynamics. The simulations of the reconstructed models are used to extract properties of the collective behavior in pigeons, and how it is affected by changing the initial conditions of the system. Our results demonstrate that this approach may be applied to construct models capable of simulating trajectories and collective dynamics using experimental field measurements of herd movement. From these models, the behavior of the individual agents (animals) may be inferred

    Collective Animal Behavior from Bayesian Estimation and Probability Matching

    Get PDF
    Animals living in groups make movement decisions that depend, among other factors, on social interactions with other group members. Our present understanding of social rules in animal collectives is based on empirical fits to observations and we lack first-principles approaches that allow their derivation. Here we show that patterns of collective decisions can be derived from the basic ability of animals to make probabilistic estimations in the presence of uncertainty. We build a decision-making model with two stages: Bayesian estimation and probabilistic matching.
In the first stage, each animal makes a Bayesian estimation of which behavior is best to perform taking into account personal information about the environment and social information collected by observing the behaviors of other animals. In the probability matching stage, each animal chooses a behavior with a probability given by the Bayesian estimation that this behavior is the most appropriate one. This model derives very simple rules of interaction in animal collectives that depend only on two types of reliability parameters, one that each animal assigns to the other animals and another given by the quality of the non-social information. We test our model by obtaining theoretically a rich set of observed collective patterns of decisions in three-spined sticklebacks, Gasterosteus aculeatus, a shoaling fish species. The quantitative link shown between probabilistic estimation and collective rules of behavior allows a better contact with other fields such as foraging, mate selection, neurobiology and psychology, and gives predictions for experiments directly testing the relationship between estimation and collective behavior

    On the Necessary Memory to Compute the Plurality in Multi-Agent Systems

    Get PDF
    We consider the Relative-Majority Problem (also known as Plurality), in which, given a multi-agent system where each agent is initially provided an input value out of a set of kk possible ones, each agent is required to eventually compute the input value with the highest frequency in the initial configuration. We consider the problem in the general Population Protocols model in which, given an underlying undirected connected graph whose nodes represent the agents, edges are selected by a globally fair scheduler. The state complexity that is required for solving the Plurality Problem (i.e., the minimum number of memory states that each agent needs to have in order to solve the problem), has been a long-standing open problem. The best protocol so far for the general multi-valued case requires polynomial memory: Salehkaleybar et al. (2015) devised a protocol that solves the problem by employing O(k2k)O(k 2^k) states per agent, and they conjectured their upper bound to be optimal. On the other hand, under the strong assumption that agents initially agree on a total ordering of the initial input values, Gasieniec et al. (2017), provided an elegant logarithmic-memory plurality protocol. In this work, we refute Salehkaleybar et al.'s conjecture, by providing a plurality protocol which employs O(k11)O(k^{11}) states per agent. Central to our result is an ordering protocol which allows to leverage on the plurality protocol by Gasieniec et al., of independent interest. We also provide a Ω(k2)\Omega(k^2)-state lower bound on the necessary memory to solve the problem, proving that the Plurality Problem cannot be solved within the mere memory necessary to encode the output.Comment: 14 pages, accepted at CIAC 201

    Copycat dynamics in leaderless animal group navigation

    Get PDF
    Background: Many animals are known to have improved navigational efficiency when moving together as a social group. One potential mechanism for social group navigation is known as the 'many wrongs principle', where information from many inaccurate compasses is pooled across the group. In order to understand how animal groups may use the many wrongs principle to navigate, it is important to consider how directional information is transferred and shared within the group. Methods: Here we use an individual-based model to explore the information-sharing and copying dynamics of a leaderless animal group navigating towards a target in a virtual environment. We assume that communication and information-sharing is indirect and arises through individuals partially copying the movement direction of their neighbours and weighting this information relative to their individual navigational knowledge. Results: We find that the best group navigation performance occurs when individuals directly copy the direction of movement of a subset of their neighbours while only giving a small (6%) weighting to their individual navigational knowledge. Surprisingly, such a strategy is shown to be highly efficient regardless of the level of individual navigational error. We find there is little relative improvement in navigational efficiency when individuals copy from more than 7 influential neighbours. Conclusions: Our findings suggest that we would expect navigating group-living animals to predominantly copy the movement of others rather than relying on their own navigational knowledge. We discuss our results in the context of individual and group navigation behaviour in animals

    Effects of anisotropic interactions on the structure of animal groups

    Full text link
    This paper proposes an agent-based model which reproduces different structures of animal groups. The shape and structure of the group is the effect of simple interaction rules among individuals: each animal deploys itself depending on the position of a limited number of close group mates. The proposed model is shown to produce clustered formations, as well as lines and V-like formations. The key factors which trigger the onset of different patterns are argued to be the relative strength of attraction and repulsion forces and, most important, the anisotropy in their application.Comment: 22 pages, 9 figures. Submitted. v1-v4: revised presentation; extended simulations; included technical results. v5: added a few clarification

    On the duality between interaction responses and mutual positions in flocking and schooling.

    Get PDF
    Recent research in animal behaviour has contributed to determine how alignment, turning responses, and changes of speed mediate flocking and schooling interactions in different animal species. Here, we propose a complementary approach to the analysis of flocking phenomena, based on the idea that animals occupy preferential, anysotropic positions with respect to their neighbours, and devote a large amount of their interaction responses to maintaining their mutual positions. We test our approach by deriving the apparent alignment and attraction responses from simulated trajectories of animals moving side by side, or one in front of the other. We show that the anisotropic positioning of individuals, in combination with noise, is sufficient to reproduce several aspects of the movement responses observed in real animal groups. This anisotropy at the level of interactions should be considered explicitly in future models of flocking and schooling. By making a distinction between interaction responses involved in maintaining a preferred flock configuration, and interaction responses directed at changing it, our work provides a frame to discriminate movement interactions that signal directional conflict from interactions underlying consensual group motion

    Collective behavior from surprise minimization

    Get PDF
    Collective motion is ubiquitous in nature; groups of animals, such as fish, birds, and ungulates appear to move as a whole, exhibiting a rich behavioral repertoire that ranges from directed movement to milling to disordered swarming. Typically, such macroscopic patterns arise from decentralized, local interactions among constituent components (e.g., individual fish in a school). Preeminent models of this process describe individuals as self-propelled particles, subject to self-generated motion and "social forces" such as short-range repulsion and long-range attraction or alignment. However, organisms are not particles; they are probabilistic decision-makers. Here, we introduce an approach to modeling collective behavior based on active inference. This cognitive framework casts behavior as the consequence of a single imperative: to minimize surprise. We demonstrate that many empirically observed collective phenomena, including cohesion, milling, and directed motion, emerge naturally when considering behavior as driven by active Bayesian inference-without explicitly building behavioral rules or goals into individual agents. Furthermore, we show that active inference can recover and generalize the classical notion of social forces as agents attempt to suppress prediction errors that conflict with their expectations. By exploring the parameter space of the belief-based model, we reveal nontrivial relationships between the individual beliefs and group properties like polarization and the tendency to visit different collective states. We also explore how individual beliefs about uncertainty determine collective decision-making accuracy. Finally, we show how agents can update their generative model over time, resulting in groups that are collectively more sensitive to external fluctuations and encode information more robustly
    corecore