Abstract
We study the localization problem in the ring: a collection of n anonymous mobile robots are deployed in a continuous ring of perimeter one. All robots start moving at the same time along the ring with arbitrary velocity, starting in clockwise or counterclockwise direction around the ring. The robots bounce against each other when they meet. The task of each robot is to find out, in finite time, the initial position and the initial velocity of every deployed robot. The only way that robots perceive the information about the environment is by colliding with their neighbors; any type of communication among robots is not possible.
We assume the principle of momentum conservation as well as the conservation of energy, so robots exchange velocities when they collide. The capabilities of each robot are limited to: observing the times of its collisions, being aware of its velocity at any time, and processing the collected information. Robots have no control of their walks or velocities. Robots’ walks depend on their initial positions, velocities, and the sequence of collisions. They are not equipped with any visibility mechanism.
The localization problem for bouncing robots has been studied previously in [1,2] in which robots are assumed to move at the same velocity. The configuration of initial positions of robots and their speeds is considered feasible, if there is a finite time, after which every robot starting at this configuration knows initial positions and velocities of all other robots. Authors of [1] conjectured that if robots have arbitrary velocities, the problem might be solvable, if the momentum conservation and energy preservation principles are assumed.
In this paper we prove that the conjecture in [1] is false. We show that the feasibility of any configuration and the required time for solving it under such stronger constraints depend only on the collection of velocities of the robots. More specifically, if v 0,v 1,…,v n − 1 are the velocities of a given robot configuration \(\mathcal{S}\), we prove that \(\mathcal{S}\) is feasible if and only if \(v_i\neq \bar{v}\) for all 0 ≤ i ≤ n − 1, where \(\bar{v} = \frac{v_0+\ldots+v_{n-1}}{n}\). To figure out the initial positions of all robots no more than \(\frac{2}{min_{0\leq i\leq n-1} |v_i-\bar{v}|}\) time is required.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Synthesis Lectures on Distributed Computing Theory 1(1), 1–122 (2010)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. Comput. 28(4), 1347–1363 (1999)
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)
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)
Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. Algorithms–ESA 2011, 701–712 (2011)
Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1-2), 71–82 (2008)
Murphy, T.: Dynamics of hard rods in one dimension. Journal of Statistical Physics 74(3), 889–901 (1994)
Sevryuk, M.: Estimate of the number of collisions of n elastic particles on a line. Theoretical and Mathematical Physics 96(1), 818–826 (1993)
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)
Jepsen, D.: Dynamics of a simple many-body system of hard rods. Journal of Mathematical Physics 6, 405 (1965)
Cooley, B., Newton, P.: Random number generation from chaotic impact collisions. Regular and Chaotic Dynamics 9(3), 199–212 (2004)
Cooley, B., Newton, P.: Iterated impact dynamics of n-beads on a ring. SIAM Rev. 47(2), 273–300 (2005)
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)
Gregory, R.: Classical mechanics. Cambridge University Press (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czyzowicz, J., Kranakis, E., Pacheco, E. (2013). Localization for a System of Colliding Robots. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds) Automata, Languages, and Programming. ICALP 2013. Lecture Notes in Computer Science, vol 7966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39212-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-39212-2_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39211-5
Online ISBN: 978-3-642-39212-2
eBook Packages: Computer ScienceComputer Science (R0)