5 citations · 12 across the 8 of their papers we have counts for
13 papers
Mutual Visibility by Fat Robots with Slim Omnidirectional Camera
Kaustav Bose, Abhinav Chakraborty, Krishnendu Mukhopadhyaya
In the existing literature of the Mutual Visibility problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with…
Maximum Cut on Interval Graphs of Interval Count Two is NP-complete
Alexey Barsukov, Bodhayan Roy
An interval graph has interval count if it has an interval model, where among every intervals there are two that have the same length. Maximum Cut on interval graph…
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…