Abstract
Bouncing robots are mobile agents with limited sensing capabilities adjusting their movements upon collisions either with other robots or obstacles in the environment. They behave like elastic particles sliding on a cycle or a segment. When two of them collide, they instantaneously update their velocities according to the laws of classical mechanics for elastic collisions. They have no control on their movements which are determined only by their masses, velocities, and upcoming sequence of collisions.
We suppose that a robot arriving for the second time to its initial position dies instantaneously. We study the survivability of collections of swarms of bouncing robots. More exactly, we are looking for subsets of swarms such that after some initial bounces which may result in some robots dying, the surviving subset of the swarm continues its bouncing movement, with no robot reaching its initial position.
For the case of robots of equal masses and speeds we prove that all robots bouncing in the segment must always die while there are configurations of robots on the cycle with surviving subsets. We show the smallest such configuration containing four robots with two survivors. We show that any collection of less than four robots must always die. On the other hand, we show that \(|{\mathcal S}_{}^+-{\mathcal S}_{}^-|\) robots always die where \({\mathcal S}_{}^+\) (and \({\mathcal S}_{}^-\) ) is the number of robots starting their movements in clockwise (respectively counterclockwise) direction in swarm \({\mathcal S}_{}\).
When robots bouncing on a cycle or a segment have arbitrary masses we show that at least one robot must always die. Further, we show that in either environment it is possible to construct swarms with n − 1 survivors. We prove, however, that the survivors in the segment must remain static (i.e, immobile) indefinitely, while in the case of the cycle it is possible to have surviving collections with strictly positive kinetic energy.
Our proofs use results on dynamics of colliding particles. As far as we know, this is the first time that these particular techniques have been used in order to analyze the behavior of mobile robots from a theoretical perspective.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Czyzowicz, J., Kranakis, E., Pacheco, E.: Localization for a system of colliding robots. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part II. LNCS, vol. 7966, pp. 508–519. Springer, Heidelberg (2013)
Czyzowicz, J., Gąsieniec, L., Kosowski, A., Kranakis, E., Ponce, O.M., Pacheco, E.: Position discovery for a system of bouncing robots. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 341–355. Springer, Heidelberg (2012)
Friedetzky, T., Gąsieniec, L., Gorry, T., Martin, R.: Observe and remain silent (Communication-less agent location discovery). In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 407–418. Springer, Heidelberg (2012)
Cooley, B., Newton, P.: Iterated impact dynamics of n-beads on a ring. SIAM Rev. 47(2), 273–300 (2005)
Cooley, B., Newton, P.: Random number generation from chaotic impact collisions. Regular and Chaotic Dynamics 9(3), 199–212 (2004)
Sevryuk, M.: Estimate of the number of collisions of n elastic particles on a line. Theoretical and Mathematical Physics 96(1), 818–826 (1993)
Jepsen, D.: Dynamics of a simple many-body system of hard rods. Journal of Mathematical Physics 6, 405 (1965)
Rosenfeld, M.: Some of my favorite “lesser known” problems. Ars Mathematica Contemporanea 1(2), 137–143 (2008)
Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric patterns. In: PODC, pp. 267–276 (2010)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)
Murphy, T.: Dynamics of hard rods in one dimension. Journal of Statistical Physics 74(3), 889–901 (1994)
Tonks, L.: The complete equation of state of one, two and three-dimensional gases of hard elastic spheres. Physical Review 50(10), 955 (1936)
Wylie, J., Yang, R., Zhang, Q.: Periodic orbits of inelastic particles on a ring. Physical Review E 86(2), 026601 (2012)
Murphy, T., Cohen, E.: Maximum number of collisions among identical hard spheres. Journal of Statistical Physics 71(5-6), 1063–1080 (1993)
Glashow, S.L., Mittag, L.: Three rods on a ring and the triangular billiard. Journal of Statistical Physics 87(3-4), 937–941 (1997)
Susca, S., Bullo, F.: Synchronization of beads on a ring. In: 46th IEEE Conference on Decision and Control, pp. 4845–4850 (2007)
Wang, H., Guo, Y.: Synchronization on a segment without localization: algorithm and applications. In: International Conference on Intelligent Robots and Systems, IROS, pp. 3441–3446 (2009)
Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235–253 (2006)
Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC, pp. 292–299 (2006)
Dobrev, S., Flocchini, P., Prencipe, G., Santoro, N.: Mobile search for a black hole in an anonymous ring. Algorithmica 48(1), 67–90 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czyzowicz, J., Dobrev, S., Kranakis, E., Pacheco, E. (2014). Survivability of Swarms of Bouncing Robots. In: Pardo, A., Viola, A. (eds) LATIN 2014: Theoretical Informatics. LATIN 2014. Lecture Notes in Computer Science, vol 8392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54423-1_54
Download citation
DOI: https://doi.org/10.1007/978-3-642-54423-1_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54422-4
Online ISBN: 978-3-642-54423-1
eBook Packages: Computer ScienceComputer Science (R0)