Mars Missions Using Solar Electric Propulsion
Solar Electric Propulsion (SEP) trajectories are shown for Mars missions between late 2004 and 2011.
Engineering topics
Publications and source records attributed to Coverstone-Carroll, V..
Solar Electric Propulsion (SEP) trajectories are shown for Mars missions between late 2004 and 2011.
Generic algorithms have gained popularity as an effective procedure for obtaining solutions to traditionally difficult space mission optimization problems. In this paper, a brief survey of the use of genetic algorithms to solve astrodynamics problems is presented and is followed by new results obtained from applying a Pareto genetic algorithm to the optimization of low-thrust interplanetary spacecraft missions.
In recent years, pressure to reduce the costs of interplanetary missions has led to a heighted emphasis on designing missions with shorter flight times, smaller launch vehicles, and simpler flight systems.
A direct optimization method based on differential inclusion concepts has been developed and used to compute low thrust trajectories. This new formulation removes explicit control dependence from the problem statement thereby reducing the dimension of the parameter space of the resulting nonlinear programming problem. A simple example of a two-dimensional gravity-free trajectory involving a maximum velocity transfer to a rectilinear path is discussed. Three interplanetary trajectory examples, an Earth-Mars constant specific impulse transfer, and Earth-Jupiter constant specific impulse transfer, and an Earth-Venus-Mars variable specific impulse gravity assist, are also included. An analysis of the technique's performance is provided.
Minimum-fuel, impulsive, time-fixed solutions are obtained for the problem of orbital rendezvous and interception with interior path constraints. Transfers between coplanar circular orbits in an inverse-square gravitational field are considered, subject to a circular path constraint representing a minimum or maximum permissible orbital radius. Primer vector theory is extended to incorporate path constraints. The optimal number of impulses, their times and positions, and the presence of initial or final coasting arcs are determined. The existence of constraint boundary arcs and boundary points is investigated as well as the optimality of a class of singular arc solutions. To illustrate the complexities introduced by path constraints, an analysis is made of optimal rendezvous in field-free space subject to a minimum radius constraint.