We propose a novel, information-theoretic, characterisation of cascades within the spatiotemporal dynamics of swarms, explicitly measuring the extent of collective communications. This is complemented by dynamic tracing of collective memory, as another element of distributed computation, which represents capacity for swarm coherence. The approach deals with both global and local information dynamics, ultimately discovering diverse ways in which an individual’s spatial position is related to its information processing role. It also allows us to contrast cascades that propagate conflicting information with waves of coordinated motion. Most importantly, our simulation experiments provide the first direct information-theoretic evidence (verified in a simulation setting) for the long-held conjecture that the information cascades occur in waves rippling through the swarm. Our experiments also exemplify how features of swarm dynamics, such as cascades’ wavefronts, can be filtered and predicted. We observed that maximal information transfer tends to follow the stage with maximal collective memory, and principles like this may be generalised in wider biological and social contexts.
In this paper, we analyze and evaluate swarm interactions using varying amounts of kinetic memory, defined as the stored velocity states for n discrete time steps in the past. We show that kinetic memory can play a key role in the dynamics of biological and artificial aggregations. It is reasonable to suppose that individuals possess a memory of the immediate past and use this information to their advantage when swarming. Similarly, in wireless robotic applications, the storage of past movements requires nocommunication and can be used to stabilize aggregations. In fact, in wireless robotic applications, the communication rate between nearby individuals is more limited than in many biological applications, so the time step used to update an individual's velocity is greater. In this paper, we develop and analyze updating schemes for interacting individuals in a swarm. We show that we can stabilize and destabilize coherent translating structures using suitable adjustments to the updating scheme. Using this framework, we design an updating scheme to provide maximum stability for coherent structures that arise from a three-zone swarming model. Finally, we verify the effectiveness of our updating methodology using realistic QualNet simulations of a swarm of networked robots.
Neurons in the inhibitory network of the striatum display cell assembly firing patterns which recent results suggest may consist of spatially compact neural clusters. Previous computational modeling of striatal neural networks has indicated that non-monotonic, distance-dependent coupling may promote spatially localized cluster firing. Here, we identify conditions for the existence and stability of cluster firing solutions in which clusters consist of spatially adjacent neurons in inhibitory neural networks. We consider simple non-monotonic, distance-dependent connectivity schemes in weakly coupled 1-D networks where cells make strong connections with their
k
th nearest neighbors on each side. Using the phase model reduction of the network system, we prove the existence of cluster solutions where neurons that are spatially close together are also synchronized in the same cluster, and find stability conditions for these solutions. Our analysis predicts the long-term behavior for networks of neurons, and we confirm our results by numerical simulations of biophysical neuron network models. Additionally, we add weaker coupling between closer neighbors as a perturbation to our network connectivity. We analyze the existence and stability of cluster solutions of the perturbed network and validate our results with numerical simulations. Our results demonstrate that an inhibitory network with non-monotonic, distance-dependent connectivity can exhibit cluster solutions where adjacent cells fire together.