activity
20122026
most citedPattern Formation for Asynchronous Robots without Agreement in Chirality

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

collaborators

14 papers

cs.DC2026

Min-Sum Uniform Coverage Problem by Autonomous Mobile Robots

Animesh Maiti, Abhinav Chakraborty, Bibhuti Das +2

We study the \textit{min-sum uniform coverage} problem for a swarm of mobile robots on a given finite line segment and on a circle having finite positive radius, where the circ…

cs.DC2024

Optimal Dispersion of Silent Robots in a Ring

Bibhuti Das, Barun Gorain, Kaushik Mondal +2

Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…

cs.DC2023

Parking Problem by Oblivious Mobile Robots in Infinite Grids

Abhinav Chakraborty, Krishnendu Mukhopadhyaya

In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes mark…

cs.RO2022

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…

cs.DC2022

Optimal Gathering over Weber Meeting Nodes in Infinite Grid

Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das +1

The gathering over meeting nodes problem requires the robots to gather at one of the pre-defined meeting nodes. This paper investigates the problem with respect to the objective fu…

cs.DC2021

Gathering over Meeting Nodes in Infinite Grid

Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das +1

The gathering over meeting nodes problem asks the robots to gather at one of the pre-defined meeting nodes. The robots are deployed on the nodes of an anonymous two-dimensional inf…

cs.RO2020★ 1 cited

Uniform Circle Formation By Oblivious Swarm Robots

Moumita Mondal, Sruti Gan Chaudhuri, Ayan Dutta +2

In this paper, we study the circle formation problem by multiple autonomous and homogeneous disc-shaped robots (also known as fat robots). The goal of the robots is to place themse…

cs.DC2017

Mutual Visibility by Robots with Persistent Memory

Subhash Bhagat, Krishnendu Mukhopadhyaya

This paper addresses the mutual visibility problem for a set of semi-synchronous, opaque robots occupying distinct positions in the Euclidean plane. Since robots are opaque, if thr…

cs.RO2016

A Get-Together for Deaf and Dumb Robots in Three dimensional Space

Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya

This paper proposes a strategy for a group of deaf and dumb robots, carrying clocks from different countries, to meet at a geographical location which is not fixed in advanced. The…

cs.DC2015

MAINT: Localization of Mobile Sensors with Energy Control

B. Sau, S. Mukhopadhyaya, K. Mukhopadhyaya

Localization is an important issue for Wireless Sensor Networks (WSN). A mobile sensor may change its position rapidly and thus require localization calls frequently. A localizatio…

cs.DC2014

Formation of General Position by Asynchronous Mobile Robots

S. Bhagat, S. Gan Chaudhuri, K. Mukhopadhyaya

The traditional distributed model of autonomous, homogeneous, mobile point robots usually assumes that the robots do not create any visual obstruction for the other robots, i.e., t…

cs.DC2014★ 5 cited

Pattern Formation for Asynchronous Robots without Agreement in Chirality

Sruti Gan Chaudhuri, Swapnil Ghike, Shrainik Jain +1

This paper presents a deterministic algorithm for forming a given asymmetric pattern in finite time by a set of autonomous, homogeneous, oblivious mobile robots under the CORDA mod…

cs.DC2013★ 1 cited

Localizability of Wireless Sensor Networks: Beyond Wheel Extension

Buddhadeb Sau, Krishnendu Mukhopadhyaya

A network is called localizable if the positions of all the nodes of the network can be computed uniquely. If a network is localizable and embedded in plane with generic configurat…

cs.DC2012★ 2 cited

Leader Election and Gathering for Asynchronous Transparent Fat Robots without Chirality

Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya

This paper proposes a distributed algorithm which deterministically gathers n (n > 4) asynchronous, fat robots. The robots are assumed to be transparent and they have full visibili…