14 citations · 22 across the 12 of their papers we have counts for
13 papers · 1 filter
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…
Min-Max Gathering on Infinite Grid
Abhinav Chakraborty, Pritam Goswami, Satakshi Ghosh
Gathering is a fundamental coordination problem in swarm robotics, where the objective is to bring robots together at a point not known to them at the beginning. While most researc…
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…
The Computational Landscape of Autonomous Mobile Robots: The Visibility Perspective
Archak Das, Satakshi Ghosh, Avisek Sharma +2
Consider a group of autonomous mobile computational entities called robots. The robots move in the Euclidean plane and operate according to synchronous -- cycl…
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…
Rendezvous on a Known Dynamic Point on a Finite Unoriented Grid
Pritam Goswami, Avisek Sharma, Satakshi Ghosh +1
In this paper, we have considered two fully synchronous robots having no agreement on coordinates entering a finite unoriented grid through a door vertex at a cor…
Space and Move-optimal Arbitrary Pattern Formation on a Rectangular Grid by Robot Swarms
Avisek Sharma, Satakshi Ghosh, Pritam Goswami +1
Arbitrary pattern formation (\textsc{Apf}) is a well-studied problem in swarm robotics. To the best of our knowledge, the problem has been considered in two different settings: one…
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…
Arbitrary pattern formation by opaque fat robots on infinite grid
Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh +1
Arbitrary Pattern formation () by a swarm of mobile robots is a widely studied problem in the literature. Many works regarding have been proposed on…
Move and Time Optimal Arbitrary Pattern Formation by Asynchronous Robots on Infinite Grid
Satakshi Ghosh, Pritam Goswami, Avisek Sharma +1
The \textsc{Arbitrary Pattern Formation} (\textsc{Apf}) is a widely studied in distributed computing for swarm robots. This problem asks to design a distributed algorithm that allo…
Arbitrary pattern formation by asynchronous opaque robots on infinite grid
Manash Kumar Kundu, Pritam Goswami, Satakshi Ghosh +1
Arbitrary pattern formation () by mobile robots is studied by many in literature under different conditions and environment. Recently it has been studied on an infin…
Time Optimal Gathering of Myopic Robots on an Infinite Triangular Grid
Pritam Goswami, Avisek Sharma, Satakshi Ghosh +1
This work deals with the problem of gathering oblivious mobile entities, called robots, at a point (not known beforehand) placed on an infinite triangular grid. The robots are…