Search NASA⌕ Search

SEARCH · Search NASA

Results for “Low Thrust Trajectory”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRS2017

Characteristics of Energy-Optimal Spiraling Low-thrust Escape Trajectories

We present and discuss trajectory characteristics of low-thrust spacecraft thrusting along the instantaneous velocity vector toward escape. The behavior of the osculating eccentricity is examined, in which eccentricity decreases to a minimum before quickly increasing toward escape (e = 1). We find that the argument of periapsis replaces true anomaly as the fast time variable, and the spacecraft escapes near an osculating true anomaly of 90 degrees. This behavior was observed by the authors while designing thrusting maneuvers for the Dawn spacecraft. In this paper the dynamical theory governing these observations is discussed and explored with numerical simulations.

Grebow, Daniel↗
NASA NTRS2015

An Automatic Medium to High Fidelity Low-Thrust Global Trajectory Toolchain; EMTG-GMAT

Solving the global optimization, low-thrust, multiple-flyby interplanetary trajectory problem with high-fidelity dynamical models requires an unreasonable amount of computational resources. A better approach, and one that is demonstrated in this paper, is a multi-step process whereby the solution of the aforementioned problem is solved at a lower-fidelity and this solution is used as an initial guess for a higher-fidelity solver. The framework presented in this work uses two tools developed by NASA Goddard Space Flight Center: the Evolutionary Mission Trajectory Generator (EMTG) and the General Mission Analysis Tool (GMAT). EMTG is a medium to medium-high fidelity low-thrust interplanetary global optimization solver, which now has the capability to automatically generate GMAT script files for seeding a high-fidelity solution using GMAT's local optimization capabilities. A discussion of the dynamical models as well as thruster and power modeling for both EMTG and GMAT are given in this paper. Current capabilities are demonstrated with examples that highlight the toolchains ability to efficiently solve the difficult low-thrust global optimization problem with little human intervention.

low thrust↗
NASA NTRSDate not supplied

Q-Law for Rapid Assessment of Low Thrust Cislunar Trajectories Via Automatic Differentiation

Q-Law is a Lyapunov-based control law used to determine optimal controls for a low thrust trajectory. One major issue with its use is the difficult derivatives re-quired for calculating optimal controls at a given time. In this paper, an implementation of Q-Law with automatic differentiation via a Python package called JAX is applied. With automatic differentiation, the difficult derivatives for Q-Law’s optimal controls are calculated with ease, and derivatives of final states with respect to Q-Law’s weights are found enabling gradient-based optimization of Q-Law for the first time. Different search and optimization methods for finding optimal weights are then compared using the LEO to GEO problem, and it was found that gradient-free methods like design of experiments and genetic algorithm produced the best results, but they took the longest time to get a solution, while the gradient-based method found a locally optimal result in a much faster time. Overall, the run time for a single propagation is manageable and well-suited for a mission designer to use as an initial guess generator for trajectory optimization, or for simple orbit transfer analysis.

Nathan Steffen↗
NASA NTRS2012

Optimization of Low-Thrust Spiral Trajectories by Collocation

As NASA examines potential missions in the post space shuttle era, there has been a renewed interest in low-thrust electric propulsion for both crewed and uncrewed missions. While much progress has been made in the field of software for the optimization of low-thrust trajectories, many of the tools utilize higher-fidelity methods which, while excellent, result in extremely high run-times and poor convergence when dealing with planetocentric spiraling trajectories deep within a gravity well. Conversely, faster tools like SEPSPOT provide a reasonable solution but typically fail to account for other forces such as third-body gravitation, aerodynamic drag, solar radiation pressure. SEPSPOT is further constrained by its solution method, which may require a very good guess to yield a converged optimal solution. Here the authors have developed an approach using collocation intended to provide solution times comparable to those given by SEPSPOT while allowing for greater robustness and extensible force models.

Falck, Robert D.↗
NASA NTRS2019

Designing Low-Thrust Enabled Trajectories for a Heliophysics Smallsat Mission to Sun-Earth L5

A small satellite deployed to Sun-Earth L5 could serve as a low-cost platform to observe solar phenomena such as coronal mass ejections. However, the small satellite platform introduces significant challenges in the trajectory design process via limited thrusting capabilities, power and operational constraints, and fixed deployment conditions. To address these challenges, a strategy employing dynamical systems theory is used to design a low-thrust-enabled trajectory for a small satellite to reach the Sun-Earth L5 region. This procedure is demonstrated for a small satellite that launches as a secondary payload with a larger spacecraft destined for a Sun-Earth L2 halo orbit.

Stuart, Jeffrey↗
NASA NTRS2007

Efficient Optimization of Low-Thrust Spacecraft Trajectories

A paper describes a computationally efficient method of optimizing trajectories of spacecraft driven by propulsion systems that generate low thrusts and, hence, must be operated for long times. A common goal in trajectory-optimization problems is to find minimum-time, minimum-fuel, or Pareto-optimal trajectories (here, Pareto-optimality signifies that no other solutions are superior with respect to both flight time and fuel consumption). The present method utilizes genetic and simulated-annealing algorithms to search for globally Pareto-optimal solutions. These algorithms are implemented in parallel form to reduce computation time. These algorithms are coupled with either of two traditional trajectory- design approaches called "direct" and "indirect." In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. The indirect approach involves the primer-vector theory (introduced in 1963), in which the thrust control problem is transformed into a co-state control problem and the initial values of the co-state vector are optimized. In application to two example orbit-transfer problems, this method was found to generate solutions comparable to those of other state-of-the-art trajectory-optimization methods while requiring much less computation time.

Lee, Seungwon↗
NASA NTRS2006

The role of invariant manifolds in lowthrust trajectory design (part III)

This paper is the third in a series to explore the role of invariant manifolds in the design of low thrust trajectories. In previous papers, we analyzed an impulsive thrust resonant gravity assist flyby trajectory to capture into Europa orbit using the invariant manifolds of unstable resonant periodic orbits and libration orbits. The energy savings provided by the gravity assist may be interpreted dynamically as the result of a finite number of intersecting invariant manifolds. In this paper we demonstrate that the same dynamics is at work for low thrust trajectories with resonant flybys and low energy capture. However, in this case, the flybys and capture are effected by continuous families of intersecting invariant manifolds.

low thrust trajectories↗
NASA NTRSDate not supplied

Mission Design Considerations for a Low-Thrust Spacecraft

Developing an executable low-thrust trajectory for use in a spaceflight mission requires the design and optimization of a deterministic trajectory as well as the validation that the selected architecture is robust to some set of uncertainties, execution errors, and potential contingencies. Uncertainty in the ability of the spacecraft and its launch vehicle to execute a trajectory as well as potential deviations such as in-flight anomalies combine with design-to constraints and requirements to complicate the optimization problem. The approach by which robust mission design was accomplished for the initial capability of NASA’s Gateway is presented as well as associated results.

NRHO↗
NASA NTRS2017

Low Thrust Mission Trajectories to Near Earth Asteroids

The discovery of 2016 HO3 and its classification as a quasi-satellite has sparked a stronger interest towards Near Earth Asteroids (NEAs). This work presents low-thrust low-power mission designs to various NEAs using an EELV Secondary Payload Adapter (ESPA). A global trajectory optimizer (EMTG) was used to generate mission solutions to a select 13 NEAs using a 200 watt BHT-200 thruster as a proof of concept. The missions presented here demonstrate that a low-cost electric propulsion ESPA mission to NEAs is a feasible concept for many asteroids.

Asteroid↗
NASA NTRS2011

The Stability of Powered Flight around Asteroids with Application to Vesta

The reliability of low-thrust trajectories between science orbits around large asteroids must be evaluated subject to the unavoidable uncertainties of orbit determination, asteroid physical parameters, momentum de-saturation maneuvers, and transfer maneuver execution error. This paper presents a computationally inexpensive way to extend the concept or orbital stability to trajectories undergoing continuously powered low-thrust flight. Trajectories that are stable using this measure are shown to be stable under the combined uncertainties expected during operations. The measure is general and relatively simple to implement. The method was applied to maneuvers planed around the asteroid Vesta in support of NASA's Dawn Discovery mission.

Dawn↗
NASA NTRS1974

Low thrust space vehicle trajectory optimization using regularized variables

Optimizing the trajectory of a low thrust space vehicle usually means solving a nonlinear two point boundary value problem. In general, accuracy requirements necessitate extensive computation times. In celestial mechanics, regularizing transformations of the equations of motion are used to eliminate computational and analytical problems that occur during close approaches to gravitational force centers. It was shown in previous investigations that regularization in the formulation of the trajectory optimization problem may reduce the computation time. In this study, a set of regularized equations describing the optimal trajectory of a continuously thrusting space vehicle is derived. The computational characteristics of the set are investigated and compared to the classical Newtonian unregularized set of equations. The comparison is made for low thrust, minimum time, escape trajectories and numerical calculations of Keplerian orbits. The comparison indicates that in the cases investigated for bad initial guesses of the known boundary values a remarkable reduction in the computation time was achieved. Furthermore, the investigated set of regularized equations shows high numerical stability even for long duration flights and is less sensitive to errors in the guesses of the unknown boundary values.

Schwenzfeger, K. J.↗
NASA NTRSDate not supplied

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth-Moon system. Using Multi-Reward Proximal Policy Optimization, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Christopher J Sullivan↗
NASA NTRS2021

Exploring Transfers Between Earth-Moon Halo Orbits via Multi-Objective Reinforcement Learning

Multi-Reward Proximal Policy Optimization, a multi-objective deep reinforcement learning algorithm, is used to examine the design space of low-thrust trajectories for a SmallSat transferring between two libration point orbits in the Earth- Moon system. Using Multi-Reward Proximal Policy Optimiza- tion, multiple policies are simultaneously and efficiently trained on three distinct trajectory design scenarios. Each policy is trained to create a unique control scheme based on the trajectory design scenario and assigned reward function: a unique combination of weights scaling competing objectives that guide the spacecraft to the target mission orbit, incentivize faster flight times, and penalize propellant mass usage. Then, the policies are evaluated on the same set of perturbed initial conditions in each scenario to generate the propellant mass usages, flight times, and state discontinuities from a reference trajectory for each control scheme. This solution space of low-thrust trajectories for a SmallSat is used to examine the multi-objective trade space for the trajectory design scenario. By autonomously constructing the solution space, insights into the required propellant mass, flight time, and transfer geometry are rapidly achieved.

Mashiku, Alinda K.↗
NASA NTRS1997

Preliminary Design of Low-Thrust Interplanetary Missions

For interplanetary missions, highly efficient electric propulsion systems can be used to increase the mass delivered to the destination and/or reduce the trip time over typical chemical propulsion systems. This technology is being demonstrated on the Deep Space 1 mission - part of NASA's New Millennium Program validating technologies which can lower the cost and risk and enhance the performance of future missions. With the successful demonstration on Deep Space 1, future missions can consider electric propulsion as a viable propulsion option. Electric propulsion systems, while highly efficient, produce only a small amount of thrust. As a result, the engines operate during a significant fraction of the trajectory. This characteristic makes it much more difficult to find optimal trajectories. The methods for optimizing low-thrust trajectories are typically categorized as either indirect, or direct. Indirect methods are based on calculus of variations, resulting in a two-point boundary value problem that is solved by satisfying terminal constraints and targeting conditions. These methods are subject to extreme sensitivity to the initial guess of the variables - some of which are not physically intuitive. Adding a gravity assist to the trajectory compounds the sensitivity. Direct methods parameterize the problem and use nonlinear programming techniques to optimize an objective function by adjusting a set of variables. A variety of methods of this type have been examined with varying results. These methods are subject to the limitations of the nonlinear programming techniques. In this paper we present a direct method intended to be used primarily for preliminary design of low-thrust interplanetary trajectories, including those with multiple gravity assists. Preliminary design implies a willingness to accept limited accuracy to achieve an efficient algorithm that executes quickly.

Sims, Jon A.↗