3 papers
cs.DC2025
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…
cs.DC2024
Oblivious Robots Performing Different Tasks on Grid Without Knowing their Team Members
Satakshi Ghosh, Avisek Sharma, Pritam Goswami +1
Two fundamental problems of distributed computing are Gathering and Arbitrary pattern formation (\textsc{Apf}). These two tasks are different in nature as in gathering robots meet…
cs.DC2024
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…