Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trajectory optimization”

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 469 records · Page 26

Creation of an Upper Stage Trajectory Capability Boundary to Enable Booster System Trade Space Exploration

The problem of trajectory optimization is important in all space missions. The solution of this problem enables one to specify the optimum thrust steering program which should be followed to achieve a specified mission objective, simultaneously satisfying the constraints.1 It is well known that whether or not the ascent trajectory is optimal can have a significant impact on propellant usage for a given payload, or on payload weight for the same gross vehicle weight.2 Consequently, ascent guidance commands are usually optimized in some fashion. Multi-stage vehicles add complexity to this analysis process as changes in vehicle properties in one stage propagate to the other stages through gear ratios and changes in the optimal trajectory. These effects can cause an increase in analysis time as more variables are added and convergence of the optimizer to system closure requires more analysis iterations. In this paper, an approach to simplifying this multi-stage problem through the creation of an upper stage capability boundary is presented. This work was completed as part of a larger study focused on trade space exploration for the advanced booster system that will eventually form a part of NASA s new Space Launch System.3 The approach developed leverages Design of Experiments and Surrogate Modeling4 techniques to create a predictive model of the SLS upper stage performance. The design of the SLS core stages is considered fixed for the purposes of this study, which results in trajectory parameters such as staging conditions being the only variables relevant to the upper stage. Through the creation of a surrogate model, which takes staging conditions as inputs and predicts the payload mass delivered by the SLS upper stage to a reference orbit as the response, it is possible to identify a "surface" of staging conditions which all satisfy the SLS requirement of placing 130 metric tons into low-Earth orbit (LEO).3 This identified surface represents the 130 metric ton capability boundary for the upper stage, such that if the combined first stage and boosters can achieve any one staging point on that surface, then the design is identified as feasible. With the surrogate model created, design and analysis of advanced booster concepts is streamlined, as optimization of the upper stage trajectory is no longer required in every design loop.

Walsh, Ptrick↗

Gamma guidance schemes for flight in a windshear

This paper is concerned with guidance strategies for near-optimum performance in a windshear. The takeoff problem is considered with reference to flight in a vertical plane. In addition to the horizontal shear, the presence of a downdraft is assumed. A gamma guidance scheme, based on the absolute path inclination, is presented. This approach needs local information on the windshear and the downdraft. The gamma guidance scheme produces trajecories that preserve the basic properties of the optimal trajectories. The relation between the gamma guidance scheme and the acceleration guidance scheme is explored. In logic, these two guidance schemes are complementary to one another; in implementation, they yield almost identical results. Although local information on the windshear and the downdraft will be available in future aircraft, it might not be available on current aircraft. Hence, a simplified gamma guidance scheme (quick transition to horizontal flight) is presented which is useful for flight in severe windshears. The simplified gamma guidance scheme yields trajectories that are close to the optimal trajectories in severe windshears; in addition, it is easy to implement as a practical piloting technique.

Miele, A.↗

Optimizing Simulated Trajectories Of Rigid Bodies

6D POST is general-purpose, six-degree-of-freedom computer program for optimization of simulated trajectories of rigid bodies. Direct extension of three-degree-of-freedom POST program. 6D POST program models trajectory of powered or unpowered vehicle operating at or near rotating planet. Used to solve variety of performance, guidance, and flight-control problems for atmospheric and orbital vehicles. Written in FORTRAN 77 and FORTRAN V.

Brauer, Garry L.↗

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on- board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles. There are two previous studies that form the background to the current investigation. The first set looked in-depth at applying convex optimization to a powered descent trajectory on Mars with promising results.1, 2 This showed that the powered descent equations of motion can be relaxed and formed into a convex optimization problem and that the optimal solution of the relaxed problem is indeed a feasible solution to the original problem. This analysis used a constant gravity field. The second area applied a successive solution process to formulate a second order cone program that designs rendezvous and proximity operations trajectories.3, 4 These trajectories included a Newtonian gravity model. The equivalence of the solutions between the relaxed and the original problem is theoretically established. The proposed solution for designing the asteroid powered descent trajectory is to use convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process to design the fuel optimal trajectory. The solution to the convex optimization problem is the thrust profile, magnitude and direction, that will yield the minimum fuel trajectory for a soft landing at the target site, subject to various mission and operational constraints. The equations of motion are formulated in a rotating coordinate system and includes a high fidelity gravity model. The vehicle's thrust magnitude can vary between maximum and minimum bounds during the burn. Also, constraints are included to ensure that the vehicle does not run out of propellant, or go below the asteroid's surface, and any vehicle pointing requirements. The equations of motion are discretized and propagated with the trapezoidal rule in order to produce equality constraints for the optimization problem. These equality constraints allow the optimization algorithm to solve the entire problem, without including a propagator inside the optimization algorithm.

Pinson, Robin M.↗

Overview and Software Architecture of the Copernicus Trajectory Design and Optimization System

The Copernicus Trajectory Design and Optimization System represents an innovative and comprehensive approach to on-orbit mission design, trajectory analysis and optimization. Copernicus integrates state of the art algorithms in optimization, interactive visualization, spacecraft state propagation, and data input-output interfaces, allowing the analyst to design spacecraft missions to all possible Solar System destinations. All of these features are incorporated within a single architecture that can be used interactively via a comprehensive GUI interface, or passively via external interfaces that execute batch processes. This paper describes the Copernicus software architecture together with the challenges associated with its implementation. Additionally, future development and planned new capabilities are discussed. Key words: Copernicus, Spacecraft Trajectory Optimization Software.

Williams, Jacob↗

Conjugate gradient optimization programs for shuttle reentry

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

Powers, W. F.↗

A Multidisciplinary Performance Analysis of a Lifting-Body Single-Stage-to-Orbit Vehicle

Lockheed Martin Skunk Works (LMSW) is currently developing a single-stage-to-orbit reusable launch vehicle called VentureStar(TM) A team at NASA Langley Research Center participated with LMSW in the screening and evaluation of a number of early VentureStar(TM) configurations. The performance analyses that supported these initial studies were conducted to assess the effect of a lifting body shape, linear aerospike engine and metallic thermal protection system (TPS) on the weight and performance of the vehicle. These performance studies were performed in a multidisciplinary fashion that indirectly linked the trajectory optimization with weight estimation and aerothermal analysis tools. This approach was necessary to develop optimized ascent and entry trajectories that met all vehicle design constraints. Significant improvements in ascent performance were achieved when the vehicle flew a lifting trajectory and varied the engine mixture ratio during flight. Also, a considerable reduction in empty weight was possible by adjusting the total oxidizer-to-fuel and liftoff thrust-to-weight ratios. However, the optimal ascent flight profile had to be altered to ensure that the vehicle could be trimmed in pitch using only the flow diverting capability of the aerospike engine. Likewise, the optimal entry trajectory had to be tailored to meet TPS heating rate and transition constraints while satisfying a crossrange requirement.

Tartabini, Paul V.↗

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗

Trajectory Design Considerations for Exploration Mission 1

Exploration Mission 1 (EM-1) will be the first mission to send an uncrewed Orion Multi-Purpose Crew Vehicle (MPCV) to cislunar space in the fall of 2019. EM-1 was originally conceived as a lunar free-return mission, but was later changed to a Distant Retrograde Orbit (DRO) mission as a precursor to the Asteroid Redirect Mission. To understand the required mission performance (i.e., propellant requirement), a series of trajectory optimization runs was conducted using JSC's Copernicus spacecraft trajectory optimization tool. In order for the runs to be done in a timely manner, it was necessary to employ a parallelization approach on a computing cluster using a new trajectory scan tool written in Python. Details of the scan tool are provided and how it is used to perform the scans and post-process the results. Initially, a scan of daily due east launched EM-1 DRO missions in 2018 was made. Valid mission opportunities are ones that do not exceed the useable propellant available to perform the required burns. The initial scan data showed the propellant and delta-V performance patterns for each launch period. As questions were raised from different subsystems (e.g., power, thermal, communications, flight operations, etc.), the mission parameters or data that were of interest to them were added to the scan output data file. The additional data includes: (1) local launch and landing times in relation to sunrise and sunset, (2) length of eclipse periods during the in-space portion of the mission, (3) Earth line of sight from cislunar space, (4) Deep Space Network field of view looking towards cislunar space, and (5) variation of the downrange distance from Earth entry interface to splashdown. Mission design trades can also be performed based on the information that the additional data shows. For example, if the landing is in darkness, but the recovery operations team desires a landing in daylight, then an analysis is performed to determine how to change the mission design to meet this request. Also, subsystems request feasibility of alternate or contingency mission designs, such as adding an Orion main engine checkout burn or Orion completing all of its burns using only its auxiliary thrusters. This paper examines and presents the evolving trade studies that incorporate subsystem feedback and demonstrate the feasibility of these constrained mission trajectory designs and contingencies.

Dawn, Timothy F.↗

Applying optimization software libraries to engineering problems

Nonlinear programming, preliminary design problems, performance simulation problems trajectory optimization, flight computer optimization, and linear least squares problems are among the topics covered. The nonlinear programming applications encountered in a large aerospace company are a real challenge to those who provide mathematical software libraries and consultation services. Typical applications include preliminary design studies, data fitting and filtering, jet engine simulations, control system analysis, and trajectory optimization and optimal control. Problem sizes range from single-variable unconstrained minimization to constrained problems with highly nonlinear functions and hundreds of variables. Most of the applications can be posed as nonlinearly constrained minimization problems. Highly complex optimization problems with many variables were formulated in the early days of computing. At the time, many problems had to be reformulated or bypassed entirely, and solution methods often relied on problem-specific strategies. Problems with more than ten variables usually went unsolved.

Healy, M. J.↗

Reactive Collision Avoidance Algorithm

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

Scharf, Daniel↗

Ultrasail

Ultrasail is a complete sail system for the launch, deployment, stabilization and control of very large solar sails enabling reduced mission times for interplanetary and deep space spacecraft. Ultrasail is an innovative, non-traditional approach to propulsion technology achieved by combining propulsion and control systems developed for formation-flying microsatellites with an innovative solar sail architecture to achieve sq km-class controllable sail areas, sail subsystem area densities of 1 gm per sq m, and thrust levels equivalent to 400 kW ion thruster systems used for comparable deep space missions. Ultrasail can conceivably even achieve outer planetary rendezvous, a deep space capability now reserved for high-mass nuclear and chemical systems. Ultrasail is a Delta IV-launched multi-blade spin-stabilized system with blade lengths as long as 50 km, reminiscent of the MacNeal Heliogyro. The primary innovation is the near-elimination of sail supporting structures by attaching the sail tip to a rigid formation-flying microsatellite truss which deploys the sail blade, and which then articulates the blade to provide attitude control, including spin stabilization and precession of the spin axis. These tip microsatellites are controlled by a solar-powered 3-axis microthruster system (electric or cold gas) to maintain proper sail film tension during deployment and spin-up. The satellite mass also provides a stabilizing centrifugal force on the blade while in rotation. Understanding the dynamics of individual blades is key to the overall dynamics of Ultrasail. Forces and torques that must be modeled include those due to solar pressure, those generated by the microsatellite at the blade tip and by torques applied at the blade root. Centrifugal forces also play a significant role in the deployment and maintenance of the sail configuration. To capture the dynamics of the overall system, the equations of motion for the blades have been derived. Using these differential equations, a control law will be derived to maneuver Ultrasail. This law involves the pitching of the individual blades thereby moving the distribution of the radiation pressure on each individual blade and inducing a resultant torque on the system. The direction of the angular momentum vector and its rate of precession can be controlled through the pitch angle of the blades. The Ultrasail trajectory is also being studied. Optimal or near-optimal trajectories are being generated to showcase Ultrasail performance. Various missions, e.g. outer planet and solar polar missions for observation of the Sun, are currently being investigated to demonstrate the performance enhancements generated by Ultrasail technology. Calculus-of-variations-based optimization software is used to produce optimal Ultrasail trajectories. The performance of these trajectories is being compared to optimal results generated with other propulsion models, including chemical propulsion, ion propulsion, and competing solar sail concepts. Results of these studies will quantify the performance of Ultrasail compared to existing solar sail concepts for high energy missions.

Burton, R.↗

Acceleration, gamma, and theta guidance for abort landing in a windshear

This paper is concerned with the guidance of abort landing trajectories in a windshear. First, optimal trajectories are determined by minimizing the peak value of the altitude drop. Then, two guidance schemes, approximating the optimal trajectors, are developed: acceleration guidance (based on the relative acceleration) and gamma guidance (based on the absolute path inclination). From numerical experiments, it appears that both the acceleration guidance and the gamma guidance yield trajectories that are close to the optimal trajectory. In addition, a theta guidance scheme (modified constant pitch guidance) is developed that is superior to the constant pitch guidance in terms of the altitude loss and the survival capability in severe windshears.

Miele, A.↗

Creation of a Rapid High-Fidelity Aerodynamics Module for a Multidisciplinary Design Environment

In the traditional aerospace vehicle design process, each successive design phase is accompanied by an increment in the modeling fidelity of the disciplinary analyses being performed. This trend follows a corresponding shrinking of the design space as more and more design decisions are locked in. The correlated increase in knowledge about the design and decrease in design freedom occurs partly because increases in modeling fidelity are usually accompanied by significant increases in the computational expense of performing the analyses. When running high fidelity analyses, it is not usually feasible to explore a large number of variations, and so design space exploration is reserved for conceptual design, and higher fidelity analyses are run only once a specific point design has been selected to carry forward. The designs produced by this traditional process have been recognized as being limited by the uncertainty that is present early on due to the use of lower fidelity analyses. For example, uncertainty in aerodynamics predictions produces uncertainty in trajectory optimization, which can impact overall vehicle sizing. This effect can become more significant when trajectories are being shaped by active constraints. For example, if an optimal trajectory is running up against a normal load factor constraint, inaccuracies in the aerodynamic coefficient predictions can cause a feasible trajectory to be considered infeasible, or vice versa. For this reason, a trade must always be performed between the desired fidelity and the resources available. Apart from this trade between fidelity and computational expense, it is very desirable to use higher fidelity analyses earlier in the design process. A large body of work has been performed to this end, led by efforts in the area of surrogate modeling. In surrogate modeling, an up-front investment is made by running a high fidelity code over a Design of Experiments (DOE); once completed, the DOE data is used to create a surrogate model, which captures the relationships between input variables and responses into regression equations. Depending on the dimensionality of the problem and the fidelity of the code for which a surrogate model is being created, the initial DOE can itself be computationally prohibitive to run. Cokriging, a modeling approach from the field of geostatistics, provides a desirable compromise between computational expense and fidelity. To do this, cokriging leverages a large body of data generated by a low fidelity analysis, combines it with a smaller set of data from a higher fidelity analysis, and creates a kriging surrogate model with prediction fidelity approaching that of the higher fidelity analysis. When integrated into a multidisciplinary environment, a disciplinary analysis module employing cokriging can raise the analysis fidelity without drastically impacting the expense of design iterations. This is demonstrated through the creation of an aerodynamics analysis module in NASA’s OpenMDAO framework. Aerodynamic analyses including Missile DATCOM, APAS, and USM3D are leveraged to create high fidelity aerodynamics decks for parametric vehicle geometries, which are created in NASA’s Vehicle Sketch Pad (VSP). Several trade studies are performed to examine the achieved level of model fidelity, and the overall impact to vehicle design is quantified.

Aerodynamic Properties↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASA’s Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a good option for computing wind-optimal trajectories for national and global air traffic system studies.

Ng, Hok K.↗