14 citations · 35 across the 25 of their papers we have counts for
31 papers
Gathering of asynchronous robots on circle with limited visibility using finite communication
Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau
This work addresses the gathering problem for a set of autonomous, anonymous, and homogeneous robots with limited visibility operating in a continuous circle. The robots are initia…
Simulating Chirality: Solving Distance--Dispersion on an 1-Interval Connected Ring
Brati Mondal, Pritam Goswami, Buddhadeb Sau
We study the Distance--Dispersion (D--D) problem for synchronous mobile agents in a 1-interval-connected ring network having nodes and with agents where $3 \le l \le…
Time Optimal Distance--Dispersion on Dynamic Ring
Brati Mondal, Pritam Goswami, Buddhadeb Sau
Dispersion by mobile agents is a well studied problem in the literature on computing by mobile robots. In this problem, robots placed arbitrarily on nodes of a network having $…
Computational Power of Mobile Robots in Synchronous Environment: Discrete Version
Avisek Sharma, Pritam Goswami, Buddhadeb Sau
In distributed computing by mobile robots, robots are deployed over a region, continuous or discrete, operating through a sequence of \textit{look-compute-move} cycles. An extensiv…
Space and Move-optimal Arbitrary Pattern Formation on Infinite Rectangular Grid by Oblivious Robot Swarm
Avisek Sharma, Satakshi Ghosh, Pritam Goswami +1
Arbitrary Pattern Formation (APF) is a fundamental coordination problem in swarm robotics. It requires a set of autonomous robots (mobile computing units) to form an arbitrary patt…
Circle Formation by Asynchronous Opaque Fat Robots on an Infinite Grid
Pritam Goswami, Manash Kumar Kundu, Satakshi Ghosh +1
This study addresses the problem of "Circle Formation on an Infinite Grid by Fat Robots" (). Unlike prior work focused solely on point robots in discrete domain, it…