COME TOGETHER: Multi-Agent Geometric Consensus (Gathering, Rendezvous, Clustering, Aggregation)

02/04/2019
by   Ariel Barel, et al.
0

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 assumed capable of sensing the presence of other agents within a given sensing range and able to implement rules of motion based on full or partial information on the geometric constellation of their neighbouring agents. Eight different problems that cover assumptions of finite vs infinite sensing range, direction and distance vs direction only sensing and discrete vs continuous motion, are analyzed in the context of geometric consensus, clustering or gathering tasks.

READ FULL TEXT
research
10/11/2022

Multi-Agent Distributed and Decentralized Geometric Task Allocation

We consider the general problem of geometric task allocation, wherein a ...
research
02/01/2019

Probabilistic Gathering Of Agents With Simple Sensors

We present a novel probabilistic gathering algorithms for agents that ca...
research
07/26/2021

Distributed Neighbor Selection in Multi-agent Networks

Achieving consensus via nearest neighbor rules is an important prerequis...
research
04/01/2021

Delay-Tolerant Consensus-based Distributed Estimation: Full-Rank Systems with Potentially Unstable Dynamics

Classical distributed estimation scenarios typically assume timely and r...
research
12/09/2020

A Discrete Model of Collective Marching on Rings

We study the collective motion of autonomous mobile agents on a ringlike...
research
05/13/2002

From Alife Agents to a Kingdom of N Queens

This paper presents a new approach to solving N-queen problems, which in...

Please sign up or login with your details

Forgot password? Click here to reset