RENDEZVOUS OF AUTONOMOUS MOBILE ROBOTS WITH STATES

We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous setting with persistent memory called light. It is known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. We show that Rendezvous can be solved with optimal number of states if we consider some restricted class of asynchronous setting. In full-light (the robot can recognize own states and states of others), Rendezvous can be solved with 2 states. In external-light, (the robot can recognize only states of others) Rendezvous can be solved with 4 states or 5 states in self-stabilization. When giving restrictions on the initial states and movement of the robots, Rendezvous can be solved with 3 states in external-light