Gathering non-oblivious mobile robots

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 577-588

  Cieliebak, Mark ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MOBILE ROBOTS;

AUTONOMOUS MOBILE ROBOT; COMMON COORDINATE SYSTEMS; DESTINATION POINTS; DETERMINISTIC ALGORITHMS; DIRECT COMMUNICATIONS; GATHERING PROBLEM;

ROBOTS;

EID: 35048842220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_60     Document Type: Article

References (9)

1. N. Agmon and D. Peleg. Fault-tolerant gathering algorithms for autonomous mobile robots. In ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), to appear.
2. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. A distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transaction on Robotics and Automation, 15(5):818-828, 1999.
3. T. Balch and R. C. Arkin. Behavior-based formation control for multi-robot teams. IEEE Transaction on Robotics and Automation, 14(6):926-939, 1998.
4. th Intern. Colloquium on Automata, Languages and Programming (ICALP 2003), pages 1181-1196, 2003.
5. th International Symposium on Theoretical Aspects of Computer Science (STAGS 2001), pages 247-258, 2001.
6. M. J. Mataric. Designing emergent behaviors: From local interactions to collective intelligence. In From Animals to Animats 2: Int. Conf, on Simulation of Adaptive Behavior, pages 423-441, 1993.
7. G. Prencipe. Distributed Coordination of a Set of Autonomous Mobile Robots. PhD thesis, Università di Pisa, 2002.
8. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. Siam Journal of Computing, 28(4):1347-1363, 1999.
9. E. Welzl. Smallest enclosing disks (balls and ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, pages 359-370. Springer, 1991.