Gathering Two Stateless Mobile Robots Using Very v
Masafumi Yamashita, Samia Souissi, Xavier D ́efago · 2007
This paper considers two asynchronous identical mobile robots in an environment devoid of any landmarks or common coordinate system. The robots, executing their own instance of the same algorithm, must cooperate to end up at the exact same location (not predetermined) within a finite time. The probl