The min-move mutual visibility problem for disoriented asynchronous robots

DOI10.1016/J.TCS.2025.115125MaRDI QIDQ7014482zbMATH OpenFDO

Authors Subhash Bhagat, Krishnendu Mukhopadhyaya, Rajarshi Ray

Publication date 11 March 2025

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

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

zbMATH Keywords

asynchronous robotsdisoriented robotsdistributed algorithmsmutual visibilitynon-rigid movementpersistent lightsswarm of robots

Mathematics Subject Classification ID

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

Cites work

• A distributed algorithm for gathering many fat mobile robots in the plane
• A new approach for analyzing convergence algorithms for mobile robots
• Constant-time complete visibility for asynchronous robots with lights
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Formation of General Position by Asynchronous Mobile Robots Under One-Axis Agreement
• Mutual visibility by asynchronous robots on infinite grid
• Mutual visibility by luminous robots without collisions
• Mutual visibility by robots with persistent memory
• Mutual visibility for asynchronous robots
• On fast pattern formation by autonomous robots
• Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
• Optimum algorithm for the mutual visibility problem
• Rendezvous of two robots with constant memory

This page was built for publication: The min-move mutual visibility problem for disoriented asynchronous robots

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