Efficient dispersion in triangular grids without prior knowledge

DOI10.1016/J.TCS.2026.115810MaRDI QIDQ6841388zbMATH OpenFDO

Authors Himani, Supantha Pandit

Publication date 20 March 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115810

zbMATH Keywords

dispersiondistributed algorithmsmobile robotsdeterministic algorithmstriangular grid

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Collective tree exploration
• Computing and Combinatorics
• Dispersion of mobile robots on grids
• Efficient Dispersion of Mobile Agents without Global Knowledge
• Fast dispersion of mobile robots on arbitrary graphs
• Gathering anonymous, oblivious robots on a grid
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Graph exploration by a finite automaton
• Grid exploration by a swarm of autonomous robots with minimum repetitions
• Label-guided graph exploration by a finite automaton
• Near-optimal dispersion on arbitrary anonymous graphs
• OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT
• Optimal torus exploration by oblivious robots
• Time optimal gathering of myopic robots on an infinite triangular grid
• Uniform scattering of autonomous mobile robots in a grid

This page was built for publication: Efficient dispersion in triangular grids without prior knowledge

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