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