Metraipolis › archive › dc_79202dadc062

Min-Max Uniform Circle Formation by Asynchronous Mobile Robots — arXiv:2610.05008

Source
arXiv
Original
https://arxiv.org/abs/2610.05008
License (as archived)
CC0-1.0
Archived
2026-10-06T05:24:02.091Z
SHA-256 of the archived text
628ad18f220ad06960de9bd4ed677a82e307281fa5e6c9765b4ae8d78c698d0a
Stable URL of this page
https://metraipolis.com/documento/dc_79202dadc062

How to cite

Min-Max Uniform Circle Formation by Asynchronous Mobile Robots — arXiv:2610.05008 — arXiv, https://arxiv.org/abs/2610.05008 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_79202dadc062 (Metraipolis archive dc_79202dadc062, sha256 628ad18f220ad06960de9bd4ed677a82e307281fa5e6c9765b4ae8d78c698d0a)
BibTeX
@misc{dc79202dadc062,
  title = {Min-Max Uniform Circle Formation by Asynchronous Mobile Robots — arXiv:2610.05008},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.05008},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_79202dadc062; sha256 628ad18f220ad06960de9bd4ed677a82e307281fa5e6c9765b4ae8d78c698d0a},
  year = {2026}
}

Archived text

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

Given a set of point robots $\mathcal{R}$ in the Euclidean plane and a target circle $\mathbf C$ enclosing all robot positions, the \textsc{Min-Max Uniform Circle Formation (MMUCF)} problem requires the robots to move to distinct positions on $\mathbf C$ such that the final configuration forms a regular $n$-gon while minimizing the maximum distance traveled by any robot. Uniform circle formation is a fundamental coordination task in swarm robotics with applications in perimeter monitoring, surveillance, boundary coverage, and pattern formation. The literature does not address the optimization of the maximum individual displacement during the formation process. In this work, we study the min--max versions of the circle formation and uniform circle formation problems, where the goal is to minimize the maximum distance traveled by any robot. We consider these problems under the $\mathcal{ASYNC}$ model, where robots are autonomous, anonymous, identical, homogeneous, oblivious, and silent, and operate under the \textit{Look--Compute--Move} model with non-rigid motion. We first give necessary conditions for a deterministic solution and then present deterministic, distributed, and collision-free algorithms that form a circle and a uniform circle in finite time while minimizing the maximum movement. The algorithms ensure that robots reach distinct positions on the circle and, in the uniform case, equally spaced positions on $\mathbf C$ under the considered model.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC) ; Computational Geometry (cs.CG); Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2610.05008 — 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-06T05:23:50.234Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).