The separation computation of arcs for optimal flight paths with state variable inequality constraints.
Maximum trajectory for glider entering earth atmosphere at supercircular velocity, subject to maximum altitude constraint
Bryson, A. E., Jr.↗
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.
Some applications of mathematical optimization to automatic landing systems
Algorithms applied to vertical trajectory control system
Kinnon, D. M.↗
VIPRE: A Tool Aiding the Design for Entry Probe Missions
Exploring planetary atmospheres uncovers important information for how our solar system formed and evolved. While remote sensing is extensively used, some crucial observations require in-situ measurements by an atmospheric probe. Given their scientific importance, probe missions to Saturn, Uranus and Neptune are considered for the coming decades. In anticipation of future probe missions, the software tool VIPRE was developed as proof-of-concept to facilitate selection of probe entry locations. Currently, there is no analytical way to identify which interplanetary trajectory from thousands of feasible launch opportunities is optimal for a considered mission concept. The search and decision process for that solution is complex and relies on the intuition of mission designers, who focus on a subset of trajectories to make the trade space manageable. The idea of VIPRE is to (1) generate a multi-dimensional data cube showing relevant engineering and science parameters simultaneously for thousands of trajectories, and (2) visualize the data for all entry sites over the body's envelope. VIPRE lays the foundation to make the data available for browsing in a 3-D visualization to identify the best family of solutions for a given mission. The paper introduces the validated and verified core algorithms of VIPRE, published on GitHub. VIPRE serves as a basic framework to be used and extended for different purposes. The paper presents the motivation for the development and algorithms. It explains the computation and data visualization strategy, and gives a list of suggested functionalities to extend and further develop VIPRE to fully leverage its potential.
Ice Giants↗
Lunar Browser trajectory tool
The Lunar Browser is a tool developed at NASA Ames Research Center for building, processing, and analyzing a database of lunar transfer trajectory solutions. Examples of intended uses include design trades for lunar missions and preliminary assessments of key parameters such as launch opportunities, delta-v and propulsion budgets, communication windows, eclipse durations, and lunar landing windows. The Lunar Browser tool is in the development phase and it is already producing results in its current form to address various NASA program requirements, proposals, and mission trajectories. The tool has also been used for research analysis in trajectory design, including a first publication regarding its application to the CLPS and Artemis programs. In particular, the results included transfers to lunar frozen orbits. Future work include the generation of more trajectories to expand the existing database and the optimization of the results.
Lunar Browser trajectory tool↗
A randomized sketching trust-region secant method for low-memory dynamic optimization
The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.
dynamic optimization↗
A Linear Analysis for the Flight Path Control of the Cassini Grand Finale Orbits
Cassini’s Grand Finale Mission begins after the last targeted Titan flyby on April 22, 2017 and ends with a series of 22 ballistic orbits each passing within a few thousand kilometers of the cloud tops of Saturn, ultimately impacting the planet on September 15, 2017. Despite the ballistic nature of the trajectory, the absence of targeted maneuvers throughout the final orbits causes position uncertainties to grow exponentially with time, posing a significant difficulty for the science sequence planning team. Thus, a strategy that incorporates trajectory correction maneuvers was developed to significantly reduce dispersions from the reference path and maintain dispersions below 250 km (1- ). In this paper, the linear method used to determine the optimal number and location of the maneuvers to control the trajectory, along with the corresponding targets, is detailed. A nonlinear Monte Carlo trajectory dispersion tool served as a testbed to validate the linear analysis results. Based on orbit determination covariance sampling with Monte Carlo simulations, the linear approach allowed the Cassini maneuver analysts to run thousands of maneuver combinations in little time, eventually finding an optimal strategy with three statistical maneuvers ( V99 < 1.5 m/s) to adequately control most of the trajectory.
Vaquero, Mar↗
An Optimal Initial Guess Generator for Entry Interface Targeters
If a pure numerical iterative approach is used, targeting entry interface (EI) conditions for nominal and abort return trajectories or for correction maneuvers can be computationally expensive. This paper describes an algorithm to obtain an optimal impulsive maneuver that generates a trajectory satisfying a set of EI targets: inequality constraints on longitude, latitude and azimuth and a fixed flight-path angle. Most of the calculations require no iterations, making it suitable for real-time applications or large trade studies. This algorithm has been used to generate initial guesses for abort trajectories during Earth-Moon transfers.
Senent, Juan S.↗
Optimal low-thrust takeoff from an orbit about an oblate planet
Future space missions to the outer planets may depend upon the use of low-thrust propulsion systems. As these planets are decidedly oblate, the question of the effect of that oblateness on a low-thrust trajectory is of some interest. In this paper the problem of optimal energy increase is attacked under the assumption that the coefficients for the second zonal harmonic, and the nondimensional thrust acceleration are the same order of magnitude. By means of a two-variable asymptotic expansion technique, a near optimal control program is generated and the first-order uniformly valid approximation for the corresponding trajectory is obtained. Tangential thrust is shown to be a good near-optimal thrust program even in the presence of oblateness effects. The optimal control program is found to be oscillatory and quite similar to the optimal control for energy increase in an inverse square gravitational field.
Jacobson, R. A.↗
Interplanetary Trajectory Design for the Asteroid Robotic Redirect Mission Alternate Approach Trade Study
This paper presents mission performance analysis methods and results for the Asteroid Robotic Redirect Mission (ARRM) option to capture a free standing boulder on the surface of a 100 m or larger NEA. It details the optimization and design of heliocentric low-thrust trajectories to asteroid targets for the ARRM solar electric propulsion spacecraft. Extensive searches were conducted to determine asteroid targets with large pick-up mass potential and potential observation opportunities. Interplanetary trajectory approximations were developed in method based tools for Itokawa, Bennu, 1999 JU3, and 2008 EV5 and were validated by end-to-end integrated trajectories.
Merrill, Raymond Gabriel↗
Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation
Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Divide and conquer: Learning chaotic dynamical systems with multistep penalty neural ordinary differential equations
Forecasting high-dimensional dynamical systems is a fundamental challenge in various fields, such as geosciences and engineering. Neural Ordinary Differential Equations (NODEs), which combine the power of neural networks and numerical solvers, have emerged as a promising algorithm for forecasting complex nonlinear dynamical systems. However, classical techniques used for NODE training are ineffective for learning chaotic dynamical systems. In this work, we propose a novel NODE-training approach that allows for robust learning of chaotic dynamical systems. Here, our method addresses the challenges of non-convexity and exploding gradients associated with underlying chaotic dynamics. Training data trajectories from such systems are split into multiple, non-overlapping time windows. In addition to the deviation from the training data, the optimization loss term further penalizes the discontinuities of the predicted trajectory between the time windows. The window size is selected based on the fastest Lyapunov time scale of the system. Multi-step penalty(MP) method is first demonstrated on Lorenz equation, to illustrate how it improves the loss landscape and thereby accelerates the optimization convergence. MP method can optimize chaotic systems in a manner similar to least-squares shadowing with significantly lower computational costs. Our proposed algorithm, denoted the Multistep Penalty NODE, is applied to chaotic systems such as the Kuramoto-Sivashinsky equation, the two-dimensional Kolmogorov flow, and ERA5 reanalysis data for the atmosphere. It is observed that MP-NODE provide viable performance for such chaotic systems, not only for short-term trajectory predictions but also for invariant statistics that are hallmarks of the chaotic nature of these dynamics.
Chaotic dynamical systems↗
POINT: Partially Observable Imitation Network for Traffic Signal Control
Smart traffic signals bring together transportation infrastructure and advance technologies to improve the mobility and efficiency of urban transportation network. Adaptive traffic signal control studies can be categorized into modeling-based approaches and learning-based approaches. In order to take advantages of these two systems, this study developed an offline-online combined Partial Observable Imitation Network for Traffic signal control (POINT). In the offline system, the traffic signal timing optimization problem was formulated as a Mixed Integer Nonlinear Programming (MINLP) given complete traffic information, i.e., second-by-second speeds and locations of all vehicles. Furthermore, the objective of MINLP is to minimize total travel delays considering individual vehicle trajectories under Connected Vehicle (CV) environment. The calculated optimal solutions under various traffic conditions were considered as the ”expert” decisions. In the online system, an imitation neural network model was developed to learn the ”expert” signal plans generated from offline system. Given partial observable traffic conditions in real time, e.g., the aggregate-level of traffic volume, the POINT model can compute the signal timing parameters in the online system. The numerical results demonstrated that the proposed method outperformed other state-of-the-art signal control method under high and unbalanced traffic demand levels in terms of reducing travel delays and queue length.
33 ADVANCED PROPULSION SYSTEMS↗
Mission-Maps For Outbound Cislunar Transfer Trajectories
This study quantifies the robustness and sensitivity of an outbound cislunar trajectory for a lunar lander in the form of mission-maps, or topological maps that allows either a computer program or mission designer to intuitively optimize the placement of critical outbound correction burns from the derived sensitivity data. The non-linear multi-body dynamics are applied to generate an outbound cislunar reference profile used by a linear covariance analysis (LinCov) tool to compute the expected Δv and trajectory dispersions due to the initial state uncertainty, sensor errors, maneuver execution errors, and disturbance accelerations along the outbound cislunar profile. The rapid performance analysis capabilities of LinCov are complimented with parallel processing techniques to evaluate hundreds and thousands of different translational burn locations, placements, and targeting constraints to identify the combination that minimizes the total Δv usage (nominal plus 3σ Δv) and trajectory dispersions at lunar orbit insertion. This study utilizes a generalized reference targeting algorithm to quickly assess the integrated closed-loop GN&C system performance due to different targeting configurations and constraints. The resulting mission maps provide an intuitive insight to ascertain each trajectory correction maneuver’s (TCM) sensitivity to different burn times along an outbound cislunar trajectory and quickly identify desirable engineering tradeoffs when performing analysis on the number and placement of these burns that nominally zero. Multiple mission maps are generated for a variety of different performance parameters that allow engineers to visually identify optimal solutions for trajectory correction maneuver placements, the number of correction burns, and the targeting constraints for each burn.
GN&C↗
Recursive Branching Simulated Annealing Algorithm
This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.
Bolcar, Matthew↗
Variational design principles for nonequilibrium colloidal assembly
Using large deviation theory and principles of stochastic optimal control, we show that rare molecular dynamics trajectories conditioned on assembling a specific target structure encode a set of interactions and external forces that lead to enhanced stability of that structure. Such a relationship can be formulated into a variational principle, for which we have developed an associated optimization algorithm and have used it to determine optimal forces for targeted self-assembly within nonequilibrium steady-states. We illustrate this perspective on inverse design in a model of colloidal cluster assembly within linear shear flow. We find that colloidal clusters can be assembled with high yield using specific short-range interactions of tunable complexity. Shear decreases the yields of rigid clusters, while small values of shear increase the yields of nonrigid clusters. The enhancement or suppression of the yield due to shear is rationalized with a generalized linear response theory. Furthermore, by studying 21 unique clusters made of six, seven, or eight particles, we uncover basic design principles for targeted assembly out of equilibrium.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Required toroidal confinement for fusion and omnigeneity
Deuterium–tritium (DT) burning requires a long energy confinement times compared to collision times, so the particle distribution functions must approximate local Maxwellians. Non-equilibrium thermodynamics is applicable, which gives relations among transport, entropy production, the collision frequency, and the deviation from a Maxwellian. The distribution functions are given by the Fokker–Planck equation, which is an advection–diffusion equation. A large hyperbolic operator, the Vlasov operator with the particle trajectories as its characteristics, equals a small diffusive operator, the collision operator. The collisionless particle trajectories would be chaotic in stellarators without careful optimization. This would lead to rapid entropy production and transport—far beyond what is consistent with a self-sustaining DT burn. Omnigeneity is the weakest general condition that is consistent with a sufficiently small entropy production associated with the thermal particle trajectories. Omnigeneity requires that the contours of constant magnetic field strength be unbounded in at least one of the two angular coordinates in magnetic surfaces and that there be a symmetry in the field-strength wells along the field lines. Even in omnigenous plasmas, fluctuations due to microturbulence can produce chaotic particle trajectories and the gyro-Bohm transport is seen in many stellarator and tokamak experiments. The higher the plasma temperature above 10 keV, the smaller the transport must be compared to gyro-Bohm for a self-sustaining DT burn. The hot alphas of DT fusion heat the electrons. When the ion–electron equilibration time is long compared to the ion energy confinement time, a self-sustaining DT burn is not possible, which sets a limit on the electron temperature.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Fitting local, low-dimensional parameterizations of optical turbulence modeled from optimal transport velocity vectors
This work exploits a connection between optimal transport theory and the physics of image propagation to yield a locally low-dimensional model of turbulence-corrupted imagery. Optimal transport produces an invertible, pixel-wise linear trajectories to approximate the globally nonlinear turbulence between a clean and turbulence corrupted image pair. We use the low-dimensional model to fit subsets of the optimal transport vector fields and stitch the local models into a surrogate for the global map to be used for image cleaning. Experiments are performed on laboratory generated data of beam propagation using different values of the Fried parameter (a scale measuring turbulence coherence) as well as a toy data set. The results suggest this is a fruitful direction, and first step, towards using multiple realizations of turbulence corrupted images to learn a blind surrogate for the optimal transport vector field for image cleaning.
47 OTHER INSTRUMENTATION↗
Integrated Propulsion/Vehicle System Structurally Optimized
Ongoing research and testing are essential in the development of air-breathing hypersonic propulsion technology, and this year some positive advancement was made at the NASA Glenn Research Center. Recent work performed for GTX, a rocket-based combined-cycle, single-stage-to-orbit concept, included structural assessments of both the engine and flight vehicle. In the development of air-breathing engine technology, it is impractical to design and optimize components apart from the fully integrated system because tradeoffs must be made between performance and structural capability. Efforts were made to control the flight trajectory, for example, to minimize the aerodynamic heating effects. Structural optimization was applied to evaluate concept feasibility and was instrumental in the determination of the gross liftoff weight of the integrated system. Achieving low Earth orbit with even a small payload requires an aggressive approach to weight minimization through the use of lightweight, oxidation-resistant composite materials. Assessing the integrated system involved investigating the flight trajectory to determine where the critical load events occur in flight and then generating the corresponding environment at each of these events. Structural evaluation requires the mapping of the critical flight loads to finite element models, including the combined effects of aerodynamic, inertial, combustion, and other loads. NASA s APAS code was used to generate aerodynamic pressure and temperature profiles at each critical event. The radiation equilibrium surface temperatures from APAS were used to predict temperatures through the thickness. Heat transfer solutions using NASA's MINIVER code and the SINDA code (Cullimore & Ring Technologies, Littleton, CO) were calculated at selective points external to the integrated vehicle system and then extrapolated over the entire exposed surface. FORTRAN codes were written to expedite the finite element mapping of the aerodynamic heating effects for the internal structure.
Hunter, James E.↗