Fast dispersion of mobile robots on arbitrary graphs

DOI10.1007/978-3-030-34405-4_2MaRDI QIDQ6536152zbMATHFDO

Authors Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma

Publication date 5 April 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence for robotics (68T40)

Recommendations

• Dispersion of mobile robots on grids
• Dispersion of mobile robots: the power of randomness
• Near-optimal dispersion on arbitrary anonymous graphs

Cites work

• Autonomous mobile robots with lights
• Collective tree exploration
• Dispersion of mobile robots: the power of randomness
• Euler Tour Lock-In Problem in the Rotor-Router Model
• Fast collaborative graph exploration
• Graph exploration by a finite automaton
• Introduction to algorithms.
• Label-guided graph exploration by a finite automaton
• Time and space optimality of rotor-router graph exploration
• Uniform Deployment of Mobile Agents in Asynchronous Rings
• Uniform multi-agent deployment on a ring

Cited in

(2)

• Distance-2-dispersion with termination by a strong team
• Near-optimal dispersion on arbitrary anonymous graphs

This page was built for publication: Fast dispersion of mobile robots on arbitrary graphs

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