Perpetual torus exploration by myopic luminous robots

DOI10.1016/J.TCS.2023.114143OpenAlexW4386170081MaRDI QIDQ6077066FDOQ6077066

Authors: Omar Darwich, Ahmet-Sefa Ulucan, Quentin Bramas, Anissa Lamani, Anaïs Durand, Pascal Lafourcade 

Publication date: 17 October 2023

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114143

zbMATH Keywords

luminous robotsperpetual explorationtorus-shaped network

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Remembering without memory: tree exploration by asynchronous oblivious robots
• How many oblivious robots can explore a line
• Optimal probabilistic ring exploration by semi-synchronous oblivious robots
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Exclusive perpetual ring exploration without chirality
• Optimal torus exploration by oblivious robots
• Infinite grid exploration by disoriented robots
• Perpetual torus exploration by myopic luminous robots
• Ring exploration with myopic luminous robots
• Finding water on Poleless using melomaniac myopic chameleon robots

Cited In (2)

• Optimal torus exploration by oblivious robots
• Perpetual torus exploration by myopic luminous robots

This page was built for publication: Perpetual torus exploration by myopic luminous robots

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