scientific article; zbMATH DE number 2044499

zbMath1042.68677MaRDI QIDQ4448363

Giuseppe Prencipe

Publication date: 18 February 2004

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

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

zbMATH Keywords

ComputabilityDistributed CoordinationDistributed ModelsMobile Robots

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Related Items (11)

Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ On time complexity for connectivity-preserving scattering of mobile robots ⋮ Optimal probabilistic ring exploration by semi-synchronous oblivious robots ⋮ Uniform multi-agent deployment on a ring ⋮ Optimum Gathering of Asynchronous Robots ⋮ Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Of robot ants and elephants: a computational comparison ⋮ Gathering few fat mobile robots in the plane ⋮ Distributed algorithms for partitioning a swarm of autonomous mobile robots

This page was built for publication: