1 citations · 1 across the 11 of their papers we have counts for
12 papers
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…
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…
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…
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-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…
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…
Parking Problem by Oblivious Mobile Robots in Infinite Grids
Abhinav Chakraborty, Krishnendu Mukhopadhyaya
In this paper, the parking problem of a swarm of mobile robots has been studied. The robots are deployed at the nodes of an infinite grid, which has a subset of prefixed nodes mark…
Reconciling model-X and doubly robust approaches to conditional independence testing
Ziang Niu, Abhinav Chakraborty, Oliver Dukes +1
Model-X approaches to testing conditional independence between a predictor and an outcome variable given a vector of covariates usually assume exact knowledge of the conditional di…
Mutual Visibility by Fat Robots with Slim Omnidirectional Camera
Kaustav Bose, Abhinav Chakraborty, Krishnendu Mukhopadhyaya
In the existing literature of the Mutual Visibility problem for autonomous robot swarms, the adopted visibility models have some idealistic assumptions that are not consistent with…
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…
High dimensional PCA: a new model selection criterion
Abhinav Chakraborty, Soumendu Sundar Mukherjee, Arijit Chakrabarti
Given a random sample from a multivariate population, estimating the number of large eigenvalues of the population covariance matrix is an important problem in Statistics with wide…