Distributed computing by mobile robots: gathering
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Gathering few fat mobile robots in the plane
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- On asynchronous rendezvous in general graphs
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Distributed computing by mobile robots: uniform circle formation
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Team assembling problem for asynchronous heterogeneous mobile robots
- On deterministic rendezvous at a node of agents with arbitrary velocities
- Communication and location discovery in geometric ring networks
- Use of information, memory and randomization in asynchronous gathering
- The topology of look-compute-move robot wait-free algorithms with hard termination
- On the computational power of energy-constrained mobile robots: algorithms and cross-model analysis
- Dispersion of mobile robots on directed anonymous graphs
- Arbitrary pattern formation on infinite regular tessellation graphs
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Search by a metamorphic robotic system in a finite 2D square grid
- k-circle formation by disoriented asynchronous robots
- Byzantine gathering in polynomial time
- Pushing lines helps: efficient universal centralised transformations for programmable matter
- Self-stabilizing gathering of mobile robots under crash or Byzantine faults
- Meeting in a polygon by anonymous oblivious robots
- Gathering robots in graphs: the central role of synchronicity
- Optimal torus exploration by oblivious robots
- Randomized gathering of asynchronous mobile robots
- Fault-induced dynamics of oblivious robots on a line
- Embedded pattern formation by asynchronous robots without chirality
- Asynchronous approach in the plane: a deterministic polynomial algorithm
- Forming sequences of geometric patterns with oblivious mobile robots
- Formal verification of mobile robot protocols
- Impossibility of gathering by a set of autonomous mobile robots
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Asynchronous arbitrary pattern formation: the effects of a rigorous approach
- Anonymous meeting in networks
- Rendezvous in networks in spite of delay faults
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Gathering problems for autonomous mobile robots with lights
- The agreement power of disagreement
- Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
- Asynchronous coordination under preferences and constraints
- Deterministic meeting of sniffing agents in the plane
- Universal systems of oblivious mobile robots
- Rendezvous of two robots with constant memory
- Optimal gathering of oblivious robots in anonymous graphs
- The gathering problem for two oblivious robots with unreliable compasses
- Minmax-distance gathering on given meeting points
- Leader election and shape formation with self-organizing programmable matter
- Optimum Gathering of Asynchronous Robots
- Distributed patrolling with two-speed robots (and an application to transportation)
- Gathering asynchronous robots in the presence of obstacles
- Gathering fat mobile robots with slim omnidirectional cameras
- Collisionless gathering of robots with an extent
- Plane formation by synchronous mobile robots without chirality
- Wait-free gathering without chirality
- Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
- Deterministic geoleader election in disoriented anonymous systems
- Self-stabilizing gathering with strong multiplicity detection
- scientific article; zbMATH DE number 2044499 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- scientific article; zbMATH DE number 2080911 (Why is no real title available?)
- Impossibility of gathering, a certification
- Leader election and gathering for asynchronous fat robots without common chirality
- Computing on rings by oblivious robots: a unified approach for different tasks
- Probabilistic gathering of agents with simple sensors
- Byzantine gathering in polynomial time
- Gathering over Meeting Nodes in Infinite Grid*
- Universally optimal gathering under limited visibility
- Uniform Dispersal of Robots with Minimum Visibility Range
- Gathering Anonymous, Oblivious Robots on a Grid
- A Continuous Strategy for Collisionless Gathering
- Mobile robots with uncertain visibility sensors: possibility results and lower bounds
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- TuringMobile: a Turing machine of oblivious mobile robots with limited visibility and its applications
- Optimal rendezvous \(\mathcal{L}\)-algorithms for asynchronous mobile robots with external-lights
- Local Gathering of Mobile Robots in Three Dimensions
- A distributed algorithm for gathering many fat mobile robots in the plane
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Distributed algorithms for barrier coverage using relocatable sensors
- Exploring the borderlands of the gathering problem
- Pattern formation by oblivious asynchronous mobile robots
- Mutual visibility by luminous robots without collisions
- A rupestrian algorithm
- Explicit communication among stigmergic robots
- Distributed Algorithms for Partitioning a Swarm of Autonomous Mobile Robots
- Robots and Demons (The Code of the Origins)
- Distributed Models and Algorithms for Mobile Robot Systems
- Gathering of asynchronous robots with limited visibility
- Structural Information and Communication Complexity
- LATIN 2004: Theoretical Informatics
- Synchronous gathering without multiplicity detection: a certified algorithm
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Stand up indulgent gathering
- Wait-free approximate agreement on graphs
- Gathering in the plane of location-aware robots in the presence of spies
- Near-gathering of energy-constrained mobile agents
- Gathering in dynamic rings
- Synchronous gathering without multiplicity detection: a certified algorithm
- Wait-free approximate agreement on graphs
- Rendezvous with constant memory
- Time versus cost tradeoffs for deterministic rendezvous in networks
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)
