Distributed Computing

, Volume 28, Issue 4, pp 245–252 | Cite as

Localization for a system of colliding robots

  • Jurek Czyzowicz
  • Evangelos Kranakis
  • Eduardo Pacheco
Article

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 with arbitrary velocities, starting in clockwise or counterclockwise direction around the ring. The robots bounce against each other according to the principles of conservation of energy and momentum. 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; robots have no control of their walks or velocities moreover any type of communication among them is not possible. 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. It was conjectured in Czyzowicz et al. (2012) that if the principles of conservation of energy and momentum were assumed and the robots had arbitrary velocities, the localization problem might be solvable. We prove that this conjecture is false. We show that if \(v_0,v_1,\ldots ,v_{n-1}\) are the velocities of a given robot configuration \(\mathcal {S}\), then \(\mathcal {S}\) is feasible if and only if \(v_i\ne \bar{v}\) for all \(0\le i \le n-1\), where \(\bar{v}= \frac{v_0+\cdots +v_{n-1}}{n}\). To figure out the initial positions of all robots no more than \(\frac{2}{min_{0\le i\le n-1} |v_i-\bar{v}|}\) time is required.

Keywords

Mobile robots Algorithms Synchronous systems Elastic collisions 

References

  1. 1.
    Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E., Morales-Ponce, O., Pacheco, E.: Position discovery for a system of bouncing robots. In: The 26-th International Symposium on Distributed Computing, DISC, pp. 341–355 (2012)Google Scholar
  2. 2.
    Kranakis, E., Krizanc, D., Markou, E.: The mobile agent rendezvous problem in the ring. Synth. Lect. Distrib. Comput. Theory 1, 1–122 (2010)CrossRefGoogle Scholar
  3. 3.
    Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 4, 1347–1363 (1999)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric patterns. In: PODC, pp. 257–276 (2010)Google Scholar
  5. 5.
    Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 4, 235–253 (2006)Google Scholar
  6. 6.
    Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC, pp. 292–299 (2006)Google Scholar
  7. 7.
    Czyzowicz, J., Gasieniec, L., Kosowski, A., Kranakis, E.: Boundary patrolling by mobile agents with distinct maximal speeds. AlgorithmsESA 2011, 701–712 (2011)MathSciNetGoogle Scholar
  8. 8.
    Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 1–2, 71–82 (2008)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Murphy, T.: Dynamics of hard rods in one dimension. J. Stat. Phys. 3, 889–901 (1994)CrossRefGoogle Scholar
  10. 10.
    Sevryuk, M.: Estimate of the number of collisions of n elastic particles on a line. Theor. Math. Phys. 1, 818–826 (1993)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Tonks, L.: The complete equation of state of one, two and three-dimensional gases of hard elastic spheres. Phys. Rev. 10, 955 (1936)CrossRefGoogle Scholar
  12. 12.
    Wylie, J., Yang, R., Zhang, Q.: Periodic orbits of inelastic particles on a ring. Phys. Rev. E 86(2), 026601 (2012)Google Scholar
  13. 13.
    Jepsen, D.: Dynamics of a simple many-body system of hard rods. J. Math. Phys. 6, 405–413 (1965)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Cooley, B., Newton, P.: Random number generation from chaotic impact collisions. Regul. Chaotic Dyn. 3, 199–212 (2004)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Cooley, B., Newton, P.: Iterated impact dynamics of \(n\)-beads on a ring. SIAM Rev. 2, 273–300 (2005)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Susca, S., Bullo, F.: Synchronization of beads on a ring. In: 46th IEEE Conference on Decision and Control, pp. 4845–4850 (2007)Google Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    Friedetzky, T., Gasieniec, L., Gorry, T., Martin, R.: Observe and remain silent (communication-less agent location discovery). In: The 37-th International Symposium on Mathematical Foundations of Computer Science, MFCS, pp. 407–418 (2012)Google Scholar
  19. 19.
    Gregory, R.: Classical Mechanics. Cambridge University Press, Cambridge (2006)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Jurek Czyzowicz
    • 1
  • Evangelos Kranakis
    • 2
  • Eduardo Pacheco
    • 2
  1. 1.Université du Québec en OutaouaisGatineauCanada
  2. 2.Carleton UniversityOttawaCanada

Personalised recommendations