Memory optimal dispersion by anonymous mobile robots
From MaRDI portal
Publication:6094723
DOI10.1016/j.dam.2023.07.005OpenAlexW3046858779MaRDI QIDQ6094723
Archak Das, Buddhadeb Sau, Kaustav Bose
Publication date: 14 September 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.07.005
Artificial intelligence (68Txx) Computer system organization (68Mxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Anonymous meeting in networks
- Collaborative exploration of trees by energy-constrained mobile robots
- Dispersion of mobile robots on grids
- Memory optimal dispersion by anonymous mobile robots
- Fast rendezvous with advice
- How to meet in anonymous network
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- How to meet when you forget: log-space rendezvous in arbitrary graphs
- Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
- Gathering on rings under the look-compute-move model
- Dispersion of mobile robots: the power of randomness
- Fast collaborative graph exploration
- Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
- Gathering asynchronous oblivious mobile robots in a ring
- Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
- Optimal constrained graph exploration
- Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings
- Tree exploration with little memory
- Exploring Unknown Undirected Graphs
- Label-guided graph exploration by a finite automaton
- Gathering in dynamic rings
- Time versus cost tradeoffs for deterministic rendezvous in networks
- Optimal gathering by asynchronous oblivious robots in hypercubes
This page was built for publication: Memory optimal dispersion by anonymous mobile robots
