Metraipolis › archive › dc_a6a3e64285ee
Rendezvous under Variable Disorientation:The Algorithmic Power of Fixed Unit Distance — arXiv:2610.09713
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.09713
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T11:29:02.824Z
- SHA-256 of the archived text
ce7c65dfedc79c714f5566320cffb25a201fdf62d276b5e45bd3a00ae806eab0- Stable URL of this page
https://metraipolis.com/documento/dc_a6a3e64285ee
How to cite
Rendezvous under Variable Disorientation:The Algorithmic Power of Fixed Unit Distance — arXiv:2610.09713 — arXiv (en), https://arxiv.org/abs/2610.09713 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a6a3e64285ee (Metraipolis archive dc_a6a3e64285ee, sha256 ce7c65dfedc79c714f5566320cffb25a201fdf62d276b5e45bd3a00ae806eab0)
BibTeX
@misc{dca6a3e64285ee,
title = {Rendezvous under Variable Disorientation:The Algorithmic Power of Fixed Unit Distance — arXiv:2610.09713},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.09713},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a6a3e64285ee; sha256 ce7c65dfedc79c714f5566320cffb25a201fdf62d276b5e45bd3a00ae806eab0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09713. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study deterministic Rendezvous of two robots with lights under weak geometric and synchronization assumptions. Our focus is on Variable Disorientation (VD), where each robot may arbitrarily rotate, reflect, and rescale its local coordinate system at every \Look, and on VD+Fixed-Unit-Distance (FUD), where each robot's local unit distance remains fixed. We consider the one-sided visibility models FSTA and FCOM, and schedulers ranging from the energy-restricted RSYNCH and R-RSYNCH to fully asynchronous executions. Under VD, we prove color-independent impossibility results for FSTA under SSYNCH and for FCOM under ASYNCH, and establish sharp two-color boundaries under RSYNCH and R-RSYNCH. Under VD+FUD, we introduce periodic distance classes, which turn multiplicative changes of the physical distance into predictable cyclic phase shifts. This technique yields a two-color self-stabilizing non-$L$-Rendezvous algorithm for both FSTA and FCOM under RSYNCH and R-RSYNCH even with Non-Rigid movement. Under Rigid movement, periodic distance classes further yield an optimal three-color non-quasi-self-stabilizing algorithm for FSTA under SSYNCH, a four-color FSTA algorithm under $M$-atomic ASYNCH, and a four-color FCOM algorithm under CM-atomic ASYNCH. By guarding the latter phase mechanism with two additional colors and replacing its initial swap by passive initialization, we obtain a six-color FCOM algorithm under full ASYNCH, improving the previous twelve-color upper bound by a factor of two. These results show that a fixed local metric can serve as persistent cyclic memory, and clarify how metric stability, one-sided visibility, and scheduler atomicity jointly determine Rendezvous solvability and color complexity. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2610.09713 — 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-08T10:29:06.606Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).