6 papers
Universal Rendezvous of Anonymous Agents with Footprints
Bibhuti Das
Deterministic rendezvous for two anonymous mobile agents starting simultaneously from two distinct nodes of an anonymous connected graph and navigating synchronously in the graph r…
Rendezvous of Mobile Deterministic Automata in Graphs
Bibhuti Das, Andrzej Pelc
Two mobile agents, modeled as identical deterministic finite automata (DFA) navigating in synchronous rounds in a graph with unlabeled nodes, have to meet at some node. The well-re…
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…
Optimal Dispersion of Silent Robots in a Ring
Bibhuti Das, Barun Gorain, Kaushik Mondal +2
Given a set of co-located mobile robots in an unknown anonymous graph, the robots must relocate themselves in distinct graph nodes to solve the dispersion problem. In this paper, w…
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…