Rendezvous with constant memory

DOI10.1016/j.tcs.2016.01.025zbMath1335.68278arXiv1306.1956OpenAlexW2288393983MaRDI QIDQ5964022

Nicola Santoro, Masafumi Yamashita, Giovanni Viglietta, Paola Flocchini

Publication date: 26 February 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

rendezvousautonomous mobile robotsfinite states robotsgatheringobliviousness and memoryrobots with lightssynchrony vs. asynchrony

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (11)

On the robustness of a synchronized multi-robot system ⋮ Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights ⋮ Gathering problems for autonomous mobile robots with lights ⋮ The canonical amoebot model: algorithms and concurrency control ⋮ Rendezvous of Asynchronous Mobile Robots with Lights ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Meeting in a polygon by anonymous oblivious robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Unnamed Item ⋮ Gathering in dynamic rings ⋮ On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis

Cites Work

• Self-stabilizing gathering with strong multiplicity detection
• Gathering of asynchronous robots with limited visibility
• Rendezvous of two robots with visible bits
• Impossibility of gathering by a set of autonomous mobile robots
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• Distributed Computing by Mobile Robots: Gathering
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

This page was built for publication: Rendezvous with constant memory