Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots

DOI10.1007/978-3-030-64348-5_17MaRDI QIDQ6487910zbMATH OpenFDO

Authors Pavan Poudel, Gokarna Sharma

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64348-5_17

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Uniform scattering of autonomous mobile robots in a grid
• On time complexity for connectivity-preserving scattering of mobile robots
• Mutual visibility by asynchronous robots on infinite grid
• The random bit complexity of mobile robots scattering
• Gathering Anonymous, Oblivious Robots on a Grid

Cited in

(9)

• On time complexity for connectivity-preserving scattering of mobile robots
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem
• Uniform scattering of autonomous mobile robots in a grid
• The random bit complexity of mobile robots scattering
• Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
• Characterizing and computing in linear time mutual-visibility parameters in distance-hereditary graphs
• Near-optimal dispersion on arbitrary anonymous graphs
• Maximum independent set formation on a finite grid by myopic robots
• Optimal dispersion of silent robots in a ring

This page was built for publication: Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots

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