Near optimal shuttle trajectories using accelerated gradient methods
Optimal ascent trajectories for delta wing space shuttle flight, using accelerated gradient methods
Johnson, I. L.↗
SEARCH · Search NASA
Results for “Gradient ascent 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.
Hamiltonian switching control of noisy bipartite qubit systems
Abstract We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the quantum approximate optimization algorithm, to mitigate environmental noise on qubits. We demonstrate the control for a central spin coupled to bath spins via isotropic Heisenberg interactions, and then make physical applications to the protection of quantum gates performed on superconducting transmon qubits coupling to environmental two-level-systems (TLSs) through dipole-dipole interactions, as well as on such qubits coupled to both TLSs and a Lindblad bath. The control field is classical and acts only on the system qubits. We use reinforcement learning with policy gradient to optimize the Hamiltonian switching control protocols, using a fidelity objective for specific target quantum gates. We use this approach to demonstrate effective suppression of both coherent and dissipative noise, with numerical studies achieving target gate implementations with fidelities over 0.9999 (four nines) in the majority of our test cases and showing improvement beyond this to values of 0.999 999 999 (nine nines) upon a subsequent optimization by GRadient Ascent Pulse Engineering (GRAPE). We analyze how the control depth, total evolution time, number of environmental TLS, and choice of optimization method affect the fidelity achieved by the optimal protocols and reveal some critical behaviors of bipartite control of quantum gates.
Physics↗
TRAVOLTA: GPU acceleration and algorithmic improvements for constructing quantum optimal control fields in photo-excited systems
Not Available
97 MATHEMATICS AND COMPUTING↗
VAN-DAMME: GPU-accelerated and symmetry-assisted quantum optimal control of multi-qubit systems
We present an open-source software package, VAN-DAMME (Versatile Approaches to Numerically Design, Accelerate, and Manipulate Magnetic Excitations), for massively-parallelized quantum optimal control (QOC) calculations of multi-qubit systems. To enable large QOC calculations, the VAN-DAMME software package utilizes symmetry-based techniques with custom GPU-enhanced algorithms. This combined approach allows for the simultaneous computation of hundreds of matrix exponential propagators that efficiently leverage the intra-GPU parallelism found in high-performance GPUs. In addition, to maximize the computational efficiency of the VAN-DAMME code, we carried out several extensive tests on data layout, computational complexity, memory requirements, and performance. These extensive analyses allowed us to develop computationally efficient approaches for evaluating complex-valued matrix exponential propagators based on Padé approximants. To assess the computational performance of our GPU-accelerated VAN-DAMME code, we carried out QOC calculations of systems containing 10 - 15 qubits, which showed that our GPU implementation is 18.4× faster than the corresponding CPU implementation. Our GPU-accelerated enhancements allow efficient calculations of multi-qubit systems, which can be used for the efficient implementation of QOC applications across multiple domains.
97 MATHEMATICS AND COMPUTING↗
Optimal control of large quantum systems: assessing memory and runtime performance of GRAPE
Abstract Gradient Ascent Pulse Engineering (GRAPE) is a popular technique in quantum optimal control, and can be combined with automatic differentiation (AD) to facilitate on-the-fly evaluation of cost-function gradients. We illustrate that the convenience of AD comes at a significant memory cost due to the cumulative storage of a large number of states and propagators. For quantum systems of increasing Hilbert space size, this imposes a significant bottleneck. We revisit the strategy of hard-coding gradients in a scheme that fully avoids propagator storage and significantly reduces memory requirements. Separately, we present improvements to numerical state propagation to enhance runtime performance. We benchmark runtime and memory usage and compare this approach to AD-based implementations, with a focus on pushing towards larger Hilbert space sizes. The results confirm that the AD-free approach facilitates the application of optimal control for large quantum systems which would otherwise be difficult to tackle.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Constrained optimal ascent-flyback shuttle trajectories.
An optimal Space Shuttle ascent-flyback trajectory shaping capability is presented which is based on the accelerated gradient parameter optimization technique. A typical atmospheric flight branched optimization problem is analyzed which required the determination of 31 parameters. This parameter set includes the description of the vehicle attitude control angles for three branches of Shuttle flight: first stage ascent, second stage ascent, and first stage flyback. The important in-flight inequality constraints required to maintain the integrity of the vehicle are considered. Results indicate that for a launch into a 55 deg inclined ellipse, a 13% increase in payload can be realized by using optimal control in the first-stage ascent rather than the conventional gravity-turn steering.
Kamm, J. L.↗
A nonlinear programming approach for optimizing two-stage lifting vehicle ascent to orbit
An optimal atmospheric flight branched trajectory-shaping capability is presented based on the Davidon-Fletcher-Powell variable metric parameter optimization technique. Gradient information is generated using finite difference methods. A typical atmospheric flight branched optimization problem is analyzed which requires the determination of 31 parameters. This parameter set includes the three-dimensional description of vehicle attitude control angles for three branches of flight: first-stage ascent, second-stage ascent, and first-stage flyback. The important inflight inequality contraints required to maintain the integrity of the vehicles are considered. Some of the numerical methods employed are discussed, along with several new auxiliary techniques developed to improve the compatibility of the numerical gradient and iterator.
Kamm, J. L.↗
Supercharging simulation-based inference for Bayesian optimal experimental design
Abstract Bayesian optimal experimental design (BOED) seeks to maximize the expected information gain (EIG) of experiments. This requires a likelihood estimate, which in many settings is intractable. Simulation-based inference (SBI) provides powerful tools for this regime. However, existing work explicitly connecting SBI and BOED is restricted to a single contrastive EIG bound. We show that the EIG admits multiple formulations which can directly leverage modern SBI density estimators, encompassing neural posterior, likelihood, and ratio estimation. Building on this perspective, we define a novel EIG estimator using neural likelihood estimation. Further, we identify optimization as a key bottleneck of gradient based EIG maximization and show that a simple multi-start parallel gradient ascent procedure can substantially improve reliability and performance. With these innovations, our SBI-based BOED methods are able to match or outperform by up to 22% existing state-of-the-art approaches across standard BOED benchmarks.
97 MATHEMATICS AND COMPUTING↗
Rocket ascent G-limited moment-balanced optimization program (RAGMOP)
This document describes the RAGMOP (Rocket Ascent G-limited Momentbalanced Optimization Program) computer program for parametric ascent trajectory optimization. RAGMOP computes optimum polynomial-form attitude control histories, launch azimuth, engine burn-time, and gross liftoff weight for space shuttle type vehicles using a search-accelerated, gradient projection parameter optimization technique. The trajectory model available in RAGMOP includes a rotating oblate earth model, the option of input wind tables, discrete and/or continuous throttling for the purposes of limiting the thrust acceleration and/or the maximum dynamic pressure, limitation of the structural load indicators (the product of dynamic pressure with angle-of-attack and sideslip angle), and a wide selection of intermediate and terminal equality constraints.
Lyons, J. T.↗
Traj_opt User's Guide
Trajectory optimization program Traj_opt was developed at Ames Research Center to help assess the potential benefits of ultrahigh temperature ceramic materials applied to reusable space vehicles with sharp noses and wing leading edges. Traj_opt loosely couples the Ames three-degrees-of-freedom trajectory package Traj (see NASA-TM-2004-212847) with the SNOPT optimization package (Stanford University Technical Report SOL 98-1). Traj_opt version January 22, 2003 is covered by this user guide. The program has been applied extensively to entry and ascent abort trajectory calculations for sharp and blunt crew transfer vehicles. The main optimization variables are control points for the angle of attack and bank angle time histories. No propulsion options are provided, but numerous objective functions may be specified and the nonlinear constraints implemented include a distributed surface heating constraint capability. Aero-capture calculations are also treated with an option to minimize orbital eccentricity at apoapsis. Traj_opt runs efficiently on a single processor, using forward or central differences for the gradient calculations. Results may be displayed conveniently with Gnuplot scripts. Control files recommended for five standard reentry and ascent abort trajectories are included along with detailed descriptions of the inputs and outputs.
Saunders, David A.↗
A two-level trajectory decomposition algorithm featuring optimal intermediate target selection
A decomposition algorithm is presented that optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.
Petersen, F. M.↗
A two-level trajectory decomposition algorithm featuring optimal intermediate target selection
A decomposition algorithm is presented which optimizes complex missions by partitioning the trajectory into natural segments such as ascent or entry. Each segment defines a full-rank targeting subproblem. These are solved sequentially using the Newton-Raphson algorithm. The master problem, representing the complete mission, is to determine subproblem targets and master-problem controls that optimize the mission objective subject to intersegment constraints. The gradient projection algorithm solves this problem using derivatives obtained analytically from finite-difference subproblem sensitivities. Thus, the mission is optimized by coordinating the solution of tractible subproblems. Computational results for a synchronous equatorial mission are included.
Petersen, F. M.↗
Transformation techniques for minimax optimal control problems and their application to optimal flight trajectories in a windshear - Optimal abort landing trajectories
The optimal-control problem of abort-landing trajectories in the presence of low-altitude wind shear is investigated analytically. The vertical-plane Newtonian motion of a point-mass aircraft in a steady wind field is modeled, and a sequential gradient-restoration algorithm is applied. Numerical results showing the effects of wind-shear intensity, initial altitude, and power-setting rate are presented in extensive graphs and discussed in detail. Optimal trajectories for strong or severe wind shears are found to begin with a descent, followed by level flight and then an ascent after leaving the shear region.
Miele, A.↗
An adaptive guidance law for single stage to low earth orbit
An adaptive guidance algorithm based on a cubic spline representation of the ascent profile and imposition of a dynamic pressure constraint is studied for a single stage to low earth orbit. The flight path is divided into initial and terminal phases. In the initial phase, fully adaptive, and in the terminal phase, semi-adaptive, guidance schemes are used. The cubic spline paqrameters are determined by gradient optimization for maximum payload to orbit. In the terminal phase, a linear quadratic regulator is used to derive the optimal feedback gains to keep the vehicle close to the nominal path. The computational aspects of the guidance algorithm are examined and criteria are developed to ensure stability and convergence.
Pamadi, Bandu N.↗
Comparison of a discrete steepest ascent method with the continuous steepest ascent method for optimal programing
A discrete steepest ascent method which allows controls which are not piecewise constant (for example, it allows all continuous piecewise linear controls) was derived for the solution of optimal programming problems. This method is based on the continuous steepest ascent method of Bryson and Denham and new concepts introduced by Kelley and Denham in their development of compatible adjoints for taking into account the effects of numerical integration. The method is a generalization of the algorithm suggested by Canon, Cullum, and Polak with the details of the gradient computation given. The discrete method was compared with the continuous method for an aerodynamics problem for which an analytic solution is given by Pontryagin's maximum principle, and numerical results are presented. The discrete method converges more rapidly than the continuous method at first, but then for some undetermined reason, loses its exponential convergence rate. A comparsion was also made for the algorithm of Canon, Cullum, and Polak using piecewise constant controls. This algorithm is very competitive with the continuous algorithm.
Childs, A. G.↗
The numerical evaluation of maximum-likelihood estimates of the parameters for a mixture of normal distributions from partially identified samples
Likelihood equations determined by the two types of samples which are necessary conditions for a maximum-likelihood estimate are considered. These equations, suggest certain successive-approximations iterative procedures for obtaining maximum-likelihood estimates. These are generalized steepest ascent (deflected gradient) procedures. It is shown that, with probability 1 as N sub 0 approaches infinity (regardless of the relative sizes of N sub 0 and N sub 1, i=1,...,m), these procedures converge locally to the strongly consistent maximum-likelihood estimates whenever the step size is between 0 and 2. Furthermore, the value of the step size which yields optimal local convergence rates is bounded from below by a number which always lies between 1 and 2.
Walker, H. F.↗
An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions, 2
The problem of obtaining numerically maximum likelihood estimates of the parameters for a mixture of normal distributions is addressed. In recent literature, a certain successive approximations procedure, based on the likelihood equations, is shown empirically to be effective in numerically approximating such maximum-likelihood estimates; however, the reliability of this procedure was not established theoretically. Here, a general iterative procedure is introduced, of the generalized steepest-ascent (deflected-gradient) type, which is just the procedure known in the literature when the step-size is taken to be 1. With probability 1 as the sample size grows large, it is shown that this procedure converges locally to the strongly consistent maximum-likelihood estimate whenever the step-size lies between 0 and 2. The step-size which yields optimal local convergence rates for large samples is determined in a sense by the separation of the component normal densities and is bounded below by a number between 1 and 2.
Peters, B. C., Jr.↗
An iterative procedure for obtaining maximum-likelihood estimates of the parameters for a mixture of normal distributions
This paper addresses the problem of obtaining numerically maximum-likelihood estimates of the parameters for a mixture of normal distributions. In recent literature, a certain successive-approximations procedure, based on the likelihood equations, was shown empirically to be effective in numerically approximating such maximum-likelihood estimates; however, the reliability of this procedure was not established theoretically. Here, we introduce a general iterative procedure, of the generalized steepest-ascent (deflected-gradient) type, which is just the procedure known in the literature when the step-size is taken to be 1. We show that, with probability 1 as the sample size grows large, this procedure converges locally to the strongly consistent maximum-likelihood estimate whenever the step-size lies between 0 and 2. We also show that the step-size which yields optimal local convergence rates for large samples is determined in a sense by the 'separation' of the component normal densities and is bounded below by a number between 1 and 2.
Peters, B. C., Jr.↗