Gathering problems for autonomous mobile robots with lights

DOI10.1016/J.TCS.2022.11.018MaRDI QIDQ2680865zbMATH OpenOpenAlexFDO

Authors Satoshi Terai, Koichi Wada, Yoshiaki Katayama

Publication date 4 January 2023

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

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

zbMATH Keywords

autonomous mobile robotsgatheringrobot with light

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Asynchronous Gathering Algorithms for Autonomous Mobile Robots with Lights
• scientific article; zbMATH DE number 2038783
• Distributed computing by mobile robots: gathering
• Structural Information and Communication Complexity

Cites work

• Autonomous mobile robots with lights
• Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Distributed computing by mobile robots: gathering
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Gathering of asynchronous robots with limited visibility
• Impossibility of gathering by a set of autonomous mobile robots
• LATIN 2004: Theoretical Informatics
• Rendezvous of two robots with visible bits
• Rendezvous with constant memory
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Self-stabilizing gathering with strong multiplicity detection
• Synchronous gathering without multiplicity detection: a certified algorithm
• Synchronous robots vs asynchronous lights-enhanced robots on graphs
• The gathering problem for two oblivious robots with unreliable compasses
• The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case

Cited in

(4)

• Rendezvous of Asynchronous Mobile Robots with Lights
• Gathering semi-synchronously scheduled two-state robots
• On the computational power of energy-constrained mobile robots
• Deterministic color-optimal self-stabilizing semi-synchronous gathering: two certified algorithms

This page was built for publication: Gathering problems for autonomous mobile robots with lights

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