Missions to rendezvous with or capture an asteroid present significant interest both from a geophysical and safety point of view. They are key to the understanding of our solar system and are stepping stones for interplanetary human flight. In this paper, we focus on a rendezvous mission with 2006 RH120, an asteroid classified as a Temporarily Captured Orbiter (TCO). TCOs form a new population ...

In this study, a single autonomous underwater vehicle (AUV) aims to rendezvous with a submerged leader recovery vehicle through a cluttered and variable operating field. The rendezvous problem is transformed into a nonlinear optimal control problem (NOCP) and then numerical solutions are provided. A penalty function method is utilized to combine the boundary conditions, vehicular and environmen...

Rendezvous problem has been attracting much attention as a fundamental process to construct the Cognitive Radio Network (CRN). Many elegant algorithms have been proposed to achieve rendezvous on some common channel in a short time, but they are vulnerable to the jamming attacks where a jammer may exist listening or blocking the channels [13]. In this paper, we propose the Multi-Radio Channel De...

Most of existing rendezvous algorithms generate channel-hopping sequences based on the whole channel set. They are inefficient when the set of available channels is a small subset of the whole channel set. We propose a new algorithm called ZOS which uses three types of elementary sequences (namely, Zero-type, One-type, and S-type) to generate channel-hopping sequences based on the set of availa...

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

AIM To examine whether rendezvous endoscopic retrograde cholangiopancreatography (ERCP) is associated with less pancreatic damage, measured as leakage of proenzymes, than conventional ERCP. METHODS Patients (n = 122) with symptomatic gallstone disease, intact papilla and no ongoing inflammation, were prospectively enrolled in this case-control designed study. Eighty-one patients were subjecte...

Synchronous message-passing communication, or rendezvous, occurring between software tasks can have a signiicant eeect on system performance. The rendezvous style of communication is coming into wider use in programming languages and operating systems for parallel and distributed environments. Understanding the performance implications of this style of inter-task communication is becoming a mat...

This article points out a strong connection between process calculi and atomic commit. Process calculus rendezvous is an abstract semantics for atomic commitment. An implementation of process-calculus rendezvous is an atomic commit protocol. Thus, the traditional correctness properties for atomic commit are entailed by a bisimulation proof of a calculus implementation. Actually, traditional ren...