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

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

collaborators
Showing cs.DCShow all

6 papers · 1 filter

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

cs.DC2019

Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights

Kaustav Bose, Manash Kumar Kundu, Ranendu Adhikary +1

The Arbitrary Pattern Formation problem asks for a distributed algorithm that moves a set of autonomous mobile robots to form any arbitrary pattern given as input. The robots are a…

cs.DC2018

Arbitrary Pattern Formation on Infinite Grid by Asynchronous Oblivious Robots

Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu +1

The Arbitrary Pattern Formation problem asks to design a distributed algorithm that allows a set of autonomous mobile robots to form any specific but arbitrary geometric pattern gi…

cs.DC20175 cited

Crash tolerant gathering on grid by asynchronous oblivious robots

Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1

Consider a system of autonomous mobile robots initially randomly deployed on the nodes of an anonymous finite grid. A gathering algorithm is a sequence of moves to be executed inde…