An Infeasible Interior-Point Arc-Search Algorithm for Spacecraft Trajectory Optimization
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.
Approximation optimal trajectories - selection of estimation variables in least squares program, and computer program application
The class of hypersonic vehicle configurations with single stage-to-orbit (SSTO) capability reflect highly integrated airframe and propulsion systems. These designs are also known to exhibit a large degree of interaction between the airframe and engine dynamics. Consequently, even simplified hypersonic models are characterized by tightly coupled nonlinear equations of motion. In addition, hypersonic SSTO vehicles present a major system design challenge; the vehicle's overall mission performance is a function of its subsystem efficiencies including structural, aerodynamic, propulsive, and operational. Further, all subsystem efficiencies are interrelated, hence, independent optimization of the subsystems is not likely to lead to an optimum design. Thus, it is desired to know the effect of various subsystem efficiencies on overall mission performance. For the purposes of this analysis, mission performance will be measured in terms of the payload weight inserted into orbit. In this report, a trajectory optimization problem is formulated for a generic hypersonic lifting body for a specified orbit-injection mission. A solution method is outlined, and results are detailed for the generic vehicle, referred to as the baseline model. After evaluating the performance of the baseline model, a sensitivity study is presented to determine the effect of various subsystem efficiencies on mission performance. This consists of performing a parametric analysis of the basic design parameters, generating a matrix of configurations, and determining the mission performance of each configuration. Also, the performance loss due to constraining the total head load experienced by the vehicle is evaluated. The key results from this analysis include the formulation of the sizing problem for this vehicle class using trajectory optimization, characteristics of the optimal trajectories, and the subsystem design sensitivities.
Theory and application of the critical direction method of trajectory optimization
A trajectory-optimization process is described in which the optimum thrust equations are derived using the calculus of variations. The magnitude of the thrust is constrained within an upper and a lower bound, but the thrust direction is arbitrary. This formulation allows both the constant-thrust program and the variable-thrust program to be considered. For the constant-thrust program, certain propulsion-system parameters are optimized for maximum final vehicle mass. This theory has been used to study interplanetary missions to Venus and Mars using a power-limited propulsion system. Both one-way and round trip rendezvous trajectories are considered. The analysis employs a two-body inverse-square force-field model of three dimensions. An iterative routine used to solve the two-point boundary-value problem is described in the Appendix.
Trajectory optimization and linearized pitch computer program for Scout launch vehicle
Trajectory optimization by direct descent to minimum cost using iterative computer solutions
Trajectory optimization by descent process using hybrid computer for direct cost gradient computation
Generalized indirect method solving two-point boundary value problems for rapid optimal trajectory computation
The two methods which are suitable for use in a 4-body trajectory optimization program are both multiconic methods. They include an approach due to Wilson (1970) and to Byrnes and Hooper (1970) and a procedure developed by Stumpff and Weiss (1968). The various steps in a trajectory optimization program are discussed, giving attention to variable step integration, the correction of errors by quadrature formulas, questions of two-impulse transfer, three-impulse transfer, and two examples which illustrate the implementation of the computational approaches.
This paper summarizes various applications of trajectory optimization principles that have been or are being devised by both government and industrial researchers to minimize aircraft direct operating costs (DOC). These costs (time and fuel) are computed for aircraft constrained to fly over a fixed range. Optimization theory is briefly outlined, and specific algorithms which have resulted from application of this theory are described. Typical results which demonstrate use of these algorithms and the potential savings which they can produce are given. Finally, need for further trajectory optimization research is presented.
Algorithms construction for aerospace vehicle trajectory optimization, considering quasi- linearization method for computation of variable time optimum trajectories
In this work, a multi-disciplinary toolchain is described and used to optimize the takeoff trajectory of a electrified general aviation aircraft, subjected to acoustic constraints. The Dymos multi-disciplinary optimal control library is used to optimize the trajectory, with propeller aerodynamic and acoustic models provided by blade element momentum theory (CCBlade.jl) and acoustic analogy (AcousticAnalogies.jl) codes, respectively. Each model is implemented in the OpenMDAO framework, with all derivatives calculated either analytically or via automatic differentiation tools. The toolchain is applied to a hypothetical electrified form of the Cirrus SR20 and compared to the conventional piston-driven form.
In this work, a multi-disciplinary toolchain is described and used to optimize the takeoff trajectory of a electrified general aviation aircraft, subjected to acoustic constraints. The Dymos multi-disciplinary optimal control library is used to optimize the trajectory, with propeller aerodynamic and acoustic models provided by blade element momentum theory (CCBlade.jl) and acoustic analogy (AcousticAnalogies.jl) codes, respectively. Each model is implemented in the OpenMDAO framework, with all derivatives calculated either analytically or via automatic differentiation tools. The toolchain is applied to a hypothetical electrified form of the Cirrus SR20 and compared to the conventional piston-driven form.
We present robust trajectory optimization techniques using a sweeping gradient method for ordinary differential equations with events (SGM) and linear covariance analysis (LinCov). SGM is a method for computing the gradient of trajectory analyses defined by performance indices over initial value problems with events with respect to static parameters. LinCov is an analytic technique for predicting stochastic behavior of dynamical systems. By combining SGM and LinCov, it is possible use efficient, off-the-shelf, gradient-based optimizers to solve robust optimal trajectory design problems. We describe the individual methods and some details on how they can be combined. Then we apply the combined techniques to a variety of orbital trajectory design problems to demonstrate its use, including minimum fuel transfer and mid-course correction burn scheduling.
Steepest ascent method for trajectory optimization based on minimum time and maximum velocity of fuel flow rate
One of the most effective first-order algorithms for solving trajectory optimization problems is the sequential gradient-restoration algorithm (SGRA). Originally developed in the primal formulation, this algorithm is extended to incorporate a dual formulation. Both the primal formulation and the dual formulation involve a sequence of two-phase cycles, each cycle including a gradient phase and a restoration phase. In turn, each iteration of the gradient phase and the restoration phase requires the solution of an auxiliary minimization problem (AMP). In the primal formulation, the AMP is solved with respect to the variations of the state, the control, and the parameter. In the dual formulation, the AMP is solved with respect to the Lagrange multipliers. A characteristic of the dual formulation is that the AMPs associated with the gradient phase and the restoration phase of SGRA can be reduced to mathematical programming problems involving a finite number of parameters as unknowns. A comparison of the primal formulation and the dual formulation is presented. The comparison is done in terms of several trajectory optimization problems having current aerospace interest.