Distributed circle formation for anonymous oblivious robots

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

Volumn 3059, Issue , 2004, Pages 159-174

  Chatzigiannakis, Ioannis ^a   Markou, Michael ^b   Nikoletseas, Sotiris ^a,b  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ROBOTS; X-Y MODEL;

CIRCLE FORMATION; CO-ORDINATE SYSTEM; COMPARATIVE SIMULATION; MULTIPLE MOBILE ROBOT; NEW POSITION; OBLIVIOUS ROBOTS; UPPER BOUND;

ALGORITHMS;

EID: 34249783252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_12     Document Type: Article

References (17)

1. H. Ando, I. Suzuki, and M. Yamashita, Distributed memoryless point convergence algorithm for mobile robots with limited visibility, IEEE Trans. on Robotics and Automation 15 (1999), no. 5, 818-828.
2. F. Aurenhammer, Voronoi diagrams - a survey of a fundamental geometric data structure, ACM Comput. Surv. 23 (1991), no. 3, 345-405.
3. I. Chatzigiannakis, Design and analysis of distributed algorithms for basic commu-nication in ad-hoc mobile networks, Ph.D. dissertation, Dept. of Computer Engi-neering and Informatics, University of Patras, Greece, May 2003.
4. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks, 1st ACM International Annual Workshop on Principles of Mobile Computing (POMC 2001), 2001, pp. 1-19.
5. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, Distributed communication al-gorithms for ad hoc mobile networks, ACM Journal of Parallel and Distributed Computing (JPDC) 63 (2003), no. 1, 58-74, Special issue on Wireless and Mobile Ad-hoc Networking and Computing, edited by A. Boukerche.
6. G. Chirikjian, Kinematics of a metamorphic robotic system, IEEE International Conference on Robotics and Automation, 1994, pp. 449-455.
7. X. Défago and A. Konagaya, Circle formation for oblivious anonymous mobile robots with no common sense of orientation, 2nd ACM International Annual Work-shop on Principles of Mobile Computing (POMC 2002), 2002.
8. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer, Gathering of asyn-chronous oblivious robots with limited visibility, 10th International Symposium on Algorithms and Computation (ISAAC 1999), Springer-Verlag, 1999, Lecture Notes in Computer Science, LNCS 1741, pp. 93-102.
9. V. Gervasi and G. Prencipe, Flocking by a set of autonomous mobile robots, Tech. report, Dipartmento di Informatica, Università di Pisa, October 2001, TR-01-24.
10. D. Kornhauser, G. Miller, and P. Spirakis, Coordinating pebble motion on graphs, the diameter of permutation groups, and applications, 25th IEEE Annual Sympo-sium of Foundations of Computer Science (FOGS 1984), 1984, pp. 241-250.
11. K. Mehlhorn and S. Näher, LEDA: A platform for combinatorial and geometric computing, Cambridge University Press, 1999.
12. A. Pamacha, I. Ebert-Uphoff, and G. Chirikjian, Useful metrics for modular robot motion planning, Transactions on Robotics and Automation 13 (1997), no. 4, 531-545.
13. S. Skyum, A simple algorithm for computing the smallest enclosing circle, Information Processing Letters 37 (1991), no. 3, 121-125.
14. K. Sugihara and I. Suzuki, Distributed motion coordination of multiple mobile robots, IEEE International Symposium on Intelligence Control, 1990, pp. 138,143.
15. I. Suzuki and M. Yamashita, Agreement on a common x-y coordinate system by a group of mobile robots, Dagstuhl Seminar on Modeling and Planning for Sensor-Based Intelligent Robots (Dagstuhl, Germany), September 1996.
16. I. Suzuki and M. Yamashita, Distributed anonymous mobile robots: Formation of geometric patterns, SIAM Journal of Computer Science 28 (1999), no. 4, 1347-1363.
17. J.E. Walter, J.L. Welch, and N.M. Amato, Distributed reconfiguration of meta-morphic robot chains, 19th ACM Annual Symposium on Principles of Distributed Computing (PODC 2000), 2000, pp. 171-180.