Gathering few fat mobile robots in the plane

DOI10.1016/J.TCS.2008.10.005zbMath1157.68065OpenAlexW1970322539MaRDI QIDQ1004312

Leszek Gąsieniec, Andrzej Pelc, Jurek Czyzowicz

Publication date: 2 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.10.005

zbMATH Keywords

algorithmasynchronousgatheringrobot

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Artificial intelligence for robotics (68T40)

Related Items (30)

Gathering fat mobile robots with slim omnidirectional cameras ⋮ ASYMPTOTICALLY OPTIMAL DETERMINISTIC RENDEZVOUS ⋮ Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ MinMax-Distance Gathering on Given Meeting Points ⋮ Mutual visibility on grid by asynchronous luminous robots ⋮ The mutual visibility problem for fat robots ⋮ Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model ⋮ Gathering of robots on meeting-points: feasibility and optimal resolution algorithms ⋮ Team assembling problem for asynchronous heterogeneous mobile robots ⋮ Optimum Gathering of Asynchronous Robots ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Leader election and gathering for asynchronous fat robots without common chirality ⋮ Computing on rings by oblivious robots: a unified approach for different tasks ⋮ A New Approach for Analyzing Convergence Algorithms for Mobile Robots ⋮ A unified approach for gathering and exclusive searching on rings under weak assumptions ⋮ Distributed algorithms for barrier coverage using relocatable sensors ⋮ Mutual visibility by luminous robots without collisions ⋮ Of robot ants and elephants: a computational comparison ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement ⋮ Connected reconfiguration of lattice-based cellular structures by finite-memory robots ⋮ On the power of bounded asynchrony: convergence by autonomous robots with limited visibility ⋮ Collisionless Gathering of Robots with an Extent ⋮ Getting close without touching: near-gathering for autonomous mobile robots ⋮ Deterministic Meeting of Sniffing Agents in the Plane ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Deterministic rendezvous with different maps ⋮ Pattern Formation by Oblivious Asynchronous Mobile Robots ⋮ Two-agent tree evacuation

Cites Work

• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Algorithms – ESA 2004
• Structural Information and Communication Complexity
• LATIN 2004: Theoretical Informatics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Gathering few fat mobile robots in the plane