# Position Discovery for a System of Bouncing Robots

3 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
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 {\em 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 \emph{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 {\em 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 \leq 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 {\em 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.
Document type :
Conference papers

Cited literature [15 references]

https://hal.inria.fr/hal-00735828
Contributor : Adrian Kosowski Connect in order to contact the contributor
Submitted on : Wednesday, September 26, 2012 - 8:39:36 PM
Last modification on : Saturday, June 25, 2022 - 8:30:01 PM
Long-term archiving on: : Thursday, December 27, 2012 - 8:25:19 AM

### File

bounce.pdf
Files produced by the author(s)

### Citation

Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski, Evangelos Kranakis, Oscar Morales Ponce, et al.. Position Discovery for a System of Bouncing Robots. DISC - 26th International Symposium on Distributed Computing, 2012, Salvador, Brazil. pp.341-355, ⟨10.1007/978-3-642-33651-5_24⟩. ⟨hal-00735828⟩

Record views