#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2004

2017

- This year (5)
- Last 5 years (18)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

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 p at time t; entity p can see entity q at time t if at that time no other entity lies on the line segment p(t)q(t). We consider the basic problem called Mutual Visibility:… (More)

- Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau
- ArXiv
- 2017

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 independently by each robot so that all robots meet at a single node after finite time. The robots operate in Look-Compute-Move cycles. In each cycle, a robot takes a snapshot of the… (More)

- Durjoy Dutta, Tandrima Dey, Sruti Gan Chaudhuri
- ICDCIT
- 2017

- Moumita Mondal, Sruti Gan Chaudhuri
- ArXiv
- 2017

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 semi-synchronous manner where a set of robots execute the cycle simultaneously. They do not communicate by any explicit message passing. However, they can sense or observes the… (More)

- Arijit Sil, Sruti Gan Chaudhuri
- ArXiv
- 2017

This paper proposes a distributed algorithm for a set of tiny unit disc shaped robot to form a straight line. The robots are homogeneous, autonomous, anonymous. They observe their surrounding up to a certain distance, compute destinations to move to and move there. They do not have any explicit message sending or receiving capability. They forget their past… (More)

- Kaustav Bose, Ranendu Adhikary, Sruti Gan Chaudhuri, Buddhadeb Sau
- ArXiv
- 2016

In this paper, we consider the problem of computing the algebraic parametric equation of the Euclidean 1-center function in R, d ≥ 2, for a system of n static points and m mobile points having motion defined by rational parametric functions. We have shown that the corresponding Euclidean 1-center function is a piecewise differentiable function and have… (More)

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., the robots are see through. In this paper, we consider a slightly more realistic model, by incorporating the notion of obstructed visibility (i.e., robots are not see through) for… (More)

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 robots act independently. They can observe others, compute some locations and walk towards those locations. They can only get a snapshot of the locations of other robots but can… (More)

A swarm of robots is a collection of tiny identical autonomous robots. The robots perform a given task, e.g., cleaning a big surface, moving a big object, guarding an area etc., in a collaborative framework. The goal of research in swarm robotics is to develop a low cost multi-robot system which will be at least as efficient as one big expensive unit. The… (More)