Two anonymous robots placed at different positions on an infinite line need to rendezvous. Each robot possesses a clock which it uses to time its movement. However, the robot’s individual parameters in the form of their walking speed and time unit may or may not be the same for both robots. We study the feasibility of rendezvous in different scenarios, in which some subsets of these parameters are not the same. As the robots are anonymous, they execute the same algorithm and when both parameters are identical the rendezvous is infeasible. We propose a universal algorithm, such that the robots are assured of meeting in finite time, in any case when at least one of the parameters is not equal for both robots.

Additional Metadata
Keywords Anonymous, Asymmetric clock, Competitive ratio, Infinite line, Mobile robot, Rendezvous, Speed
Persistent URL dx.doi.org/10.4230/LIPIcs.OPODIS.2018.25
Conference 22nd International Conference on Principles of Distributed Systems, OPODIS 2018
Citation
Czyzowicz, J. (Jurek), Killick, R. (Ryan), & Kranakis, E. (2019). Linear rendezvous with asymmetric clocks. In Leibniz International Proceedings in Informatics, LIPIcs. doi:10.4230/LIPIcs.OPODIS.2018.25