Stefan Dobrev
YOU?
Author Swipe
View article: Asynchronous Gathering in a Dangerous Ring
Asynchronous Gathering in a Dangerous Ring Open
Consider a set of k identical asynchronous mobile agents located in an anonymous ring of n nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the same node, not a priori decided, within a finite amount of ti…
View article: Graph Exploration by Energy-Sharing Mobile Agents
Graph Exploration by Energy-Sharing Mobile Agents Open
We consider the problem of collective exploration of a known $n$-node edge-weighted graph by $k$ mobile agents that have limited energy but are capable of energy transfers. The agents are initially placed at an arbitrary subset of nodes in…
View article: Exploration of High-Dimensional Grids by Finite State Machines
Exploration of High-Dimensional Grids by Finite State Machines Open
We consider the problem of finding a treasure at an unknown point of an $n$-dimensional infinite grid, $n\geq 3$, by initially collocated finite state agents (scouts/robots). Recently, the problem has been well characterized for 2 dimensio…
View article: Exploration of High-Dimensional Grids by Finite Automata
Exploration of High-Dimensional Grids by Finite Automata Open
We consider the problem of finding a treasure at an unknown point of an n-dimensional infinite grid, n >= 3, by initially collocated finite automaton agents (scouts/robots). Recently, the problem has been well characterized for 2 dimension…
View article: Treasure Hunt with Barely Communicating Agents
Treasure Hunt with Barely Communicating Agents Open
We consider the problem of fault-tolerant parallel exhaustive search, a.k.a. “Treasure Hunt”, introduced by Fraigniaud, Korman and Rodeh in [13]: Imagine an infinite list of “boxes”, one of which contains a “treasure”. The ordering of the …
View article: Weak Coverage of a Rectangular Barrier
Weak Coverage of a Rectangular Barrier Open
Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intruder crossing the region in a direction parallel to the side…
View article: On the Cost of Waking Up
On the Cost of Waking Up Open
Often, in a distributed system, a task must be performed in which all entities must be involved; however only some of them are active, while the others are inactive, unaware of the new computation that has to take place. In these situation…
View article: Weak Coverage of a Rectangular Barrier
Weak Coverage of a Rectangular Barrier Open
View article: Live Exploration of Dynamic Rings
Live Exploration of Dynamic Rings Open
In the graph exploration problem, a team of mobile computational entities, called agents, arbitrarily positioned at some nodes of a graph, must cooperate so that each node is eventually visited by at least one agent. In the literature, the…