Rendezvous of Two Robots with Constant Memory
From MaRDI portal
Publication:2868644
DOI10.1007/978-3-319-03578-9_16zbMath1406.68110OpenAlexW1590076887MaRDI QIDQ2868644
Masafumi Yamashita, Nicola Santoro, Paola Flocchini, Giovanni Viglietta
Publication date: 17 December 2013
Published in: Structural Information and Communication Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_16
Related Items (10)
\(k\)-circle formation by disoriented asynchronous robots ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Autonomous mobile robots with lights ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Optimum Gathering of Asynchronous Robots ⋮ Mutual visibility by luminous robots without collisions ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots
Cites Work
- Self-stabilizing gathering with strong multiplicity detection
- Gathering of asynchronous robots with limited visibility
- Impossibility of gathering by a set of autonomous mobile robots
- The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
- 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 of Two Robots with Constant Memory
