Computing without communicating: ring exploration by asynchronous oblivious robots
From MaRDI portal
Publication:2392925
DOI10.1007/S00453-011-9611-5zbMATH Open1272.68399OpenAlexW2020796742MaRDI QIDQ2392925FDOQ2392925
Authors: P. Flocchini, David Ilcinkas, Andrzej Pelc, N. Santoro 
Publication date: 5 August 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9611-5
Recommendations
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Computing on rings by oblivious robots: a unified approach for different tasks
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- How to gather asynchronous oblivious robots on anonymous rings
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering Asynchronous Oblivious Mobile Robots in a Ring
- About ungatherability of oblivious and asynchronous robots on anonymous rings
Cites Work
- Piecemeal graph exploration by a mobile robot.
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Theoretical aspects of distributed computing in sensor networks.
- Gathering asynchronous oblivious mobile robots in a ring
- Collective tree exploration
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Title not available (Why is that?)
- Exploring an unknown graph
- Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Gathering few fat mobile robots in the plane
- Impossibility of gathering by a set of autonomous mobile robots
- Map construction of unknown graphs by multiple agents
- Network exploration by silent and oblivious robots
- Tree exploration with little memory
- Exploring Unknown Environments
- Algorithms – ESA 2005
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Structural Information and Communication Complexity
- Searching for a Black Hole in Synchronous Tree Networks
- Optimal constrained graph exploration
- Tree exploration with logarithmic memory
- Title not available (Why is that?)
- Optimal graph exploration without good maps
- Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
- Exploring Unknown Undirected Graphs
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
- Computing by mobile robotic sensors
Cited In (40)
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Exclusive perpetual ring exploration without chirality
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- On the self-stabilization of mobile oblivious robots in uniform rings
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Remembering without memory: tree exploration by asynchronous oblivious robots
- Ring exploration of myopic luminous robots with visibility more than one
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Leader election and shape formation with self-organizing programmable matter
- Efficient grid exploration with a stationary token
- Optimal deterministic ring exploration with oblivious asynchronous robots
- Computing the \(k\)-resilience of a synchronized multi-robot system
- How many oblivious robots can explore a line
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
- Ring exploration with myopic luminous robots
- Search by a metamorphic robotic system in a finite 2D square grid
- Optimal torus exploration by oblivious robots
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Universal systems of oblivious mobile robots
- Formal verification of mobile robot protocols
- Live exploration with mobile robots in a dynamic ring (revisited)
- Explore and repair graphs with black holes using mobile entities
- Gathering on rings under the look-compute-move model
- Ring exploration with myopic luminous robots
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Parameterized verification of algorithms for oblivious robots on a ring
- Computing on rings by oblivious robots: a unified approach for different tasks
- Perpetual torus exploration by myopic luminous robots
- Perpetual torus exploration by myopic luminous robots
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Anonymous graph exploration without collision by mobile robots
- Position discovery for a system of bouncing robots
- Ring exploration of myopic luminous robots with visibility more than one
- Gathering of robots on anonymous grids and trees without multiplicity detection
- An environment for specifying and model checking mobile ring robot algorithms
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Model checking of robot gathering
- Network exploration by silent and oblivious robots
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
This page was built for publication: Computing without communicating: ring exploration by asynchronous oblivious robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392925)
