The Mutual Visibility Problem for Fat Robots with Lights

Authors

  • Rusul J. Alsaedi University of Sydney
  • Joachim Gudmundsson University of Sydney
  • André van Renssen University of Sydney

DOI:

https://doi.org/10.57717/cgt.v5i1.81

Abstract

Given a set of n≥1 unit disk robots in the Euclidean plane, we consider the fundamental problem of providing mutual visibility to them: the robots must reposition themselves to reach a configuration where they all see each other. This problem arises under obstructed visibility, where a robot cannot see another robot if there is a third robot on the straight line segment between them. This problem was solved by Sharma et al. [ICDCN, 2018] in the luminous robots model, where each robot is equipped with an externally visible light that can assume colors from a fixed set of colors, using 9 colors and O(n) rounds. In this work, we present an algorithm that requires only 2 colors and O(n) rounds. The number of colors is optimal since at least two colors are required even for pointrobots [Di Luna et al., Information and Computation, 2017].

Downloads

Published

2026-02-19

How to Cite

Alsaedi, R. J., Gudmundsson, J., & van Renssen, A. (2026). The Mutual Visibility Problem for Fat Robots with Lights. Computing in Geometry and Topology, 5(1), 2:1–2:17. https://doi.org/10.57717/cgt.v5i1.81

Issue

Section

Original Research Articles

Categories