3 papers
cs.DC2026
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…
cs.DC2026
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…
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…