Distributed computing by mobile robots: gathering
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Deterministic geoleader election in disoriented anonymous systems
- Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
- Universally optimal gathering under limited visibility
- Minimum algorithm sizes for the gathering and related problems of autonomous mobile robots
- Sniffing helps to meet: deterministic rendezvous of anonymous agents in the grid
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- Anonymous meeting in networks
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- Gathering in dynamic rings
- Fast rendezvous with advice
- The mutual visibility problem for fat robots
- Deterministic rendezvous in infinite trees
- Pattern formation for fat robots with memory
- Distributed Models and Algorithms for Mobile Robot Systems
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Optimal gathering by asynchronous oblivious robots in hypercubes
- Gathering robots in graphs: the central role of synchronicity
- Compatibility of convergence algorithms for autonomous mobile robots
- Arbitrary pattern formation on infinite regular tessellation graphs
- Synchronous gathering without multiplicity detection: a certified algorithm
- Gathering of asynchronous robots with limited visibility
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Optimum Gathering of Asynchronous Robots
- Asynchronous coordination under preferences and constraints
- Communication and location discovery in geometric ring networks
- Self-stabilizing gathering with strong multiplicity detection
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- Compatibility of convergence algorithms for autonomous mobile robots (extended abstract)
- Structural Information and Communication Complexity
- Use of information, memory and randomization in asynchronous gathering
- Gathering in the plane of location-aware robots in the presence of spies
- The cost of probabilistic agreement in oblivious robot networks
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Gathering asynchronous robots in the presence of obstacles
- Almost universal anonymous rendezvous in the plane
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Exploring the borderlands of the gathering problem
- On asynchronous rendezvous in general graphs
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Mobile robots with uncertain visibility sensors: possibility results and lower bounds
- Rendezvous of two robots with constant memory
- Optimal gathering of oblivious robots in anonymous graphs
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Leader election and shape formation with self-organizing programmable matter
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Rendezvous with constant memory
- A structured methodology for designing distributed algorithms for mobile entities
- Gathering fat mobile robots with slim omnidirectional cameras
- Synchronous gathering without multiplicity detection: a certified algorithm
- Byzantine gathering in polynomial time
- Wait-free gathering without chirality
- The agreement power of disagreement
- Pattern formation by oblivious asynchronous mobile robots
- Pattern formation for fat robots with lights
- Dispersion of mobile robots on directed anonymous graphs
- Leader election and gathering for asynchronous fat robots without common chirality
- Explicit communication among stigmergic robots
- The minimum algorithm size of k-grouping by silent oblivious robots
- On the computational power of energy-constrained mobile robots
- Distributed patrolling with two-speed robots (and an application to transportation)
- Search by a metamorphic robotic system in a finite 2D square grid
- k-circle formation by disoriented asynchronous robots
- On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Forming sequences of geometric patterns with oblivious mobile robots
- Optimal torus exploration by oblivious robots
- scientific article; zbMATH DE number 2080911 (Why is no real title available?)
- Rendezvous in networks in spite of delay faults
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Universal systems of oblivious mobile robots
- LATIN 2004: Theoretical Informatics
- Byzantine gathering in polynomial time
- Formal verification of mobile robot protocols
- The gathering problem for two oblivious robots with unreliable compasses
- Gathering few fat mobile robots in the plane
- Stand up indulgent gathering
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Near-gathering of energy-constrained mobile agents
- Getting close without touching: near-gathering for autonomous mobile robots
- Gathering Anonymous, Oblivious Robots on a Grid
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Gathering teams of bounded memory agents on a line
- Universal pattern formation by oblivious robots under sequential schedulers
- A rupestrian algorithm
- Autonomous mobile robots with lights
- The mutual visibility problem for fat robots with lights
- Gathering semi-synchronously scheduled two-state robots
- Deterministic treasure hunt and rendezvous in arbitrary connected graphs
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- Collisionless gathering of robots with an extent
- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
- Impossibility of gathering, a certification
- Probabilistic gathering of agents with simple sensors
- Fast deterministic rendezvous in labeled lines
- Minmax-distance gathering on given meeting points
- Distributed computing by mobile robots: uniform circle formation
This page was built for publication: Distributed computing by mobile robots: gathering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143295)
