Rendezvous of Two Robots with Visible Bits

We study the rendezvous problem for two robots moving in the plane (or on a line). Robots are autonomous, anonymous, oblivious, and carry colored lights that are visible to both. We consider deterministic distributed algorithms in which robots do not use distance information, but try to reduce (or increase) their distance by a constant factor, depending on their lights’ colors.

• Publication year

  2012

• Venue

  Algorithmic Aspects of Wireless Sensor Networks

• Publication date

  2012-11-26

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-45346-5_21arXiv 1211.6039
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Distributed Computing by Mobile Robots: Gathering

  2012cited by this paper
• The Power of Lights: Synchronizing Asynchronous Robots Using Visible Bits

  2012cited by this paper
• Distributed Computing by Oblivious Mobile Robots

  2012cited by this paper
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses

  2011cited by this paper
• Rendezvous without coordinates

  2008cited by this paper
• Impossibility of gathering by a set of autonomous mobile robots

  2007cited by this paper
• Multirobot Rendezvous With Visibility Sensors in Nonconvex Environments

  2006cited by this paper
• Gathering of asynchronous robots with limited visibility

  2005cited by this paper
• Gathering Non-oblivious Mobile Robots

  2004cited by this paper
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns

  1999cited by this paper
• Distributed algorithms for mobile hosts

  1997cited by this paper

• Deterministic Color-Optimal Self-stabilizing Semi-synchronous Gathering: A Certified Algorithm

  2025influential citation
• Gathering Semi-Synchronously Scheduled Two-State Robots

  2024cites this paper
• On Asynchrony, Memory, and Communication: Separations and Landscapes

  2023cites this paper
• The Agreement Power of Disagreement

  2023cites this paper
• Swarms of Mobile Robots: Towards Versatility with Safety

  2022cites this paper
• On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis

  2022cites this paper
• Unreliable Sensors for Reliable Efficient Robots

  2021influential citation
• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights

  2021cites this paper
• Stand Up Indulgent Rendezvous

  2020cites this paper
• Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots

  2020cites this paper
• On Memory, Communication, and Synchronous Schedulers When Moving and Computing

  2020cites this paper
• Autonomous Distributed Systems of Myopic Mobile Robots with Lights

  2020cites this paper
• An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids

  2020cites this paper
• Stabilization, Safety, and Security of Distributed Systems: 22nd International Symposium, SSS 2020, Austin, TX, USA, November 18–21, 2020, Proceedings

  2020cites this paper
• Brief Announcement: Model Checking Rendezvous Algorithms for Robots with Lights in Euclidean Space

  2019cites this paper
• Asynchronous Rendezvous with Different Maps

  2019cites this paper
• Robots with Lights

  2019cites this paper
• Fault-Tolerant Mobile Robots

  2019cites this paper
• Gathering on Rings for Myopic Asynchronous Robots with Lights

  2019cites this paper
• Using Model Checking to Formally Verify Rendezvous Algorithms for Robots with Lights in Euclidean Space

  2019influential citation
• Rendezvous of Asynchronous Mobile Robots with Lights

  2018cites this paper
• Gathering Problems for Autonomous Mobile Robots with Lights

  2018cites this paper
• The topology of look-compute-move robot wait-free algorithms with hard termination

  2018cites this paper
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms

  2018cites this paper
• Optimal Rendezvous L-Algorithms for Asynchronous Mobile Robots with External-Lights

  2018influential citation
• Algorithms and Discrete Applied Mathematics - Third International Conference, CALDAM 2017, Sancoale, Goa, India, February 16-18, 2017, Proceedings

  2017cites this paper
• Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights

  2017cites this paper
• Optimum Gathering of Asynchronous Robots

  2017cites this paper
• Optimal Asynchronous Rendezvous for Mobile Robots with Lights

  2017cites this paper
• Optimally Gathering Two Robots

  2017influential citation
• Fault-Tolerant Robot Gathering Problems on Graphs With Arbitrary Appearing Times

  2017cites this paper
• Visibility by Robots with Persistent Memory

  2017cites this paper
• Mutual Visibility by Robots with Persistent Memory

  2017cites this paper
• Autonomous mobile robots with lights

  2016cites this paper
• Rendezvous with constant memory

  2016cites this paper
• A Study of Mobile Robot Algorithms with Sycamore

  2016cites this paper
• Pattern Formation by Oblivious Asynchronous Mobile Robots

  2015cites this paper
• Mutual visibility by luminous robots without collisions

  2015cites this paper
• Bounds on Mutual Visibility Algorithms

  2015cites this paper
• Computations by Luminous Robots

  2015cites this paper
• Mutual Visibility with an Optimal Number of Colors

  2015cites this paper
• Logarithmic-Time Complete Visibility for Robots with Lights

  2015cites this paper
• Robots Rendezvous with Constant Memory ∗

  2014influential citation
• Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement

  2014cites this paper
• Robots with Lights: Overcoming Obstructed Visibility Without Colliding

  2014cites this paper
• Rendezvous of Two Robots with Constant Memory

  2013cites this paper