We consider the rendezvous problem of gathering two or more identical agents that are initially scattered among the nodes of an unknown graph. We discuss some of the recent results for this problem focusing only on deterministic algorithms for the general case when the graph topology is unknown, the nodes of the graph may not be uniquely labeled and the agents may not be synchronized with each ...

In the symmetric rendezvous search game played on Kn (the completely connected graph on n vertices) two players are initially placed at two distinct vertices (called locations). The game is played in discrete steps and at each step each player can either stay where he is or move to a different location. The players share no common labelling of the locations. They wish to minimize the expected n...

This paper examines final rendezvous between two vehicles in highly elliptic orbits. The range of eccentricities addressed is 0.6 to 0.9. Due to the varying orbital speeds of the two vehicles, the relative motion during elliptic rendezvous is highly dependent on initial conditions and differs significantly from the relative motion seen in circular rendezvous. The character of the motion has imp...

In large-scale wireless networks such as mobile ad hoc and sensor networks, efficient and robust service discovery and data-access mechanisms are both essential and challenging. Rendezvous-based mechanisms provide a valuable solution for provisioning a wide range of services. In this paper, we describe Rendezvous Regions (RRs) a novel scalable rendezvous-based architecture for wireless networks...

Information dissemination in wide area networks has recently garnered much attention. Two differing models, publish/subscribe and rendezvous-based multicast atop overlay networks, have emerged as the two leading approaches for this goal. Event-based publish/subscribe supports contentbased services with powerful filtering capabilities, while peer-to-peer rendezvous-based services allow for effic...

This paper studies distributed rendezvous strategies for multiple nonholonomic wheeled mobile robots with the aim of testing their practicality on real robots. We investigate control strategies which use just bearing-only or range-only measurements and do not need inter-robot radio communication to share the measurements. For the bearing-only case, two control laws proposed in our previous stud...

The transaction concept has been widely used as a powerful tool for the reliable structuring and programming of applications in several fields such as databases, distributed systems ... In this paper, we address the problem of implementing the CSP rendezvous whithin a transactional framework. In fact, several authors have studied the problem of implementing CSP rendezvous on networks of machine...