Showing cs.DCShow all
3 papers · 1 filter
cs.DC2024
Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
Tanvir Kaur, Barun Gorain, Kaushik Mondal
Distance-2-Dispersion (D-2-D) problem aims to disperse mobile agents starting from an arbitrary initial configuration on an anonymous port-labeled graph with nodes such…
cs.DC2023
Pebble guided Treasure Hunt in Plane
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal
We study the problem of treasure hunt in a Euclidean plane by a mobile agent with the guidance of pebbles. The initial position of the agent and position of the treasure are modele…
cs.DC2022
Treasure Hunt in Graph using Pebbles
Adri Bhattacharya, Barun Gorain, Partha Sarathi Mandal
In this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph are anonymous and the edges incident to a vertex whose deg…