{"ID":2850385,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2510.22434","arxiv_id":"2510.22434","title":"Separation of Unconscious Robots with Obstructed Visibility","abstract":"We study a recently introduced \\textit{unconscious} mobile robot model, where each robot is associated with a \\textit{color}, which is visible to other robots but not to itself. The robots are autonomous, anonymous, oblivious and silent, operating in the Euclidean plane under the conventional \\textit{Look-Compute-Move} cycle. A primary task in this model is the \\textit{separation problem}, where unconscious robots sharing the same color must separate from others, forming recognizable geometric shapes such as circles, points, or lines. All prior works model the robots as \\textit{transparent}, enabling each to know the positions and colors of all other robots. In contrast, we model the robots as \\textit{opaque}, where a robot can obstruct the visibility of two other robots, if it lies on the line segment between them. Under this obstructed visibility, we consider a variant of the separation problem in which robots, starting from any arbitrary initial configuration, are required to separate into concentric semicircles. We present a collision-free algorithm that solves the separation problem under a semi-synchronous scheduler in $O(n)$ epochs, where $n$ is the number of robots. The robots agree on one coordinate axis but have no knowledge of $n$.","short_abstract":"We study a recently introduced \\textit{unconscious} mobile robot model, where each robot is associated with a \\textit{color}, which is visible to other robots but not to itself. The robots are autonomous, anonymous, oblivious and silent, operating in the Euclidean plane under the conventional \\textit{Look-Compute-Move}...","url_abs":"https://arxiv.org/abs/2510.22434","url_pdf":"https://arxiv.org/pdf/2510.22434v1","authors":"[\"Prajyot Pyati\",\"Navjot Kaur\",\"Saswata Jana\",\"Adri Bhattacharya\",\"Partha Sarathi Mandal\"]","published":"2025-10-25T21:03:27Z","proceeding":"cs.DC","tasks":"[\"cs.DC\",\"cs.RO\"]","methods":"[]","has_code":false}
