activity
20162024
collaborators
Showing cs.DCShow all

5 papers · 1 filter

cs.DC2024

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 $…

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…

cs.DC2023

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…

cs.DC2023

Asynchronous Gathering of Robots with Finite Memory on a Circle under Limited Visibility

Satakshi Ghosh, Avisek Sharma, Pritam Goswami +1

Consider a set of mobile entities, called robots, located and operating on a continuous circle, i.e., all robots are initially in distinct locations on a circle. The \textit{ga…

cs.DC2022

Maximum Independent Set Formation on a Finite Grid by Myopic Robots

Raja Das, Avisek Sharma, Buddhadeb Sau

This work deals with the Maximum Independent Set () formation problem in a finite rectangular grid by autonomous robots. Suppose we are given a set of identical robo…