The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
Anonymous mobile robots are often classified into synchronous, semi-synchronous, and asynchronous robots when discussing the pattern formation problem. For semi-synchronous robots, all patterns formable with memory are also formable without memory, with the single exception of forming a point (i.e., the gathering) by two robots. (All patterns formable with memory …