A distributed algorithm for gathering many fat mobile robots in the plane

DOI10.1145/2484239.2484266zbMath1323.68547arXiv1209.3904OpenAlexW2066466105MaRDI QIDQ5176102

Marios Mavronicolas, Chrysovalandis Agathangelou, Chryssis Georgiou

Publication date: 2 March 2015

Published in: Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.3904

zbMATH Keywords

gatheringasynchronyfat robotsstate-machines

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (25)

TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications ⋮ On fast pattern formation by autonomous robots ⋮ A Continuous Strategy for Collisionless Gathering ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ Leader Election and Shape Formation with Self-organizing Programmable Matter ⋮ The mutual visibility problem for fat robots ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Optimum Gathering of Asynchronous Robots ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ A continuous strategy for collisionless gathering ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Use of information, memory and randomization in asynchronous gathering ⋮ Mutual visibility by luminous robots without collisions ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Unnamed Item ⋮ The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ On the self-stabilization of mobile oblivious robots in uniform rings ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Deterministic rendezvous with different maps ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots

This page was built for publication: A distributed algorithm for gathering many fat mobile robots in the plane