activity
20172021
most citedCrash tolerant gathering on grid by asynchronous oblivious robots

5 citations · 8 across the 4 of their papers we have counts for

collaborators
Showing cs.DCShow all

9 papers · 1 filter

cs.DC2021

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…

cs.DC2020

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…

cs.DC2020

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…

cs.DC2020

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…

cs.DC2019

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…

cs.DC20193 cited

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…