Rusul J. Alsaedi

collaborators

4 papers

cs.CG2026

The Mutual Visibility Problem for Fat Robots with Lights

Rusul J. Alsaedi, Joachim Gudmundsson, AndrÃ© van Renssen

Given a set of $n \geq 1$ unit disk robots in the Euclidean plane, we consider the fundamental problem of providing mutual visibility to them: the robots must reposition themselves…

cs.CG2025

Shortest Paths of Mutually Visible Robots

Rusul J. Alsaedi, Joachim Gudmundsson, AndrÃ© van Renssen

Given a set of $n$ point robots inside a simple polygon $P$ , the task is to move the robots from their starting positions to their target positions along their shortest paths, whil…

cs.CG2025

Pattern Formation for Fat Robots with Memory

Given a set of $n \geq 1$ autonomous, anonymous, indistinguishable, silent, and possibly disoriented mobile unit disk (i.e., fat) robots operating following Look-Compute-Move cycles…

cs.CG2025

Pattern Formation for Fat Robots with Lights

Given a set of $n \geq 1$ unit disk robots in the Euclidean plane, we consider the Pattern Formation problem, i.e., the robots must reposition themselves to form a given target patt…