2 search results - page 1 / 1 » Asynchronous Deterministic Rendezvous in Bounded Terrains |
SIROCCO
2010
14 years 11 days ago
2010
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 ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...