scientific article
From MaRDI portal
Publication:2762510
zbMath0976.68550MaRDI QIDQ2762510
Peter Widmayer, Paola Flocchini, Nicola Santoro, Giuseppe Prencipe
Publication date: 9 January 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100247
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
Asynchronous deterministic rendezvous in graphs ⋮ Price of asynchrony in mobile agents computing ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Information Spreading by Mobile Particles on a Line ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ How to meet in anonymous network ⋮ Distributed algorithms for barrier coverage using relocatable sensors ⋮ ``Robot cloud gradient climbing with point measurements ⋮ Coordination without communication: the case of the flocking problem ⋮ Gathering of asynchronous robots with limited visibility ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Gathering few fat mobile robots in the plane ⋮ Practical multiagent rendezvous through modified circumcenter algorithms ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Unnamed Item ⋮ Deterministic polynomial approach in the plane
This page was built for publication:
