Flocking along line by autonomous oblivious mobile robots-Reference-Cited by-同舟云学术

Flocking along line by autonomous oblivious mobile robots

Published:2019-01-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 20th International Conference on Distributed Computing and Networking
language:
Short-container-title:

Author:

Chaudhuri Sruti Gan¹

Affiliation:

1. Jadavpur University, Kolkata, India

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3288599.3295583

Reference10 articles.

1. A distributed algorithm for gathering many fat mobile robots in the plane

2. Gathering of Fat Robots with Limited Visibility and without Global Navigation

3. Gathering few fat mobile robots in the plane

4. A. Dutta S. Gan Chaudhuri S. Datta K. Mukhopadhyaya: Circle formation by asynchronous fat robots with limited visibility; International Conference on Distributed Computing and Internet Technology; Springer Berlin Heidelberg; 83--9. 10.1007/978-3-642-28073-3_8 A. Dutta S. Gan Chaudhuri S. Datta K. Mukhopadhyaya: Circle formation by asynchronous fat robots with limited visibility; International Conference on Distributed Computing and Internet Technology; Springer Berlin Heidelberg; 83--9. 10.1007/978-3-642-28073-3_8

5. S. Datta A. Dutta S. Gan Chaudhuri K. Mukhopadhyaya: Circle Formation by Asynchronous Transparent Fat Robots; International Conference on Distributed Computing and Internet Technology SpringerVerlag Berlin Heidelberg 2013; 195--207. 10.1007/978-3-642-28073-3_8 S. Datta A. Dutta S. Gan Chaudhuri K. Mukhopadhyaya: Circle Formation by Asynchronous Transparent Fat Robots; International Conference on Distributed Computing and Internet Technology SpringerVerlag Berlin Heidelberg 2013; 195--207. 10.1007/978-3-642-28073-3_8

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asynchronous Silent Programmable Matter: Line Formation;Lecture Notes in Computer Science;2023

2. Randomized gathering of asynchronous mobile robots;Theoretical Computer Science;2021-02