collaborators

6 papers

cs.DC2026

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

cs.DC2026

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…

cs.DC2026

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…

cs.DC2026

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…

cs.DC2026

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…

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…