The High Gain Antenna Pointing and Obstruction Avoidance software performs computations for pointing a Mars Rover high-gain antenna for communication with Earth while (1) avoiding line-of-sight obstructions (the Martian terrain and other parts of the Rover) that would block communication and (2) taking account of limits in ranges of motion of antenna gimbals and of kinematic singularities in gimbal mechanisms. The software uses simplified geometric models of obstructions and of the trajectory of the Earth in the Martian sky(see figure). It treats all obstructions according to a generalized approach, computing and continually updating the time remaining before interception of each obstruction. In cases in which the gimbalmechanism design allows two aiming solutions, the algorithm chooses the solution that provides the longest obstruction-free Earth-tracking time. If the communication session continues until an obstruction is encountered in the current pointing solution and the other solution is now unobstructed, then the algorithm automatically switches to the other position. This software also notifies communication-managing software to cease transmission during the switch to the unobstructed position, resuming it when the switch is complete.

In this Pointing Strategy Example, the rover is flat and level on the Martian surface. The Hardstop Occlusions WHA and WHB are indicated as shrouded regions on the celestial sphere. The Earth trajectory as a function of time is depicted by e.

This program was written by Khaled Ali and Charles Vanelli of Caltech for NASA's Jet Propulsion Laboratory. For further information, access the Technical Support Package (TSP) free on-line at under the Software category.

This software is available for commercial licensing. Please contact Karina Edmonds of the California Institute of Technology at (626) 395-2322. Refer to NPO-42960.

This Brief includes a Technical Support Package (TSP).
Document cover
Avoiding Obstructions in Aiming a High-Gain Antenna

(reference NPO-42960) is currently available for download from the TSP library.

Don't have an account? Sign up here.