Remembering without memory: tree exploration by asynchronous oblivious robots
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1049494 (Why is no real title available?)
- scientific article; zbMATH DE number 2038783 (Why is no real title available?)
- scientific article; zbMATH DE number 1775412 (Why is no real title available?)
- scientific article; zbMATH DE number 2119714 (Why is no real title available?)
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Algorithms – ESA 2005
- Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
- Exploring Unknown Environments
- Exploring Unknown Undirected Graphs
- Exploring an unknown graph
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering asynchronous oblivious mobile robots in a ring
- Gathering of asynchronous robots with limited visibility
- Impossibility of gathering by a set of autonomous mobile robots
- LATIN 2004: Theoretical Informatics
- LATIN 2004: Theoretical Informatics
- Local spreading algorithms for autonomous robot systems
- Optimal constrained graph exploration
- Optimal graph exploration without good maps
- Piecemeal graph exploration by a mobile robot.
- Tree exploration with logarithmic memory
- \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Cited in
(32)- Optimal probabilistic ring exploration by semi-synchronous oblivious robots
- Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model
- Anonymous meeting in networks
- Computing without communicating: ring exploration by asynchronous oblivious robots
- Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
- Ring exploration of myopic luminous robots with visibility more than one
- Efficient grid exploration with a stationary token
- Of robot ants and elephants: a computational comparison
- Smart Robot Teams Exploring Sparse Trees
- How many oblivious robots can explore a line
- Ring exploration with myopic luminous robots
- Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
- Optimal torus exploration by oblivious robots
- Synchronous robots vs asynchronous lights-enhanced robots on graphs
- Universal systems of oblivious mobile robots
- LABEL-GUIDED GRAPH EXPLORATION WITH ADJUSTABLE RATIO OF LABELS
- Gathering on rings under the look-compute-move model
- Grid exploration by a swarm of autonomous robots with minimum repetitions
- Exploration of High-Dimensional Grids by Finite State Machines
- Exploration of High-Dimensional Grids by Finite Automata
- Computing on rings by oblivious robots: a unified approach for different tasks
- Collective tree exploration
- Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
- Anonymous graph exploration without collision by mobile robots
- Perpetual torus exploration by myopic luminous robots
- Perpetual torus exploration by myopic luminous robots
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Ring exploration of myopic luminous robots with visibility more than one
- The ANTS problem
- LATIN 2004: Theoretical Informatics
- A unified approach for gathering and exclusive searching on rings under weak assumptions
- Network exploration by silent and oblivious robots
This page was built for publication: Remembering without memory: tree exploration by asynchronous oblivious robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q962164)
