535 research outputs found
Dynamical modeling of collective behavior from pigeon flight data: flock cohesion and dispersion
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
Modeling Vortex Swarming In Daphnia
Based on experimental observations in Daphnia, we introduce an agent-based model for the motion of single and swarms of animals. Each agent is described by a stochastic equation that also considers the conditions for active biological motion. An environmental potential further reflects local conditions for Daphnia, such as attraction to light sources. This model is sufficient to describe the observed cycling behavior of single Daphnia. To simulate vortex swarming of many Daphnia, i.e. the collective rotation of the swarm in one direction, we extend the model by considering avoidance of collisions. Two different ansatzes to model such a behavior are developed and compared. By means of computer simulations of a multi-agent system we show that local avoidance—as a special form of asymmetric repulsion between animals—leads to the emergence of a vortex swarm. The transition from uncorrelated rotation of single agents to the vortex swarming as a function of the swarm size is investigated. Eventually, some evidence of avoidance behavior in Daphnia is provided by comparing experimental and simulation results for two animal
Nonparametric inference of interaction laws in systems of agents from trajectory data
Inferring the laws of interaction between particles and agents in complex
dynamical systems from observational data is a fundamental challenge in a wide
variety of disciplines. We propose a non-parametric statistical learning
approach to estimate the governing laws of distance-based interactions, with no
reference or assumption about their analytical form, from data consisting
trajectories of interacting agents. We demonstrate the effectiveness of our
learning approach both by providing theoretical guarantees, and by testing the
approach on a variety of prototypical systems in various disciplines. These
systems include homogeneous and heterogeneous agents systems, ranging from
particle systems in fundamental physics to agent-based systems modeling opinion
dynamics under the social influence, prey-predator dynamics, flocking and
swarming, and phototaxis in cell dynamics
Leader-following Consensus Control of a Distributed Linear Multi-agent System using a Sliding Mode Strategy
A distributed leader-following consensus control framework is proposed for a linear system. The linear system is first transformed into a regular form. Then a linear sliding mode is designed to provide high robustness, and the corresponding consensus protocol is proposed in a fully distributed fashion. When matched disturbances are present, it can be demonstrated that the system states reach the sliding mode in finite time and consensus can be achieved asymptotically using Lyapunov theory and the invariant set theorem. Simulation results validate the effectiveness of the proposed algorithm
Leader-following Consensus Control of a Distributed Linear Multi-agent System using a Sliding Mode Strategy
A distributed leader-following consensus control framework is proposed for a linear system. The linear system is first transformed into a regular form. Then a linear sliding mode is designed to provide high robustness, and the corresponding consensus protocol is proposed in a fully distributed fashion. When matched disturbances are present, it can be demonstrated that the system states reach the sliding mode in finite time and consensus can be achieved asymptotically using Lyapunov theory and the invariant set theorem. Simulation results validate the effectiveness of the proposed algorithm
- …