14 citations · 35 across the 25 of their papers we have counts for
29 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…
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…
Arbitrary Pattern Formation on a Continuous Circle by Oblivious Robot Swarm
Brati Mondal, Pritam Goswami, Avisek Sharma +1
In the field of distributed system, Arbitrary Pattern Formation (APF) problem is an extensively studied problem. The purpose of APF is to design an algorithm to move a swarm of rob…
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…
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…
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…
Exploring a Dynamic Ring without Landmark
Archak Das, Kaustav Bose, Buddhadeb Sau
Consider a group of autonomous mobile computational entities, called agents, arbitrarily placed at some nodes of a dynamic but always connected ring. The agents neither have any kn…
Power of Finite Memory and Finite Communication Robots under Asynchronous Scheduler
Archak Das, Avisek Sharma, Buddhadeb Sau
In swarm robotics, a set of robots has to perform a given task with specified internal capabilities (model) and under a given adversarial scheduler. Relation between a model …
Pattern Formation by Robots with Inaccurate Movements
Kaustav Bose, Archak Das, Buddhadeb Sau
\textsc{Arbitrary Pattern Formation} is a fundamental problem in autonomous mobile robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous…
Distributed Localization of Wireless Sensor Network Using Communication Wheel
Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1
We study the network localization problem, i.e., the problem of determining node positions of a wireless sensor network modeled as a unit disk graph. In an arbitrarily deployed net…
Memory Optimal Dispersion by Anonymous Mobile Robots
Archak Das, Kaustav Bose, Buddhadeb Sau
Consider a team of autonomous mobile robots initially placed at a node of an arbitrary graph with nodes. The dispersion problem asks for a distributed algorithm…
Arbitrary Pattern Formation by Opaque Fat Robots with Lights
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Arbitrary Pattern Formation is a widely studied problem in autonomous robot systems. The problem asks to design a distributed algorithm that moves a team of autonomous, anonymous a…
Positional Encoding by Robots with Non-Rigid Movements
Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1
Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tas…