scientific article; zbMATH DE number 7650877

DOI10.4230/LIPICS.OPODIS.2019.27MaRDI QIDQ5874261zbMATH OpenFDO

Authors Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita, Sébastien Tixeuil, Koichi Wada

Publication date 7 February 2023

Full work available at URL https://arxiv.org/abs/1911.04757

zbMATH Keywords

myopicring networksluminousASYNC schedulersLCM robot system

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cited in

(10)

• Memory optimal dispersion by anonymous mobile robots
• Memory optimal dispersion by anonymous mobile robots
• Compatibility of convergence algorithms for autonomous mobile robots
• Computational power of autonomous robots: transparency vs. opaqueness
• Maximum independent set formation on a finite grid by myopic robots
• Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
• Gathering on a circle with limited visibility by anonymous oblivious robots
• Gathering on a circle with limited visibility by anonymous oblivious robots
• Perpetual torus exploration by myopic luminous robots
• Rendezvous of Asynchronous Mobile Robots with Lights

This page was built for publication:

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