Satellite tour design for the Galileo mission

Diehl, R. E.; Kaplan, D.; Penzo, P. A.

doi:10.2514/6.1983-101

Cited by 22 publications

(6 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Heaton et al [5] used the TG in the design of tours in the Jovian system for the Europa Orbiter mission. They found sequences of lunar encounters (Europa, Ganymede, Callisto) which were then input to the Satellite Tour Design Program [6] designed for the Galileo S/C by JPL. That work emphasized the importance of an automatic method to search for transfers within the TG.…”

Section: Introductionmentioning

confidence: 99%

An automatic tree search algorithm for the Tisserand graph

Torre

Fantino

Flores

et al. 2020

AIAA Scitech 2020 Forum

View full text Add to dashboard Cite

The Tisserand graph (TG) is a graphical tool commonly employed in the preliminary design of gravity-assisted trajectories. The TG is a two-dimensional map showing essential orbital information regarding the Keplerian orbits resulting from the close passage by one or more massive bodies, given the magnitude of the hyperbolic excess speed (v 1 ) and the minimum allowed pericenter height for each passage. Contours of constant v 1 populate the TG. Intersections between contours allow to link consecutive flybys and build sequences of encounters en route to a selected destination. When the number of perturbing bodies is large and many v 1 levels are considered, the identification of all the possible sequences of encounters through visual inspection of the TG becomes a laborious task. Besides, if the sequences are used as input for a numerical code for trajectory design and optimization, an automated examination of the TG is desirable. This contribution describes an automatic technique to explore the TG and find all the encounter paths. The technique is based on a tree search method, and the intersections between contours are computed using the regula-falsi scheme. The method is validated through comparisons with solutions available in the open literature. Examples are given of application to interplanetary mission scenarios, including the coupling with a trajectory optimizer.

show abstract

Section: Introductionmentioning

confidence: 99%

An automatic tree search algorithm for the Tisserand graph

Torre

Fantino

Flores

et al. 2020

AIAA Scitech 2020 Forum

View full text Add to dashboard Cite

show abstract

“…Past milestone missions to the gas giants incorporated tours of the moons and, thus, satisfied multiple science objectives at different targets simultaneously. For example, for the Galileo spacecraft, launched in 1989, Diehl et al (1983) designed a 23-month tour of the Jovian system that was successfully accomplished in the 1990s. For the Cassini-Huygens mission, launched in 1997, Strange et al (2002) introduced a tour around the Saturnian system to meet scientific objectives that demonstrates the advantage of this category of trajectories for this type of missions.…”

Section: Introductionmentioning

confidence: 99%

Transfer design between neighborhoods of planetary moons in the circular restricted three-body problem

Canales,

Howell,

Fantino

2021

Preprint

View full text Add to dashboard Cite

Given the interest in future space missions devoted to the exploration of key moons in the solar system and that may involve libration point orbits, an efficient design strategy for transfers between moons is introduced that leverages the dynamics in these multi-body systems. The moon-to-moon analytical transfer (MMAT) method is introduced, comprised of a general methodology for transfer design between the vicinities of the moons in any given system within the context of the circular restricted three-body problem, useful regardless of the orbital planes in which the moons reside. A simplified model enables analytical constraints to efficiently determine the feasibility of a transfer between two different moons moving in the vicinity of a common planet. In particular, connections between the periodic orbits of such two different moons are achieved. The strategy is applicable for any type of direct transfers that satisfy the analytical constraints. Case studies are presented for the Jovian and Uranian systems. The transition of the transfers into higher-fidelity ephemeris models confirms the validity of the MMAT method as a fast tool to provide possible transfer options between two consecutive moons.

show abstract

“…Traditionally, patched-conic analysis has dominated preliminary design approaches for interplanetary missions that are comprised of multiple flybys and include satellite tours such as Galileo, 1 Cassini, [2][3][4] and a proposed Europa Orbiter mission. [5][6][7] However, incorporating multiple gravity fields in the dynamical model, early in the tour design process, could expand the design options for future missions.…”

Section: Introductionmentioning

confidence: 99%

Spacecraft Trajectory Design Strategies Based on Close Encounters with a Smaller Primary in a 4-Body Model

Howell

Davis

2008

AIAA/AAS Astrodynamics Specialist Conference and Exhibit

View full text Add to dashboard Cite

In spacecraft trajectory design, ΔV is limited and it becomes necessary to alter the characteristics of an orbit through other means. For example, close encounters of one or several moons in a planetary system can be employed to alter the shape of the orbit. Also, if the spacecraft is oriented favorably with respect to the sun, the solar gravity can be employed to alter the shape of the planetary orbit. When combined, the results can be dramatic. In this investigation, an efficient strategy to incorporate multiple gravity fields in the initial trajectory design process is explored.  , relative to the planet-moon rotating x-axis. Various investigations of orbits in multi-body regimes, including comets and other solar system particles, as well as spacecraft, employ the kick function to lend insight to the problem. Malyshkin and Tremaine 10 represent the kick function as a continuous interpolation function determined from a numerically integrated set of trajectories and apply it to the problem of the orbital evolution of comet trajectories, considering the probabilities of cometary survival. Zhou, Sun, Zheng, and Valtonen 11 derive the kick function from an expansion of the equations of motion in the Circular Restricted 3-body Problem (CR3BP) and employ it to study the transfer of comets from the Oort cloud to the inner solar system due to the gravitational effects of Jupiter. Pan and Sari 12 integrate the torque exerted

show abstract

Satellite tour design for the Galileo mission

Cited by 22 publications

References 2 publications

An automatic tree search algorithm for the Tisserand graph

An automatic tree search algorithm for the Tisserand graph

Transfer design between neighborhoods of planetary moons in the circular restricted three-body problem

Spacecraft Trajectory Design Strategies Based on Close Encounters with a Smaller Primary in a 4-Body Model

Contact Info

Product

Resources

About