Rendezvous under Variable Disorientation:The Algorithmic Power of Fixed Unit Distance

2026-10-07

AI Summary

This study addresses the deterministic rendezvous problem for two robots under weak geometric assumptions, focusing on scenarios involving direction changes and fixed unit distances. Methodologically, it introduces a periodic distance-like technique that translates physical distance variations into predictable phase shifts, demonstrating that fixed local metrics can serve as persistent cyclic memory. By integrating self-stabilizing algorithms, non-rigid movement handling, and multi-color finite-state machine design, the approach accommodates diverse atomicity constraints across schedulers. The primary contributions include a substantial reduction in the required number of colors through optimal three- to six-color algorithms, halving the color upper bound in the fully asynchronous FCOM model from twelve to six, and precisely delineating the solvability boundaries of the problem.

Abstract

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.

Problem

• Deterministic Rendezvous
• Variable Disorientation
• Fixed Unit Distance
• Robots with lights
• Color complexity

Innovation

• Variable Disorientation
• Periodic Distance Classes
• Rendezvous
• Fixed Unit Distance
• Color Complexity