1,421 research outputs found

    Starling flock networks manage uncertainty in consensus at low cost

    Get PDF
    Flocks of starlings exhibit a remarkable ability to maintain cohesion as a group in highly uncertain environments and with limited, noisy information. Recent work demonstrated that individual starlings within large flocks respond to a fixed number of nearest neighbors, but until now it was not understood why this number is seven. We analyze robustness to uncertainty of consensus in empirical data from multiple starling flocks and show that the flock interaction networks with six or seven neighbors optimize the trade-off between group cohesion and individual effort. We can distinguish these numbers of neighbors from fewer or greater numbers using our systems-theoretic approach to measuring robustness of interaction networks as a function of the network structure, i.e., who is sensing whom. The metric quantifies the disagreement within the network due to disturbances and noise during consensus behavior and can be evaluated over a parameterized family of hypothesized sensing strategies (here the parameter is number of neighbors). We use this approach to further show that for the range of flocks studied the optimal number of neighbors does not depend on the number of birds within a flock; rather, it depends on the shape, notably the thickness, of the flock. The results suggest that robustness to uncertainty may have been a factor in the evolution of flocking for starlings. More generally, our results elucidate the role of the interaction network on uncertainty management in collective behavior, and motivate the application of our approach to other biological networks.Comment: 19 pages, 3 figures, 9 supporting figure

    Resilience and Controllability of Dynamic Collective Behaviors

    Get PDF
    The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics

    Consensus reaching in swarms ruled by a hybrid metric-topological distance

    Full text link
    Recent empirical observations of three-dimensional bird flocks and human crowds have challenged the long-prevailing assumption that a metric interaction distance rules swarming behaviors. In some cases, individual agents are found to be engaged in local information exchanges with a fixed number of neighbors, i.e. a topological interaction. However, complex system dynamics based on pure metric or pure topological distances both face physical inconsistencies in low and high density situations. Here, we propose a hybrid metric-topological interaction distance overcoming these issues and enabling a real-life implementation in artificial robotic swarms. We use network- and graph-theoretic approaches combined with a dynamical model of locally interacting self-propelled particles to study the consensus reaching pro- cess for a swarm ruled by this hybrid interaction distance. Specifically, we establish exactly the probability of reaching consensus in the absence of noise. In addition, simulations of swarms of self-propelled particles are carried out to assess the influence of the hybrid distance and noise

    Beyond Reynolds: A Constraint-Driven Approach to Cluster Flocking

    Full text link
    In this paper, we present an original set of flocking rules using an ecologically-inspired paradigm for control of multi-robot systems. We translate these rules into a constraint-driven optimal control problem where the agents minimize energy consumption subject to safety and task constraints. We prove several properties about the feasible space of the optimal control problem and show that velocity consensus is an optimal solution. We also motivate the inclusion of slack variables in constraint-driven problems when the global state is only partially observable by each agent. Finally, we analyze the case where the communication topology is fixed and connected, and prove that our proposed flocking rules achieve velocity consensus.Comment: 6 page

    Self-organization of collective escape in pigeon flocks

    Get PDF
    Bird flocks under predation demonstrate complex patterns of collective escape. These patterns may emerge by self-organization from local interactions among group-members. Computational models have been shown to be valuable for identifying what behavioral rules may govern such interactions among individuals during collective motion. However, our knowledge of such rules for collective escape is limited by the lack of quantitative data on bird flocks under predation in the field. In the present study, we analyze the first GPS trajectories of pigeons in airborne flocks attacked by a robotic falcon in order to build a species-specific model of collective escape. We use our model to examine a recently identified distance-dependent pattern of collective behavior: the closer the prey is to the predator, the higher the frequency with which flock members turn away from it. We first extract from the empirical data of pigeon flocks the characteristics of their shape and internal structure (bearing angle and distance to nearest neighbors). Combining these with information on their coordination from the literature, we build an agent-based model adjusted to pigeons’ collective escape. We show that the pattern of turning away from the predator with increased frequency when the predator is closer arises without prey prioritizing escape when the predator is near. Instead, it emerges through self-organization from a behavioral rule to avoid the predator independently of their distance to it. During this self-organization process, we show how flock members increase their consensus over which direction to escape and turn collectively as the predator gets closer. Our results suggest that coordination among flock members, combined with simple escape rules, reduces the cognitive costs of tracking the predator while flocking. Such escape rules that are independent of the distance to the predator can now be investigated in other species. Our study showcases the important role of computational models in the interpretation of empirical findings of collective behavior

    Self-organization of collective escape in pigeon flocks

    Get PDF
    Bird flocks under predation demonstrate complex patterns of collective escape. These patterns may emerge by self-organization from local interactions among group-members. Computational models have been shown to be valuable for identifying what behavioral rules may govern such interactions among individuals during collective motion. However, our knowledge of such rules for collective escape is limited by the lack of quantitative data on bird flocks under predation in the field. In the present study, we analyze the first GPS trajectories of pigeons in airborne flocks attacked by a robotic falcon in order to build a species-specific model of collective escape. We use our model to examine a recently identified distance-dependent pattern of collective behavior: the closer the prey is to the predator, the higher the frequency with which flock members turn away from it. We first extract from the empirical data of pigeon flocks the characteristics of their shape and internal structure (bearing angle and distance to nearest neighbors). Combining these with information on their coordination from the literature, we build an agent-based model adjusted to pigeons’ collective escape. We show that the pattern of turning away from the predator with increased frequency when the predator is closer arises without prey prioritizing escape when the predator is near. Instead, it emerges through self-organization from a behavioral rule to avoid the predator independently of their distance to it. During this self-organization process, we show how flock members increase their consensus over which direction to escape and turn collectively as the predator gets closer. Our results suggest that coordination among flock members, combined with simple escape rules, reduces the cognitive costs of tracking the predator while flocking. Such escape rules that are independent of the distance to the predator can now be investigated in other species. Our study showcases the important role of computational models in the interpretation of empirical findings of collective behavior

    A Unified Analytical Look at Reynolds Flocking Rules

    Get PDF
    In this paper, we present a unified theoretical view of the so-called ``Flocking Rules of Reynolds'' introduced in 1987. No equations describing the rules or mathematical models of the mobile agents known as ``boids'' were presented in the original work by Reynolds. We show how to model a group of autonomous mobile agents by dynamic nets and achieve flocking by dissipation of the structural energy of the multi-agent system. As a by-product, we obtain a single protocol called the (alpha,alpha) protocol that encompasses all three flocking rules of Reynolds. We provide geometric interpretations of the advanced forms of some of these flocking rules. Simulation results are provided that demonstrate flocking of 100 agents towards a sink
    corecore