Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions

TL;DR

This paper discusses methods for designing complex interplanetary trajectories, introduces innovative techniques for asteroid mission planning, and demonstrates their application in the context of the Global Trajectory Optimization Competition.

Contribution

It introduces new techniques like asteroid phasing value and efficient asteroid clustering for improved global search in interplanetary trajectory design.

Findings

Effective trajectory design strategies demonstrated.

Introduction of asteroid phasing value and clustering methods.

Application to a multiple asteroid rendezvous problem.

Abstract

The design of interplanetary trajectories often involves a preliminary search for options later refined/assembled into one final trajectory. It is this broad search that, often being intractable, inspires the international event called Global Trajectory Optimization Competition. In the first part of this chapter, we introduce some fundamental problems of space flight mechanics, building blocks of any attempt to participate successfully in these competitions, and we describe the use of the open source software PyKEP to solve them. In the second part, we formulate an instance of a multiple asteroid rendezvous problem, related to the 7th edition of the competition, and we show step by step how to build a possible solution strategy. In doing so, we introduce two new techniques useful in the design of this particular mission type: the use of an asteroid phasing value and its surrogates and the efficient computation of asteroid clusters. We show how the basic building blocks, sided to these innovative ideas, allow designing an effective global search for possible trajectories.