Related papers: Gathering by Repulsion
Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…
Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
We study the collective dynamics of repulsive self-propelled particles. The particles are governed by coupled equations of motion that include polar self-propulsion, damping of velocity and of polarity, repulsive particle-particle…
In this paper we study the problem of finding hotspots, i.e. regions in which a moving entity has spent a significant amount of time, for polygonal trajectories. The fastest optimal algorithm, due to Gudmundsson, van Kreveld, and Staals…
Biological and robotic systems often operate in confined environments where material must be gathered without centralized control. Inspired by the effective collection strategies of aquatic worms (Lumbriculus variegatus and Tubifex…
In this letter, we investigate the problem of actuator scheduling for networked control systems. Given a stochastic linear system with a number of actuators, we consider the case that one actuator is activated at each time. This problem is…
Active particles, which are self-propelled nonequilibrium systems, are modelled by overdamped Langevin equations with colored noise, emulating the self-propulsion. In this chapter, we present a review of the theoretical results for the…
We theoretically address minimal search strategies of active, self-propelled particles towards hidden targets in three-dimensional space. The particles can sense if a target is close, e.g., by detecting signaling molecules released by a…
We consider a new model of a branching random walk on a multidimensional lattice with continuous time and one source of particle reproduction and death, as well as an infinite number of sources in which, in addition to the walk, only…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
The problem of light waves interaction with charged particles becomes more and more complex starting with the case of plane waves, where the analytical solution is well known, to more natural, though more complicated situations which…
The motion of each particle in an N body system of identical masses interacting via an attractive or repulsive pairwise linear force law, the "Swarm," and with an external attractive or repulsive linear force law, the "Trap," is considered.…
Repulsive self-propelled particles tend to cluster, leading to Motility-Induced Phase Separation (MIPS). By analogy with equilibrium phase separation, the onset of MIPS has been associated with a transition to effective attraction between…
Research on crowd simulation has important and wide range of applications. The main difficulty is how to lead all particles with a same and simple rule, especially when particles are numerous. In this paper, we firstly propose a two…
We introduce the problem of minimal actuator placement in a linear control system so that a bound on the minimum control effort for a given state transfer is satisfied while controllability is ensured. We first show that this is an NP-hard…
A team of anonymous mobile agents represented by points freely moving in the plane have to gather at a single point and stop. Agents start at different points of the plane and at possibly different times chosen by the adversary. They are…
In this paper we address the complexity issues of two agreement problems in oblivious robot networks namely gathering and scattering. These abstractions are fundamental coordination problems in cooperative mobile robotics. Moreover, their…
We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint…
We present an algorithm determining where to relocate objects inside a cluttered and confined space while rearranging objects to retrieve a target object. Although methods that decide what to remove have been proposed, planning for the…