activity
20122020
most citedRobots with Lights: Overcoming Obstructed Visibility Without Colliding

25 citations · 44 across the 12 of their papers we have counts for

collaborators

13 papers

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

Uniform Scattering of Robots on Alternate Nodes of a Grid

Moumita Mondal, Sruti Gan Chaudhuri, Punyasha Chatterjee

In this paper, we propose a distributed algorithm to uniformly scatter the robots along a grid, with robots on alternate nodes of this grid distribution. These homogeneous, autonom…

cs.DC2017

Uniform Circle Formation by Transparent Fat Robots

Moumita Mondal, Sruti Gan Chaudhuri

This paper addresses the problem of Uniform Circle Formation by n > 1 transparent disc robots (fat robots). The robots execute repetitive cycles of the states look-compute-move in…

cs.DC2017

Line Formation by Fat Robots under Limited Visibility

Arijit Sil, Sruti Gan Chaudhuri

This paper proposes a distributed algorithm for a set of tiny unit disc shaped robot to form a straight line. The robots are homoge- neous, autonomous, anonymous. They observe thei…

cs.DC2017★ 5 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…

cs.CG2016

Euclidean 1-center of a set of static and mobile points

Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri +1

In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in , , for a system of static p…

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★ 3 cited

Mutual Visibility by Luminous Robots Without Collisions

G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +3

Consider a finite set of identical computational entities that can move freely in the Euclidean plane operating in Look-Compute-Move cycles. Let p(t) denote the location of entity…

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★ 25 cited

Robots with Lights: Overcoming Obstructed Visibility Without Colliding

G. A. Di Luna, P. Flocchini, S. Gan Chaudhuri +2

Robots with lights is a model of autonomous mobile computational entities operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can a…

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

cs.NI2012★ 3 cited

Design and implementation of a differentiated service based qos model for real-time interactive traffic on constrained bandwidth ip networks

Sruti Gan Chaudhuri

In this thesis work, a QoS model for real-time interactive traffic on a real network with constrained bandwidth and real-time traffic has been proposed. The model supports tight gu…