Pages that link to "Item:Q2382675"

The following pages link to Impossibility of gathering by a set of autonomous mobile robots (Q2382675):

Displaying 37 items.

• Gathering fat mobile robots with slim omnidirectional cameras (Q300242) (← links)
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
• Energy-efficient strategies for building short chains of mobile robots locally (Q392202) (← links)
• Self-stabilizing gathering with strong multiplicity detection (Q418745) (← links)
• The optimal tolerance of uniform observation error for mobile robot convergence (Q442269) (← links)
• A survey on relay placement with runtime and approximation guarantees (Q465673) (← links)
• Leader election and gathering for asynchronous fat robots without common chirality (Q491635) (← links)
• Computing on rings by oblivious robots: a unified approach for different tasks (Q494795) (← links)
• Asynchronous deterministic rendezvous in bounded terrains (Q650932) (← links)
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
• Gathering of robots on anonymous grids and trees without multiplicity detection (Q896693) (← links)
• Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
• Characterizing geometric patterns formable by oblivious anonymous mobile robots (Q974737) (← links)
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
• On asynchronous rendezvous in general graphs (Q1625604) (← links)
• Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains (Q1946493) (← links)
• The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
• Randomized gathering of asynchronous mobile robots (Q2222092) (← links)
• Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings (Q2407627) (← links)
• Gathering six oblivious robots on anonymous symmetric rings (Q2447532) (← links)
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement (Q2634716) (← links)
• Gathering problems for autonomous mobile robots with lights (Q2680865) (← links)
• Rendezvous of Two Robots with Constant Memory (Q2868644) (← links)
• Optimal Gathering of Oblivious Robots in Anonymous Graphs (Q2868646) (← links)
• MinMax-Distance Gathering on Given Meeting Points (Q2947015) (← links)
• Rendezvous Problem (Q2961403) (← links)
• Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model (Q2961405) (← links)
• Optimum Gathering of Asynchronous Robots (Q2971632) (← links)
• Gathering Asynchronous Robots in the Presence of Obstacles (Q2980916) (← links)
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots (Q3012964) (← links)
• Collisionless Gathering of Robots with an Extent (Q3075515) (← links)
• Convergence of Mobile Robots with Uniformly-Inaccurate Sensors (Q3408180) (← links)
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots (Q3511387) (← links)
• (Q5091102) (← links)
• Optimal \(\mathcal{L} \)-algorithms for rendezvous of asynchronous mobile robots with external-lights (Q6057840) (← links)
• Efficient live exploration of a dynamic ring with mobile robots (Q6069843) (← links)