Opening book details…
Can I read The Gathering Problem for Two Oblivious Robots with Unreliable Compasses on EtoBox?
The Gathering Problem for Two Oblivious Robots with Unreliable Compasses by Izumi, Taisuke; Souissi, Samia; Katayama, Yoshiaki; Inuzuka, Nobuhiro; Défago, Xavier; Wada, Koichi; Yamashita, Masafumi is a scholarly article available to read on EtoBox.
What is The Gathering Problem for Two Oblivious Robots with Unreliable Compasses about?
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. However, the gathering problem for two semi-synchronous robots without memory is trivially solvable when their local coordinate systems are consistent, and the impossibility proof essentially uses the inconsistencies in their coordinate systems. Motivated by this, this paper investigates the magnitude of consistency between the local coordinate systems necessary and sufficient to solve the gathering problem for two oblivious robots under semi-synchronous and asynchronous models. To discuss the magnitude of consistency, we assume that each robot is equipped with an unreliable compass, the bearings of which may deviate from an absolute reference direction, and that the local coordinate system of each robot is determined by its compass. We consider two families of unreliable compasses, namely,static compasses with constant bearings, and dynamic compasses the be
- Author
- Izumi, Taisuke; Souissi, Samia; Katayama, Yoshiaki; Inuzuka, Nobuhiro; Défago, Xavier; Wada, Koichi; Yamashita, Masafumi
- Published
- 2011
- Language
- EN