Localization for a system of colliding robots
We study the localization problem in the ring: a collection of $$n$$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 v0,v1,…,vn-1 are the velocities of a given robot configuration S, then S is feasible if and only if vi≠v¯ for all 0≤i≤n-1, where v¯=v0+⋯+vn-1n. To figure out the initial positions of all robots no more than 2min0≤i≤n-1|vi-v¯| time is required.
|Keywords||Algorithms, Elastic collisions, Mobile robots, Synchronous systems|
Czyzowicz, J. (Jurek), Kranakis, E, & Pacheco, E. (Eduardo). (2015). Localization for a system of colliding robots. Distributed Computing, 28(4), 245–252. doi:10.1007/s00446-014-0234-3