The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions. A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem. To allow deterministic exploration, it is usually assumed that the edges incident to a node are locally ordered according to a fixed function calle...

The Crew Exploration Vehicle necessitates higher levels of automation than previous NASA vehicles, due to program requirements for automation, including Automated Rendezvous and Docking. Studies of spacecraft development often point to the locus of decisionmaking authority between humans and computers (i.e. automation) as a prime driver for cost, safety, and mission success. Therefore, a critic...

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

Nearly all implementations of the Message Passing Interface (MPI) employ a two-level protocol for point-to-point messages. Short messages are sent eagerly to optimize for latency, and long messages are typically implemented using a rendezvous mechanism. In a rendezvous implementation, the sender must first send a request and receive an acknowledgment before the data can be transferred. While th...

We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet. This task has been considered in the literature under two alternative scenarios: weak and strong. Under the weak scenario, agents may meet either at a node or inside an edge. Under the strong scenario, they have to...

We used rendezvous site locations of wolf (Canis lupus) packs recorded during 1996–2006 to build a predictive model of gray wolf rendezvous site habitat in Idaho, USA. Variables in our best model included green leaf biomass (Normalized Difference Vegetation Index), surface roughness, and profile curvature, indicating that wolves consistently used wet meadow complexes for rendezvous sites. We th...

In many large, distributed or mobile networks, broadcast algorithms are used to update information stored at the nodes. In this paper, we propose a new model of communication based on rendezvous and analyze a multi-hop distributed algorithm to broadcast a message in a synchronous setting. In the rendezvous model, two neighbors u and v can communicate if and only if u calls v and v calls u simul...

The recently investigated `asso model predictive control (MPC) is applied to the terminal phase of a spacecraft rendezvous and capture mission. The interaction between the cost function and the treatment of minimum impulse bit (MIB) is also investigated. The propellant consumption with `asso MPC for the considered scenario is noticeably less than with a conventional quadratic cost and control a...

The present work draws on the understanding how notions of general potential theory – as set up, e.g., by Fuglede – explain existence and some basic results on the " magical " rendezvous numbers. We aim at a fairly general description of rendezvous numbers in a metric space by using systematically the potential theoretic approach. In particular, we generalize and explain results on invariant me...

The problem of pursuit and evasion is a classic problem that has intrigued mathematicians for many generations. Suppose a target or evader is moving along a given curve in the plane. A pursuer or chaser is moving such that its line of sight is always pointing towards the target. The classic problem is to determine the trajectory of the pursuer such that it eventually captures the target. There ...