Sciweavers

SIROCCO
2010
14 years 11 days ago
Asynchronous Deterministic Rendezvous in Bounded Terrains
Abstract. Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and ...
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel, ...
ISAAC
2004
Springer
102views Algorithms» more  ISAAC 2004»
14 years 4 months ago
Polynomial Deterministic Rendezvous in Arbitrary Graphs
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
Dariusz R. Kowalski, Andrzej Pelc