5 citations · 6 across the 9 of their papers we have counts for
4 papers · 1 filter
Local Interactions for Cohesive Flexible Swarms
Rotem Manor, Ariel Barel, Alfred M. Bruckstein
Distributed gathering algorithms aim to achieve complete visibility graphs via a "never lose a neighbour" policy. We suggest a method to maintain connected graph topologies, while…
COME TOGETHER: Multi-Agent Geometric Consensus (Gathering, Rendezvous, Clustering, Aggregation)
Ariel Barel, Rotem Manor, Alfred M. Bruckstein
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 t…
On Steering Swarms
Ariel Barel, Rotem Manor, Alfred M. Bruckstein
The main contribution of this paper is a novel method allowing an external observer/controller to steer and guide swarms of identical and indistinguishable agents, in spite of the…
Probabilistic Gathering Of Agents With Simple Sensors
Ariel Barel, Thomas Dagès, Rotem Manor +1
Gathering is a fundamental task for multi-agent systems and the problem has been studied under various assumptions on the sensing capabilities of mobile agents. This paper addresse…