Abstract
Systems consisting of a collection of independently operating mobile robots (a.k.a. robot swarms) have recently been studied from a distributed computing point of view. The paper reviews the basic model developed for such systems and some recent algorithmic results on a number of coordination and control tasks for robot swarms. The paper then discusses various possibilities for modifications in the basic model, and examines their effects via the example of the partitioning problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agmon, N., Peleg, D.: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, January 2004, pp. 1063–1071 (2004)
Beni, G., Wang, J.: Theoretical Problems for the Realization of Distributed Robotic Systems. In: Proc. IEEE Int. Conf. on Robotics and Automation, April 1991, pp. 1914–1920 (1991)
Cieliebak, M.: Gathering non-oblivious mobile robots. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 577–588. Springer, Heidelberg (2004)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)
Cieliebak, M., Prencipe, G.: Gathering Autonomous Mobile Robots. In: Proc. 9th Int. Colloq. on Stuctural Information and Communication Complexity, June 2002, pp. 57–72 (2002)
Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 228–239. Springer, Heidelberg (2004)
Cohen, R., Peleg, D.: Robot Convergence via Center-of-Gravity Algorithms. In: Kralovic, R., Sýkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 79–88. Springer, Heidelberg (2004)
Cohen, R., Peleg, D.: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements. In: Proc. 23rd Int. Symp. on Theoretical Aspects of Computer Science, pp. 549–560 (2006)
Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: A Taxonomy for Multi-Agent Robotics. Autonomous Robots 3, 375–397 (1996)
Efrima, A., Peleg, D.: Algorithms for Partitioning Swarms of Autonomous Mobile Robots. Technical Report MCS06-08, The Weizmann Institute of Science (October 2006)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Distributed Coordination of a Set of Atonomous Mobile Robots. In: Proc. IEEE Intelligent Vehicles Symp., pp. 480–485 (2000)
Jung, D., Cheng, G., Zelinsky, A.: Experiments in Realizing Cooperation between Autonomous Moblie Robots. In: Proc. Int. Symp. on Experimental Robotics (June 1997)
Parker, L.E., Touzet, C.: Multi Robot Learning in a Cooperative Observation Task. Distributed Autonomous Robotic Systems 4, 391–401 (2000)
Prencipe, G.: Achievable Patterns by an even Number of Autonomous Mobile Robots. Technical Report, Dipartimento di Informatica, Universita di Pisa (2000)
Prencipe, G.: Corda: Distributed Coordination of a Set of Atonomous Mobile Robots. In: Proc. 4th European Research Seminar on Advances in Distributed Systems, pp. 185–190 (May 2001)
Prencipe, G.: Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, p. 154. Springer, Heidelberg (2001)
Prencipe, G.: Distributed Coordination of a Set of Atonomous Mobile Robots. PhD Thesis, Universita Degli Studi di Pisa (2002)
Prencipe, G.: On the Feasibility of Gathering by Autonomous Mobile Robots. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 246–261. Springer, Heidelberg (2005)
Preparata, F., Shamos, M.: Computational Geometry: an Introduction. Springer, Heidelberg (1985)
Sugihara, K., Suzuki, I.: Distributed Algorithms for Formation of Geometric Patterns with Many Mobile Robots. Robotic Systems 13, 127–139 (1996)
Suzuki, I., Yamashita, M.: 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, pp. 313–330 (1996)
Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots – Formation and Agreement Problems. In: Proc. 3rd Colloq. on Structural Information and Communication Complexity, pp.313–330 (1996)
Suzuki, I., Yamashita, M.: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns. SIAM J. on Computing 28(4), 1347–1363 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Efrima, A., Peleg, D. (2007). Distributed Models and Algorithms for Mobile Robot Systems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)