Position Discovery for a System of Bouncing Robots

  • Jurek Czyzowicz
  • Leszek Gąsieniec
  • Adrian Kosowski
  • Evangelos Kranakis
  • Oscar Morales Ponce
  • Eduardo Pacheco
Conference paper

DOI: 10.1007/978-3-642-33651-5_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7611)
Cite this paper as:
Czyzowicz J., Gąsieniec L., Kosowski A., Kranakis E., Ponce O.M., Pacheco E. (2012) Position Discovery for a System of Bouncing Robots. In: Aguilera M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg

Abstract

A collection of n anonymous mobile robots is deployed on a unit-perimeter ring or a unit-length line segment. Every robot starts moving at constant speed, and bounces each time it meets any other robot or segment endpoint, changing its walk direction. We study the problem of position discovery, in which the task of each robot is to detect the presence and the initial positions of all other robots. The robots cannot communicate or perceive information about the environment in any way other than by bouncing. Each robot has a clock allowing it to observe the times of its bounces. The robots have no control on their walks, which are determined by their initial positions and the starting directions. Each robot executes the same position detection algorithm, which receives input data in real-time about the times of the bounces, and terminates when the robot is assured about the existence and the positions of all the robots.

Some initial configuration of robots are shown to be infeasible — no position detection algorithm exists for them. We give complete characterizations of all infeasible initial configurations for both the ring and the segment, and we design optimal position detection algorithms for all feasible configurations. For the case of the ring, we show that all robot configurations in which not all the robots have the same initial direction are feasible. We give a position detection algorithm working for all feasible configurations. The cost of our algorithm depends on the number of robots starting their movement in each direction. If the less frequently used initial direction is given to k ≤ n/2 robots, the time until completion of the algorithm by the last robot is \(\frac{1}{2}\lceil \frac{n}{k} \rceil\). We prove that this time is optimal. By contrast to the case of the ring, for the unit segment we show that the family of infeasible configurations is exactly the set of so-called symmetric configurations. We give a position detection algorithm which works for all feasible configurations on the segment in time 2, and this algorithm is also proven to be optimal.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jurek Czyzowicz
    • 1
  • Leszek Gąsieniec
    • 2
  • Adrian Kosowski
    • 3
  • Evangelos Kranakis
    • 4
  • Oscar Morales Ponce
    • 4
  • Eduardo Pacheco
    • 4
  1. 1.Université du Québec en OutaouaisGatineauCanada
  2. 2.University of LiverpoolLiverpoolUK
  3. 3.INRIA Bordeaux Sud-Ouest, LaBRITalenceFrance
  4. 4.Carleton UniversityOttawaCanada

Personalised recommendations