Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks

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 unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time $T_{OPT}$ in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time $O(n T_{OPT})$ in a $n$-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to $\Theta (T_{OPT})$ when the agents are allowed to exchange $\Theta(n)$ bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time $\Theta (T_{OPT})$

Study of effects of uncertainties on comet and asteroid encounter and contact guidance requirements. Part 1: Guidance and navigation studies

A guidance algorithm that provides precise rendezvous in the deterministic case while requiring only relative state information is developed. A navigation scheme employing only onboard relative measurements is built around a Kalman filter set in measurement coordinates. The overall guidance and navigation procedure is evaluated in the face of measurement errors by a detailed numerical simulation. Results indicate that onboard guidance and navigation for the terminal phase of rendezvous is possible with reasonable limits on measurement errors

Rendezvous radar for the orbital maneuvering vehicle

The Rendezvous Radar Set (RRS) was designed at Motorola's Strategic Electronics Division in Chandler, Arizona, to be a key subsystem aboard NASA's Orbital Maneuvering Vehicle (OMV). The unmanned OMV, which was under development at TRW's Federal Systems Division in Redondo Beach, California, was designed to supplement the Shuttle's satellite delivery, retrieval, and maneuvering activities. The RRS was to be used to locate and then provide the OMV with vectoring information to the target satellite (or Shuttle or Space Station) to aid the OMV in making a minimum fuel consumption approach and rendezvous. The OMV development program was halted by NASA in 1990 just as parts were being ordered for the RRS engineering model. The paper presented describes the RRS design and then discusses new technologies, either under development or planned for development at Motorola, that can be applied to radar or alternative sensor solutions for the Automated Rendezvous and Capture problem

CRAF/Cassini (C/C)

The Comet Rendezvous Asteroid Flyby (CRAF) is a mission to rendezvous with the comet Tempel 2 and to station-keep at the comet for a period of 2.6 years, including the comet perihelion. There is a flyby of the asteroid Mandeville prior to the arrival at Tempel 2. The Cassini is a mission to place a spacecraft in a highly elliptical orbit around the planet Saturn and deliver a probe to the surface of its satellite Titan. There is a flyby of the asteroid 1989 UR1 prior to arrival at Saturn. Coverage goals for the two missions are explained. Information is given in tabular form for frequency assignments, telemetry, command, navigation, and tracking support responsibility

The Modular Clock Algorithm for Blind Rendezvous

This thesis examines the problem in initializing communications whereby cognitive radios need to find common spectrum with other cognitive radios, a process known as frequency rendezvous. It examines the rendezvous problem as it exists in a dynamic spectrum access cognitive network. Specifically, it addresses the problem of rendezvous in an infrastructureless environment. A new algorithm, the modular clock algorithm, is developed and analyzed as a solution for the simple rendezvous environment model, coupled with a modified version for environment models with less information. The thesis includes a taxonomy of commonly used environment models, and analysis of previous efforts to solve the rendezvous problem. Mathematical models and solutions used in applied statistics are analyzed for use in cognitive networking. A symmetric rendezvous pursuit-evasion game is developed and analyzed. Analysis and simulation results show that the modular clock algorithm performs better than random under a simple rendezvous environment model, while a modified version of the modular clock algorithm performs better than random in more difficult environment models

A binocular stereo approach to AR/C at the Johnson Space Center

Automated Rendezvous and Capture requires the determination of the 6 DOF relating two free bodies. Sensor systems that can provide such information have varying sizes, weights, power requirements, complexities, and accuracies. One type of sensor system that can provide several key advantages is a binocular stereo vision system