5 papers
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…
Power of masking methods for adaptive testing in a multivariate normal means problem
Abhinav Chakraborty, Junu Lee, Eugene Katsevich
Many large-scale testing procedures learn signal structure from the data to boost power. Direct data reuse can inflate Type-I error ("double dipping"), so a common remedy is maskin…
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…
Doubly robust and computationally efficient high-dimensional variable selection
Abhinav Chakraborty, Jeffrey Zhang, Eugene Katsevich
Variable selection can be performed by testing conditional independence (CI) between each predictor and the response, given the other predictors. A doubly robust and powerful optio…
Min-Max Gathering on Infinite Grid
Abhinav Chakraborty, Pritam Goswami, Satakshi Ghosh
Gathering is a fundamental coordination problem in swarm robotics, where the objective is to bring robots together at a point not known to them at the beginning. While most researc…