scientific article
From MaRDI portal
Publication:2729100
zbMath0970.68700MaRDI QIDQ2729100
Giuseppe Prencipe, Nicola Santoro, Peter Widmayer, Paola Flocchini
Publication date: 23 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (24)
Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Circle formation of weak robots and Lyndon words ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Information Spreading by Mobile Particles on a Line ⋮ Deterministic geoleader election in disoriented anonymous systems ⋮ An improved algorithm for reconstructing a simple polygon from its visibility angles ⋮ Reconstructing visibility graphs with simple robots ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Explicit Communication Among Stigmergic Robots ⋮ Randomized gathering of asynchronous mobile robots ⋮ Local spreading algorithms for autonomous robot systems ⋮ Self-deployment of mobile sensors on a ring ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Coordination without communication: the case of the flocking problem ⋮ Gathering of asynchronous robots with limited visibility ⋮ Formation of a geometric pattern with a mobile wireless sensor network ⋮ Gathering few fat mobile robots in the plane ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ Reconstructing Visibility Graphs with Simple Robots
This page was built for publication:
