Author:
Klasing Ralf,Markou Euripides,Pelc Andrzej
Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Fault-tolerant gathering algorithms for autonomous mobile robots;Agmon;SIAM J. Comput.,2006
2. The Theory of Search Games and Rendezvous;Alpern,2002
3. Distributed memoryless point convergence algorithm for mobile robots with limited visibility;Ando;IEEE Trans. Robot. Autom.,1999
4. Gathering non-oblivious mobile robots;Cieliebak,2004
5. Solving the robots gathering problem;Cieliebak,2003
Cited by
130 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Stand-up indulgent gathering on lines;Theoretical Computer Science;2024-11
2. Online Planning Approaches for Multi-Robot Rendezvous;2024 10th International Conference on Automation, Robotics and Applications (ICARA);2024-02-22
3. Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots;Lecture Notes on Data Engineering and Communications Technologies;2024
4. Stand-Up Indulgent Gathering on Rings;Lecture Notes in Computer Science;2024
5. Memory optimal dispersion by anonymous mobile robots;Discrete Applied Mathematics;2023-12