We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is una...

We study a Rendezvous problem for 2 autonomous mobile robots in asynchronous settings with persistent memory called light. It is well known that Rendezvous is impossible when robots have no lights in basic common models, even if the system is semi-synchronous. On the other hand, Rendezvous is possible if robots have lights with a constant number of colors in several types lights[9, 20]. In asyn...

Abstract: This paper investigates the optimal rendezvous with power-limited propulsion systems and collision avoidance. A 26-state dynamic model is established including both translational and rotational dynamics. This model is effective for describing autonomous rendezvous with both a three-axis attitude stabilized target and a tumbling one. Collisions are prevented through setting a safety sp...

Web Rendezvous is the meeting of information publisher and subscriber, allowing the subscriber to create and maintain a list of links (indices) to publishers' pages. Rendezvous is diÆcult because pages may move and unauthorized publishers may seek to add their pages to the index (spamming). Current rendezvous approaches are work-intensive or restricted to very limited domains. We provide a taxo...

Channel selection is a fundamental problem in Cognitive Radio Networks (CRNs). One basic channel assignment problem is rendezvous, which investigates how secondary users can establish a connection by selecting a common available working channel in the same time slot. Rendezvous is the prerequisite for communication, which however is challenging especially in a dynamic spectrum environment. Link...

We investigate self-stabilizing rendezvous algorithms for two synchronous mobile agents. The rendezvous algorithms make two mobile agents meet at a single node, starting from arbitrary initial locations and arbitrary initial states. We study deterministic algorithms for two synchronous mobile agents with different labels but without using any whiteboard in the graph. First, we show the existenc...

This paper reports a diary study of rendezvousing as performed by university students. The study compares students’ performance when meeting at familiar and unfamiliar rendezvous points. It reports various findings that help to set goals for the development of personal navigation and related services at appropriate levels. For example, when meeting at novel rendezvous points, students : (i) fai...

The multiway rendezvous introduced in Theoretical CSP is a powerful paradigm to achieve synchronization and communication among a group of (possibly more than two) processes. We illustrate the advantages of this paradigm on the production cell benchmark, a model of a real metal processing plant, for which we propose a compositional software controller, which is written in LNT and LOTOS, and mak...

In this paper, the p-Probabilistic Rendezvous algorithm (in short p-PR) is introduced. The main difference between the traditional rendezvous and ours is that the former requires exact location information to calculate the rendezvous. Without this restriction, p-PR is more suitable in applications, where the uncertainty of the locations is commonplace. The main novelty of our approach is that t...