1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2025★ 1 cited
Asynchronous Indulgent Gathering of Opaque Robots
Subhajit Pramanick, Saswata Jana, Partha Sarathi Mandal +1
We consider the benchmarking problem of gathering in an -fault system consisting of robots, of which at most may fail at any execution. The {\em traditional} version…
cs.DC2024
Optimal Uniform Circle Formation by Asynchronous Luminous Robots
Caterina Feletti, Debasish Pattanayak, Gokarna Sharma
We study the {\sc Uniform Circle Formation} ({\sc UCF}) problem for a swarm of autonomous mobile robots operating in \emph{Look-Compute-Move} (LCM) cycles on the Euclidean plan…