Optimally Gathering Two Robots

@inproceedings{Heriban2018OptimallyGT,
  title={Optimally Gathering Two Robots},
  author={Adam Heriban and Xavier D{\'e}fago and S{\'e}bastien Tixeuil},
  booktitle={ICDCN},
  year={2018}
}
We present a self-stabilizing 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… CONTINUE READING
2 Citations
4 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…