Dispersion of mobile robots on directed anonymous graphs

DOI10.1007/978-3-031-09993-9_11MaRDI QIDQ2097347zbMATH OpenOpenAlexFDO

Authors Giuseppe F. Italiano, Debasish Pattanayak, Gokarna Sharma

Publication date 11 November 2022

Full work available at URL https://doi.org/10.1007/978-3-031-09993-9_11

zbMATH Keywords

dispersionmulti-agent systemsdirected graphsmobile robotslocal and 1-hop communicationtime and memory complexity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites work

• scientific article; zbMATH DE number 1559557 (Why is no real title available?)
• scientific article; zbMATH DE number 1775412 (Why is no real title available?)
• Collective tree exploration
• Computing by mobile robotic sensors
• Dispersion of mobile robots on grids
• Dispersion of mobile robots: the power of randomness
• Distributed computing by mobile robots: gathering
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
• Euler Tour Lock-In Problem in the Rotor-Router Model
• Fast collaborative graph exploration
• Graph exploration by a finite automaton
• Label-guided graph exploration by a finite automaton
• Lower and upper competitive bounds for online directed graph exploration
• Time and space optimality of rotor-router graph exploration
• Uniform Deployment of Mobile Agents in Asynchronous Rings
• Uniform multi-agent deployment on a ring
• Uniform scattering of autonomous mobile robots in a grid

Cited in

(1)

• Memory optimal dispersion by anonymous mobile robots

This page was built for publication: Dispersion of mobile robots on directed anonymous graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2097347)