On the Feasibility of Gathering by Autonomous Mobile Robots-Reference-Cited by-同舟云学术

On the Feasibility of Gathering by Autonomous Mobile Robots

Published:2005 Issue: Volume: Page:246-261
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Prencipe Giuseppe

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11429647_20

Reference10 articles.

1. Agmon, N., Peleg, D.: Fault Tolerant Gathering Algorithms for Autonomous Mobile Robots. In: Proc. 15th Symposium on Discrete Algorithms (SODA 2004), pp. 1063–1071 (2004)

2. Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: A Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility. IEEE Transactions on Robotics and Automation 15(5), 818–828 (1999)

3. Lecture Notes in Computer Science;M. Cieliebak,2004

4. Lecture Notes in Computer Science;M. Cieliebak,2003

5. Cieliebak, M., Prencipe, G.: Gathering Autonomous Mobile Robots. In: Proc. of 9th International Colloquium on Structural Information And Communication Complexity (SIROCCO 9), June 2002, pp. 57–72 (2002)

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

1. Self-stabilizing gathering of mobile robots under crash or Byzantine faults;Distributed Computing;2019-08-06

2. Asynchronous Mobile Robot Gathering from Symmetric Configurations without Global Multiplicity Detection;Structural Information and Communication Complexity;2011

3. Convergence with Limited Visibility by Asynchronous Mobile Robots;Structural Information and Communication Complexity;2011

4. RoboCast: Asynchronous Communication in Robot Networks;Lecture Notes in Computer Science;2010

5. The Mobile Agent Rendezvous Problem in the Ring;Synthesis Lectures on Distributed Computing Theory;2010-01