25 citations · 126 across the 37 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
Reaching a Target in the Plane with no Information
Andrzej Pelc
A mobile agent has to reach a target in the Euclidean plane. Both the agent and the target are modeled as points. In the beginning, the agent is at distance at most from the…
cs.DS2017
Deterministic Rendezvous at a Node of Agents with Arbitrary Velocities
Sébastien Bouchard, Yoann Dieudonné, Andrzej Pelc +1
We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to mee…