25 citations · 69 across the 12 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010
How to meet asynchronously (almost) everywhere
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
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 are…
cs.DS2010★ 4 cited
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel +1
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We…