Related papers: Gathering by Repulsion
Power system optimization models are large mathematical models used by researchers and policymakers that pose tractability issues when representing real-world systems. Several aggregation techniques have been proposed to address these…
Flocking, as paradigmatically exemplified by birds, is the coherent collective motion of active agents. As originally conceived, flocking emerges through alignment interactions between the agents. Here, we report that flocking can also…
We present an experimental realization of the collective trapping phase transition [Kaiser et al., PRL 108, 268307 (2012)], using motile polar granular rods in the presence of a V-shaped obstacle. We offer a theory of this transition based…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
We investigate a diffusive motion of a system of interacting Brownian particles in quasi-one-dimensional micropores. In particular, we consider a semi-infinite 1D geometry with a partially absorbing boundary and the hard-core inter-particle…
Patrolling consists of scheduling perpetual movements of a collection of mobile robots, so that each point of the environment is regularly revisited by any robot in the collection. In previous research, it was assumed that all points of the…
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…
Online convex optimization is a sequential prediction framework with the goal to track and adapt to the environment through evaluating proper convex loss functions. We study efficient particle filtering methods from the perspective of such…
A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a non-monotonic behavior as a function of the…
The Ornstein--Uhlenbeck Particle (OUP) model imagines a microscopic swimmer propelled by an active force which is correlated with itself on a finite time-scale. Here we investigate the influence of external potentials on an ideal suspension…
We study the transport properties of a system of active particles moving at constant speed in an heterogeneous two-dimensional space. The spatial heterogeneity is modeled by a random distribution of obstacles, which the active particles…
We present a novel method for estimating the circulations and positions of point vortices using trajectory data of passive particles in the presence of Gaussian noise. The method comprises two algorithms: the first one calculates the vortex…
Collective guidance of out-of-equilibrium systems without using external fields is a challenge of paramount importance in active matter, ranging from bacterial colonies to swarms of self-propelled particles. Designing strategies to guide…
We study the problem of computing a convex region with bounded area and diameter that contains the maximum number of points from a given point set $P$. We show that this problem can be solved in $O(n^6k)$ time and $O(n^3k)$ space, where $n$…
We present placing via picking (PvP), a method to autonomously collect real-world demonstrations for a family of placing tasks in which objects must be manipulated to specific, contact-constrained locations. With PvP, we approach the…
We study a general family of facility location problems defined on planar graphs and on the 2-dimensional plane. In these problems, a subset of $k$ objects has to be selected, satisfying certain packing (disjointness) and covering…
We study a particle model for a simple system of partial differential equations describing, in dimension $d\geq 2$, a two component mixture where light particles move in a medium of absorbing, fixed obstacles; the system consists in a…
We propose a zero-order optimization method for sequential min-max problems based on two populations of interacting particles. The systems are coupled so that one population aims to solve the inner maximization problem, while the other aims…
This paper discusses a numerical method for computing the evolution of large interacting system of quantum particles. The idea of the random batch method is to replace the total interaction of each particle with the $N-1$ other particles by…
We consider a time-continuous branching random walk on a one-dimensional lattice on which there is one center (lattice point) of particle generation, called branching source. The generation of particles in the branching source is described…