Solving the robots gathering problem

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

Volumn 2719, Issue , 2003, Pages 1181-1196

  Cieliebak, Mark ^a   Flocchini, Paola ^b   Prencipe, Giuseppe ^c   Santoro, Nicola ^d  

^a ETH ZURICH   (Switzerland)

^b UNIVERSITY OF OTTAWA   (Canada)

^c UNIVERSITY OF PISA   (Italy)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AUTONOMOUS MOBILE ROBOT; COMMON COORDINATE SYSTEMS; DIRECT COMMUNICATIONS; GATHERING PROBLEM; INITIAL CONFIGURATION;

ROBOTS;

EID: 35248814218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_90     Document Type: Article

References (16)

1. L. Anderegg, M. Cieliebak, and G. Prencipe. A Linear Time Algorithm to Identify Equiangular and Biangular Point Configurations. Technical Report TR-03-01, Università di Pisa, 2003.
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. C. Bajaj. The Algebraic Degree of Geometric Optimization Problems. Discrete and Computational Geometry, 3:177-191, 1988.
4. T. Balch and R. C. Arkin. Behavior-based Formation Control for Multi-robot Teams. IEEE Transaction on Robotics and Automation, 14(6), 1998.
5. M. Cieliebak and G. Prencipe. Gathering Autonomous Mobile Robots. In SIROCCO 9, pages 57-72, 2002.
6. E. J. Cockayne and Z. A. Melzak. Euclidean Constructibility in Graph-minimization Problems. Mathematical Magazine, 42:206-208, 1969.
7. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. In ISAAC '99, volume 1741 of LNCS, pages 93-102, 1999.
8. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Gathering of Autonomous Mobile Robots With Limited Visibility. In STACS 2001, volume 2010 of LNCS, pages 247-258, 2001.
9. D. Jung, G. Cheng, and A. Zelinsky. Experiments in Realising Cooperation between Autonomous Mobile Robots. In ISER, 1997.
10. Y. Kupitz and H. Martini. Geometric Aspects of the Generalized Fermat-Torricelli Problem. Intuitive Geometry, 6:55-127, 1997.
11. M. J. Matarić. Designing Emergent Behaviors: From Local Interactions to Collective Intelligence. In From Animals to Animals 2: Int. Conf. on Simulation of Adaptive Behavior, pages 423-441, 1993.
12. G. Prencipe. CORDA: Distributed Coordination of a Set of Autonomous Mobile Robots. In ERSADS 2001, pages 185-190, 2001.
13. G. Prencipe. Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots. In ICTCS 2001, pages 185-190, 2001.
14. I. Suzuki and M. Yamashita. Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. Siam Journal of Computing, 28(4):1347-1363, 1999.
15. E. Weiszfeld. Sur le Point Pour Lequel la Somme Des Distances de n Points Donnés Est Minimum. Tohoku Mathematical, 43:355-386, 1936.
16. E. Welzl. Smallest Enclosing Disks (Balls and Ellipsoids). In H. Maurer, editor, New Results and New Trends in Computer Science, LNCS, pages 359-370. Springer, 1991.