Skip to Main content Skip to Navigation
Reports

Optimally Gathering Two Robots

Abstract : We present an algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light, a robot has no memory of its past actions, and its protocol is deterministic. Since, in the same model, gathering is impossible when lights have a single color, our solution is optimal with respect to the number of used colors.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01575451
Contributor : Sébastien Tixeuil <>
Submitted on : Sunday, August 20, 2017 - 11:55:28 AM
Last modification on : Friday, January 8, 2021 - 5:38:04 PM

Files

gathering_tr.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution - NonCommercial - NoDerivatives 4.0 International License

Identifiers

  • HAL Id : hal-01575451, version 1
  • ARXIV : 1708.06183

Citation

Adam Heriban, Xavier Défago, Sébastien Tixeuil. Optimally Gathering Two Robots. [Research Report] UPMC Sorbonne Universités. 2017. ⟨hal-01575451⟩

Share

Metrics

Record views

887

Files downloads

275