5 citations · 12 across the 8 of their papers we have counts for
12 papers · 1 filter
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…
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…