Solving the robots gathering problem
From MaRDI portal
Recommendations
Cited in
(79)- Gathering few fat mobile robots in the plane
- Distributed algorithms for partitioning a swarm of autonomous mobile robots
- The projection median of a set of points
- Certified universal gathering in \(\mathbb {R}^2\) for oblivious mobile robots
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Team assembling problem for asynchronous heterogeneous mobile robots
- On the transformation capability of feasible mechanisms for programmable matter
- Gathering identical autonomous systems on a circle using stigmergy
- How many oblivious robots can explore a line
- Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- Gathering by repulsion
- A continuous strategy for collisionless gathering
- Leader election for anonymous asynchronous agents in arbitrary networks
- Time versus space trade-offs for rendezvous in trees
- Gathering anonymous, oblivious robots on a grid
- Deterministic polynomial approach in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering asynchronous oblivious mobile robots in a ring
- Convergecast and broadcast by power-aware mobile agents
- Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
- Price of asynchrony in mobile agents computing
- Gathering problems for autonomous mobile robots with lights
- How to collect balls moving in the Euclidean plane
- A new approach for analyzing convergence algorithms for mobile robots
- Network exploration by silent and oblivious robots
- Collisionless gathering of robots with an extent
- Distributed computing by mobile robots: gathering
- Convergence of Mobile Robots with Uniformly-Inaccurate Sensors
- Wait-free gathering without chirality
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
- Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
- Self-stabilizing gathering with strong multiplicity detection
- The optimal tolerance of uniform observation error for mobile robot convergence
- The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
- Probabilistic gathering of agents with simple sensors
- Gathering over Meeting Nodes in Infinite Grid*
- Gathering Anonymous, Oblivious Robots on a Grid
- A Continuous Strategy for Collisionless Gathering
- Fast multidimensional asymptotic and approximate consensus
- Local Gathering of Mobile Robots in Three Dimensions
- Gathering by repulsion
- A distributed algorithm for gathering many fat mobile robots in the plane
- Exploring the borderlands of the gathering problem
- Pattern formation by oblivious asynchronous mobile robots
- A rupestrian algorithm
- Connectivity preserving network transformers
- Structural Information and Communication Complexity
- Computing by mobile robotic sensors
- Robots and Demons (The Code of the Origins)
- Separation of circulating tokens
- Gathering of asynchronous robots with limited visibility
- Structural Information and Communication Complexity
- Gathering despite mischief
- LATIN 2004: Theoretical Informatics
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- Stand up indulgent gathering
- Stand up indulgent gathering
- The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots
- Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks
- Efficient live exploration of a dynamic ring with mobile robots
- Gracefully degrading gathering in dynamic rings
- Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
- Scatter of robots
- Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
- Asynchronous deterministic rendezvous in bounded terrains
- A further study on weak Byzantine gathering of mobile agents
- Parking problem by oblivious mobile robots in infinite grids
- Getting close without touching: near-gathering for autonomous mobile robots
- Gathering over meeting nodes in infinite grid
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- How to collect balls moving in the Euclidean plane
- Local spreading algorithms for autonomous robot systems
- How to meet in anonymous network
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Characterizing geometric patterns formable by oblivious anonymous mobile robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
This page was built for publication: Solving the robots gathering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4449250)
