Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
DOI10.1007/978-1-4614-6825-7_13zbMATH Open1356.68016OpenAlexW1495128630MaRDI QIDQ2961405FDOQ2961405
Authors: Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra 
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_13
Recommendations
- Optimal gathering of oblivious robots in anonymous graphs
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
Applications of game theory (91A80) Distributed systems (68M14) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- The theory of search games and rendezvous.
- Gathering asynchronous oblivious mobile robots in a ring
- Design and Analysis of Distributed Algorithms
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Gathering of asynchronous robots with limited visibility
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Gathering few fat mobile robots in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mobile robots gathering algorithm with local weak multiplicity in rings
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Gathering six oblivious robots on anonymous symmetric rings
- Gathering an even number of robots in an odd ring without global multiplicity detection
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Exclusive perpetual ring exploration without chirality
- How to gather asynchronous oblivious robots on anonymous rings
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Mobile Agent Rendezvous in a Synchronous Torus
- Rendezvous Search: A Personal Perspective
Cited In (17)
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Gathering robots in graphs: the central role of synchronicity
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Gathering six oblivious robots on anonymous symmetric rings
- Optimal gathering of oblivious robots in anonymous graphs
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Connected reconfiguration of lattice-based cellular structures by finite-memory robots
- Gathering on rings under the look-compute-move model
- Minmax-distance gathering on given meeting points
- Computing on rings by oblivious robots: a unified approach for different tasks
- Molecular robots with chirality on grids
- On gathering of semi-synchronous robots in graphs
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Gathering of oblivious robots on infinite grids with minimum traveled distance
This page was built for publication: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961405)
