Related papers: Gathering by Repulsion
We discuss the problem of two particles interacting via short-range interactions within a harmonic-oscillator trap. The interactions are organized according to their number of derivatives and defined in truncated model spaces made from a…
Microscopic swimming particles, which dissipate energy to execute persistent directed motion, are a classic example of a non-equilibrium system. We investigate the non-interacting Ornstein--Uhlenbeck Particle (OUP), which is propelled…
In order to simulate rigidly rotating polytropes we have simulated systems of $N$ point particles, with $N$ up to 1800. Two particles at a distance $r$ interact by an attractive potential $-1/r$ and a repulsive potential $1/r^2$. The…
Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed independently by each robot so that all robots meet at a single…
Spontaneous segregation of run-and-tumble particles with different velocities in microchannels is investigated by numerical simulations. Self-propelled particles are known to accumulate in the proximity of walls. Here we show how fast…
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has…
We investigate the aggregation kinetics of sedimenting particles theoretically and numerically, using the advection-diffusion equation. Agglomeration, caused by both transport mechanisms (diffusion and advection), is important for small…
When facing many options, we narrow down our focus to very few of them. Although behaviors like this can be a sign of heuristics, they can actually be optimal under limited cognitive resources. Here we study the problem of how to optimally…
Particles kicked by external forces to produce mobility distinct from thermal diffusion are an iconic feature of the active matter problem. Here, we map this onto a minimal model for experiment and theory covering the wide time and length…
In this book chapter, we review how systems of simple motile agents can be used as a pathway to intelligent systems. It is a well known result from nature that large groups of entities following simple rules, such as swarms of animals, can…
The problem of stochastic advection of passive particles by circulating conserved flows on networks is formulated and investigated. The particles undergo transitions between the nodes with the transition rates determined by the flows…
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as {\em gathering}. We study deterministic gathering algorithms…
Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to…
We use computer simulations to study the onset of collective motion in systems of interacting active particles. Our model is a swarm of active Brownian particles with internal energy depot and interactions inspired by the dissipative…
We improve upon the running time for finding a point in a convex set given a separation oracle. In particular, given a separation oracle for a convex set $K\subset \mathbb{R}^n$ contained in a box of radius $R$, we show how to either find a…
Observational data require a rich variety of mechanisms to accelerate fast particles in astrophysical environments operating under different conditions. The mechanisms discussed in the literature include varying magnetic fields in compact…
A trapping mechanism for propelled colloidal particles based on an inhomogeneous drive is presented and studied by means of computer simulations. In experiments this method can be realized using photophoretic Janus particles driven by a…
We investigate the problem of finding the visible pieces of a scene of objects from a specified viewpoint. In particular, we are interested in the design of an efficient hidden surface removal algorithm for a scene comprised of iso-oriented…
The out-of-equilibrium character of active particles, responsible for accumulation at boundaries in confining domains, determines not-trivial effects when considering escape processes. Non-monotonous behavior of exit times with respect to…
In this paper we theoretically investigate underlying assumptions that have been used for designing adaptive particle swarm optimization algorithms in the past years. We relate these assumptions to the movement patterns of particles…