1 citations · 2 across the 10 of their papers we have counts for
14 papers
Min-Max Uniform Circle Formation by Asynchronous Mobile Robots
Animesh Maiti, Prakhar Shukla, Subhash Bhagat
Given a set of point robots in the Euclidean plane and a target circle enclosing all robot positions, the \textsc{Min-Max Uniform Circle Formation (MMUCF)…
When Robots Crash: Optimal Asynchronous Gathering at Weber Meeting Nodes
Animesh Maiti, Prakhar Shukla, Abhinav Chakraborty +1
We study the \textit{optimal gathering} problem over a finite set of designated \textit{meeting nodes} for \textit{asynchronous, anonymous,} and \textit{oblivious} mobile robots on…
Budget-Constrained Fault-Tolerant Mutual Visibility for Autonomous Robots under the Mobility Fault Model
Prakhar Shukla, Animesh Maiti, Shivam Kumar +1
We investigate the mutual visibility problem for a swarm of autonomous mobile robots under the budget-constrained mobility fault model. The robots are opaque, so if three r…
Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots
Animesh Maiti, Prakhar Shukla, Subhash Bhagat
Two groups of autonomous, anonymous, and oblivious mobile robots are deployed in the two-dimensional Euclidean plane, each assigned a distinct task. We study a setting where the tw…
The Surplus Parking Gathering Problem in Infinite Grids
Animesh Maiti, Abhinav Chakraborty, Subhash Bhagat
In this paper, we introduce the \emph{Surplus Parking Gathering Problem} (), a new coordination problem for robots deployed on an infinite grid. The input consists o…
Gathering Autonomous Mobile Robots Under the Adversarial Defected View Model
Prakhar Shukla, Seshunadh Tanuj Peddinti, Subhash Bhagat
This paper studies the gathering problem for a set of autonomous mobile robots operating in the Euclidean plane under the distributed Look-Compute-Move model. We consider…
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…
Exploring Wedges of an Oriented Grid by an Automaton with Pebbles
Subhash Bhagat, Andrzej Pelc
A mobile agent, modeled as a deterministic finite automaton, navigates in the infinite anonymous oriented grid . It has to explore a given infinite su…
Deterministic Rendezvous in Infinite Trees
Subhash Bhagat, Andrzej Pelc
The rendezvous task calls for two mobile agents, starting from different nodes of a network modeled as a graph to meet at the same node. Agents have different labels which are inte…
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…
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…
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…
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…
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…