Related papers: On the Dynamical Hierarchy in Gathering Protocols …

In the field of swarm robotics, one of the most studied problem is Gathering. It asks for a distributed algorithm that brings the robots to a common location, not known in advance. We consider the case of robots constrained to move along…

We study an ensemble of random walkers carrying internal noisy phase oscillators which are synchronized among the walkers by local interactions. Due to individual mobility, the interaction partners of every walker change randomly, hereby…

The cohesive collective motion (flocking, swarming) of autonomous agents is ubiquitously observed and exploited in both natural and man-made settings, thus, minimal models for its description are essential. In a model with continuous space…

The congestion formation on a urban road network is one of the key issue for the development of a sustainable mobility in the future smart cities. In this work we propose a reductionist approach studying the stationary states of a simple…

This study investigates the complex dynamic interactions between two typed populations coexisting within a shared space. We propose both theoretical and numerical study to analyze scenarios where one population (population $1$) must…

Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…

We construct the hydrodynamic theory of coherent collective motion ("flocking") at a solid-liquid interface. The polar order parameter and concentration of a collection of "active" (self-propelled) particles at a planar interface between a…

We derive a mode-coupling theory for the slow dynamics of fluids confined in disordered porous media represented by spherical particles randomly placed in space. Its equations display the usual nonlinear structure met in this theoretical…

We study a discrete-time asynchronous midpoint dynamics on the circle in which, at each step, a uniformly chosen neighboring pair moves to the midpoint along the shortest arc. Although the update rule is locally contractive, we show that…

Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and computation of equilibria, under various notions of…

We consider a swarm of mobile robots evolving in a bidimensional Euclidean space. We study a variant of the crash-tolerant gathering problem: if no robot crashes, robots have to meet at the same arbitrary location, not known beforehand, in…

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network…

We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…

We investigate the collective dynamics of self-propelled droplets, confined in a one dimensional micro-fluidic channel. On one hand, neighboring droplets align and form large trains of droplets moving in the same direction. On the other…

In this paper, we study the emergence of circular formation for agents in cyclic pursuit. Each agent is a unicycle traveling at a fixed common forward speed. We first establish a necessary and sufficient condition for the existence of…

Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions…

We analyze systems of clusters and interacting upon colliding---a collision between two clusters may lead to merging or fragmentation---and we also investigate the influence of additional spontaneous fragmentation events. We consider both…

This report surveys results on distributed systems comprising mobile agents that are identical and anonymous, oblivious and interact solely by adjusting their motion according to the relative location of their neighbours. The agents are…

This paper introduces a new lifting method for analyzing convergence of continuous-time distributed synchronization/consensus systems on the unit sphere. Points on the d-dimensional unit sphere are lifted to the (d+1)-dimensional Euclidean…