Memory optimal dispersion by anonymous mobile robots
From MaRDI portal
Publication:831752
DOI10.1007/978-3-030-67899-9_34OpenAlexW3129156660MaRDI QIDQ831752FDOQ831752
Buddhadeb Sau, Kaustav Bose, Archak Das
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2008.00701
Cites Work
- Title not available (Why is that?)
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Gathering on rings under the look-compute-move model
- Gathering asynchronous oblivious mobile robots in a ring
- Anonymous meeting in networks
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
- Label-guided graph exploration by a finite automaton
- How to meet in anonymous network
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Tree exploration with little memory
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Exploring Unknown Undirected Graphs
- Fast collaborative graph exploration
- Collaborative exploration of trees by energy-constrained mobile robots
- Dispersion of mobile robots on grids
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Dispersion of mobile robots: the power of randomness
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Optimal constrained graph exploration
- Gathering in dynamic rings
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Optimal gathering by asynchronous oblivious robots in hypercubes
- Fast rendezvous with advice
Cited In (5)
Recommendations
- Memory optimal dispersion by anonymous mobile robots 👍 👎
- SOFSEM 2006: Theory and Practice of Computer Science 👍 👎
- Dispersion of mobile robots on directed anonymous graphs 👍 👎
- Dispersion of mobile robots: the power of randomness 👍 👎
- Efficient Dispersion of Mobile Agents without Global Knowledge 👍 👎
- Optimal Gathering of Oblivious Robots in Anonymous Graphs 👍 👎
- Dispersion of mobile robots on grids 👍 👎
- Distributed Anonymous Mobile Robots: Formation of Geometric Patterns 👍 👎
- Fault-tolerant dispersion of mobile robots 👍 👎
This page was built for publication: Memory optimal dispersion by anonymous mobile robots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831752)
