The player-symmetric rendezvous search problem on the line is considered. We introduce a new way to define mixed (randomized) strategies, and formalize a general scheme to compute the expected rendezvous time of mixed strategies. We introduce a strategy that has the following properties: (1) move patterns have different lengths, and (2) the probability of choosing a move pattern in the current ...

Theminimum-¢V, Ž xed-time, two-impulse rendezvousbetween two spacecraft orbitingalong two coplanarunidirectional circular orbits (moving-target rendezvous) is studied. To reach this goal, the minimum-¢V, Ž xed-time, two-impulse transfer problem between two Ž xed points on two circular orbits is Ž rst solved. This Ž xed-endpoint transfer is related to the moving-target rendezvous problemby a sim...

Rendezvous and intercept missions to smaller asteroids require precision guidance and control in the terminal mission phase. The zero-effort-miss (ZEM) and zero-effort-velocity (ZEV) information are used to formulate autonomous feedback guidance laws. A terminal-phase guidance strategy for a variety of intercept missions is developed. Different types of navigation information are assumed to be ...

The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, , comprised of a control process, , and finitely, but arbitrarily, many copies of a user process, , executing concurrently with interleaving semantics. We delineate the decidability/undecidability boundary of the PMCP for all possible systems that arise by letting proc...

In the rendezvous problem, two computing entities (called \emph{agents}) located at different vertices in a graph have to meet same vertex. this paper, we consider synchronous \emph{neighborhood problem}, where agents are initially adjacent vertices. While problem can be trivially solved $O(\Delta)$ rounds ($\Delta$ is maximum degree of graph), it highly challenging reveal whether that $o(\Delt...

On April 15, 2005, the Demonstration of Autonomous Rendezvous Technology (DART) spacecraft was successfully deployed from a Pegasus XL rocket launched from the Western Test Range at Vandenberg Air Force Base, California. DART was designed to rendezvous with and perform a variety of maneuvers in close proximity to the Multiple Paths, Beyond-Line-of-Sight Communications (MUBLCOM) satellite, witho...

We study the rendezvous problem with k 2 mobile agents in a n-node ring. We present a new algorithm which solves the rendezvous problem for the non-symmetric distribution of agents on the ring. The mobile agents require the use of O(log k) bit-wise size of internal memory and one indistinguishable token each. In the periodic (but not symmetric) case our new procedure allows the agents to conclu...