scientific article; zbMATH DE number 2038783

zbMath1039.68129MaRDI QIDQ4449250

Mark Cieliebak, Paola Flocchini, Nicola Santoro, Giuseppe Prencipe

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27191181.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40)

Related Items (44)

Gathering over Meeting Nodes in Infinite Grid* ⋮ Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Gathering Anonymous, Oblivious Robots on a Grid ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Price of asynchrony in mobile agents computing ⋮ Impossibility of gathering by a set of autonomous mobile robots ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ Gathering asynchronous oblivious agents with local vision in regular bipartite graphs ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Efficient live exploration of a dynamic ring with mobile robots ⋮ Self-stabilizing gathering with strong multiplicity detection ⋮ Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ How many oblivious robots can explore a line ⋮ Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains ⋮ The optimal tolerance of uniform observation error for mobile robot convergence ⋮ Asynchronous deterministic rendezvous in bounded terrains ⋮ Local spreading algorithms for autonomous robot systems ⋮ How to meet in anonymous network ⋮ Computing by Mobile Robotic Sensors ⋮ The kissing problem: how to end a gathering when everyone kisses everyone else goodbye ⋮ On the transformation capability of feasible mechanisms for programmable matter ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ Arbitrary pattern formation by asynchronous, anonymous, oblivious robots ⋮ Gathering asynchronous oblivious mobile robots in a ring ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Time versus space trade-offs for rendezvous in trees ⋮ Connectivity preserving network transformers ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Characterizing geometric patterns formable by oblivious anonymous mobile robots ⋮ Separation of circulating tokens ⋮ Gathering of asynchronous robots with limited visibility ⋮ Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring ⋮ Network Exploration by Silent and Oblivious Robots ⋮ Gathering few fat mobile robots in the plane ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots ⋮ The projection median of a set of points ⋮ Gathering anonymous, oblivious robots on a grid ⋮ Fast Multidimensional Asymptotic and Approximate Consensus ⋮ Convergence of Mobile Robots with Uniformly-Inaccurate Sensors ⋮ Unnamed Item ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Deterministic polynomial approach in the plane ⋮ Convergecast and broadcast by power-aware mobile agents

This page was built for publication: