Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 1063-1071

  Agmon, Noa ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; COSTS; HEURISTIC METHODS; MOBILE ROBOTS; PROBLEM SOLVING;

CRASH-FAULTY ROBOTS; GATHERING ALGORITHMS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 1842486813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. E. Arkin, M. Bender, S. Fekete, J. Mitchell, and M. Skutella. The freeze-tag problem: How to wake up a swarm of robots. In Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, January 2002.
2. Y. Uny Cao, A. S. Fukunaga, and A. B. Kahng. Cooperative mobile robotics: Antecedents and directions. Autonomous Robots, 4(1):7-23, March 1997.
3. M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Solving the robots gathering problem. In 30th Int. Colloq. on Automata, Languages and Programming, pages 1181-1196, 2003.
4. M. Cieliebak and G. Prencipe. Gathering autonomous mobile robots. In Proc. 9th Int. Colloq. on Structural Information and Communication Complexity, pages 57-72, June 2002.
5. M. Erdmann and T. Lozano-Perez. On multiple moving objects. In Proc. IEEE Conf. on Robotics and Automation, pages 1419-1424, April 1986.
6. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Distributed coordination of a set of autonomous mobile robots. In IEEE Intelligent Vehicles Symposium (IV 2000), pages 480-485, October 2000.
7. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of autonomous mobile robots with limited visibility. In Proc. 18th Symp. on Theoretical Aspects of Computer Science, pages 247-258, February 2001.
8. Y. Kuniyoshi, S. Rougeaux, M. Ishii, N. Kita, S. Sakane, and M. Kakikura. Cooperation by observation - the framework and basic task patterns. In Proc. Int. Conf. on Robotics and Automation, pages 767-774, 1994.
9. L. Parker, C. Touzet, and F. Fernandez. Techniques for learning in multi-robot teams. In T. Balch and L. Parker, editors, Robot Teams: From Diversity to Polymorphism. A. K. Peters, 2001.
10. G. Prencipe. CORDA: Distributed coordination of a set of atonomous mobile robots. In Proc. 4th European Research Seminar on Advances in Distributed Systems, pages 185-190, May 2001.
11. G. Prencipe. Instantaneous actions vs. full asynchronicity: Controlling and coordinating a set of autonomous mobile robots. In Proc. 7th Italian Conf. on Theoretical Computer Science, pages 185-190, October 2001.
12. G. Prencipe. Distributed Coordination of a Set of Atonomous Mobile Robots. PhD thesis, Universita Degli Studi Di Pisa, 2002.
13. K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems, 13(3):127-139, 1996.
14. I. Suzuki and M. Yamashita. Agreement on a common x-y coordinate system by a group of mobile robots. In Proc. Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robots, September 1996.
15. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots - formation and agreement problems. In Proc. 3rd Colloq. on Structural Information and Communication Complexity, pages 313-330, 1996.
16. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. on Computing, 28:1347-1363, 1999.
17. R. Wenger. Helly-type theorems and geometric transversals. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 4, pages 63-82. CRC Press LLC, 1997.
18. D. Yoshida, T. Masuzawa, and H. Fujiwara. Fault-tolerant distributed algorithms for autonomous mobile robots with crash faults. Systems and Computers in Japan, 28:33-43, 1997.