Arbitrary Pattern Formation with Four Robots

Quentin Bramas (1) , Sébastien Tixeuil (2, 3)

1 ICube - Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie
2 NPA - Networks and Performance Analysis
3 LINCS - Laboratory of Information, Network and Communication Sciences

The pattern formation problem by autonomous mobile robots has been extensively studied and is at the core of oblivious mobile robots literature. However remaining cases involving few robots are still open. In this paper we propose a new geometric invariant that exists in any configuration with four robots. We then use this invariant to solve the pattern formation problem with four robots, with or without the common chirality assumption.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Quentin Bramas, Sébastien Tixeuil. Arbitrary Pattern Formation with Four Robots. SSS 2018 - 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2018, Tokyo, Japan. pp.333-348, ⟨10.1007/978-3-030-03232-6_22⟩. ⟨hal-02076496⟩