Metraipolis › archive › dc_ce4fec8f2ec1

Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots — arXiv:2609.23454

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.23454
License (as archived)
CC0-1.0
Archived
2026-10-09T06:53:03.549Z
SHA-256 of the archived text
e9a7fab894cca13051fe65ef950252ea173da32d14da3307b85bffa02f2265f8
Stable URL of this page
https://metraipolis.com/documento/dc_ce4fec8f2ec1

How to cite

Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots — arXiv:2609.23454 — arXiv (en), https://arxiv.org/abs/2609.23454 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce4fec8f2ec1 (Metraipolis archive dc_ce4fec8f2ec1, sha256 e9a7fab894cca13051fe65ef950252ea173da32d14da3307b85bffa02f2265f8)
BibTeX
@misc{dcce4fec8f2ec1,
  title = {Conflicting Pattern Formation by Teams of Anonymous, Fully Disoriented Robots — arXiv:2609.23454},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.23454},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce4fec8f2ec1; sha256 e9a7fab894cca13051fe65ef950252ea173da32d14da3307b85bffa02f2265f8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23454. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Two groups of autonomous, anonymous, and oblivious mobile robots are deployed in the two-dimensional Euclidean plane, each assigned a distinct task. We study a setting where the two groups must simultaneously solve two conflicting pattern formation problems: the \textit{gathering problem}, where robots gather at a point not known to them a priori, and the \textit{circle formation problem}, where robots occupy distinct positions on the boundary of a circle. Although each robot knows its own task, it cannot identify other members of its group. A prior solution~\cite{Conflict-1} addressed this problem for asynchronous robots having {\it direction-only axis agreement} and {\it global weak multiplicity detection} capability available to all robots in both groups. In contrast, in this work, we consider fully {\it disoriented robots} without any axis agreement or common \textit{chirality}. We study the feasibility of a solution to this problem for {\it disoriented robots}. We propose a distributed algorithm that solves the problem for semi-synchronous disoriented robots with non-rigid movements. Our proposed algorithm assumes global weak multiplicity detection only for the gathering group, while for the circle formation group, it requires local weak multiplicity detection.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-22 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Computational Geometry (cs.CG); Multiagent Systems (cs.MA); Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.23454 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T06:50:13.532Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).