Memory optimal dispersion by anonymous mobile robots

DOI10.1007/978-3-030-67899-9_34MaRDI QIDQ831752zbMATH OpenOpenAlexFDO

Authors Archak Das, Kaustav Bose, Buddhadeb Sau

Publication date 24 March 2022

Full work available at URL https://arxiv.org/abs/2008.00701

zbMATH Keywords

dispersionrandomized algorithmsdepth-first searchdistributed algorithmmobile robots

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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

Cites work

• scientific article; zbMATH DE number 7650877 (Why is no real title available?)
• 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 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
• Label-guided graph exploration by a finite automaton
• 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

(5)

• Memory optimal dispersion by anonymous mobile robots
• Fault-tolerant dispersion of mobile robots
• Collaborative dispersion by silent robots
• Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
• Distance-2-dispersion with termination by a strong team

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)