Optimal asynchronous perpetual finite grid exploration

DOI10.1016/J.TCS.2026.116072MaRDI QIDQ7316922zbMATH OpenFDO

Authors Quentin Bramas, Stéphane Devismes, Anaïs Durand, Pascal Lafourcade, Anissa Lamani

Publication date 21 August 2026

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

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

Mathematics Subject Classification ID

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

Cites work

• Beedroids: how luminous autonomous swarms of UAVs can save the world?
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Exclusive perpetual ring exploration without chirality
• Finding water on Poleless using melomaniac myopic chameleon robots
• How many oblivious robots can explore a line
• Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Optimal torus exploration by oblivious robots
• Remembering without memory: tree exploration by asynchronous oblivious robots
• Ring exploration with myopic luminous robots

This page was built for publication: Optimal asynchronous perpetual finite grid exploration

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