Circle Formation of Weak Mobile Robots

  title={Circle Formation of Weak Mobile Robots},
  author={Yoann Dieudonn{\'e} and Ouiddad Labbani-Igbida and Franck Petit},
The contribution is twofold. We first show the validity of the conjecture of Défago and Konagaya in [DK02], i.e., there exists no deterministic oblivious algorithm solving the Uniform Transformation Problem for any number of robots∗. Next, a protocol which solves deterministically the Circle Formation Problem in finite time for any number n of weak robots—n / ∈ {4, 6, 8}—is proposed. The robots are assumed to be uniform, anonymous, oblivious, and they share no kind of coordinate system nor… CONTINUE READING
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
37 Citations
13 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 37 extracted citations

62 Citations

Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 13 references

Technical Report TR 2006-05

  • Y Dieudonné, F Petit. Circle formation of weak robots, Lyndon words
  • LaRIA, CNRS FRE 2733, Université of Picardie…
  • 2006
1 Excerpt


  • S. Dolev
  • The MIT Press
  • 2000
1 Excerpt

SIAM Journal of Computing

  • I Suzuki, M Yamashita. Distributed anonymous mobile robots - f patterns
  • 28(4):1347–1363,
  • 1999
1 Excerpt

Similar Papers

Loading similar papers…