Memory optimal dispersion by anonymous mobile robots

DOI10.1016/J.DAM.2023.07.005MaRDI QIDQ6094723zbMATH OpenOpenAlexFDO

Authors Archak Das, Kaustav Bose, Buddhadeb Sau

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

zbMATH Keywords

depth first searchdispersiondistributed algorithmsmobile robotsrandomized algorithm

Mathematics Subject Classification ID

Computer system organization (68Mxx) Discrete mathematics in relation to computer science (68Rxx) Artificial intelligence (68Txx)

Cites work

• Anonymous meeting in networks
• Collaborative exploration of trees by energy-constrained mobile robots
• Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences
• Dispersion of mobile robots on grids
• Dispersion of mobile robots: the power of randomness
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Exploring Unknown Undirected Graphs
• Fast collaborative graph exploration
• Fast rendezvous with advice
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering in dynamic rings
• Gathering on rings under the look-compute-move model
• How to meet in anonymous network
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• scientific article; zbMATH DE number 7650877 (Why is no real title available?)
• Label-guided graph exploration by a finite automaton
• Memory optimal dispersion by anonymous mobile robots
• Mobile robots gathering algorithm with local weak multiplicity in rings
• Optimal constrained graph exploration
• Optimal gathering by asynchronous oblivious robots in hypercubes
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
• Time versus cost tradeoffs for deterministic rendezvous in networks
• Tree exploration with little memory

Cited in

(4)

• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Near-linear time dispersion of mobile agents
• Balanced dispersion on time-varying dynamic graphs
• Memory optimal dispersion by anonymous 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 Q6094723)