Optimal low thrust escape viewed as a resonance phenomenon
Second order perturbation solution to modified optimal low thrust escape problem
Jacobson, R. A.↗
SEARCH · Search NASA
Results for “solution 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.
Closed-form solutions for linear regulator-design of mechanical systems including optimal weighting matrix selection
This paper addresses the restriction of Linear Quadratic Regulator (LQR) solutions to the algebraic Riccati Equation to design spaces which can be implemented as passive structural members and/or dampers. A general closed-form solution to the optimal free-decay control problem is presented which is tailored for structural-mechanical systems. The solution includes, as subsets, special cases such as the Rayleigh Dissipation Function and total energy. Weighting matrix selection is a constrained choice among several parameters to obtain desired physical relationships. The closed-form solution is also applicable to active control design for systems where perfect, collocated actuator-sensor pairs exist. Some examples of simple spring mass systems are shown to illustrate key points.
Hanks, Brantley R.↗
Equuleus Launch Window Analysis and Mission Design
This paper presents the trajectory design process for EQUULEUS, a 6U CubeSat developed by JAXA and the University of Tokyo that is scheduled to launch as a piggyback of NASA’s Artemis 1. After separation from the upper stage of the Space Launch System, EQUULEUS will maneuver along a low-energy transfer to an Earth–Moon quasi-rectilinear halo orbit in 1-to-4 resonance with the lunar synodic period. As a secondary payload, the trajectory of EQUULEUS needs to be compatible with the requirements of the primary mission, but also robust against disturbances and potential changes in the deployment state. Realistic initial conditions spanning two years of potential launch windows are processed and the solution structure for optimal lunar transfers is analyzed. A host of candidate solutions is presented, compatibly with the fuel and power limitations of EQUULEUS. The global understanding of the solution space is shown to be insightful for the design of robust trajectories for limited control-authority spacecraft.
Kawakatsu, Yasuhiro↗
Accelerated procedures for the solution of discret e Markov control problems
Accelerated procedures for Markov chain model optimal control problems solution with computation time advantage over usual dynamic programming
Kleinman, A. J.↗
Synthesis of Optimal Nonlinear Feedback Laws for Dynamic Systems Using Neural Networks
Open-loop solutions of dynamical optimization problems can be numerically computed usingexisting software packages. The computed time histories of the state and control variables, formultiple sets of end conditions can then be used to train a neural network to 'recognize' the optimal,nonlinear feedback relation between the states and controls of the system. The 'learned' network canthen be used to output an approximate optimal control given a full set (or a partial set) of measuredsystem states. With simple neural networks, we have successfully demonstrated the efficacy of theproposed approach using a minimum-time orbit injection problem. The usefulness and limitations ofthis novel approach on real-life optimal guidance and control problems, with many state and control variables as well as path inequality constraints, remain to be seen.
Orbit injection problem↗
Numerical methods for the solution of the degenerate non-linear elliptic equations arising in optimal stochastic control theory.
Iterative method for optimal control problems for Markov chains, discussing degenerate nonlinear elliptic equations solution in optimal stochastic control theory
Kleinman, A.↗
Euler procedure for three-dimensional transonic wall interference
Based on an optimization formulation, a procedure has been developed to evaluate Mach number and angle-of-attack corrections. The Euler equations are assumed to be the flow governing equations. To obtain efficient solutions for the optimization problem, the iterative solutions for the flow variables and the design parameters are simultaneously updated. In addition to the model lift and geometry, the procedure requires pressure measurements near the tunnel walls. The tunnel boundary conditions are based on the introduction of Reimann invariants for a one-dimensional flow normal to the boundary. Computations are performed to verify that the errors introduced by this approximate boundary-condition formulation are acceptably small. The correction scheme is applied to an aircraft configuration in an open jet. The results indicate that the optimization scheme is highly efficient with the rate of convergence of the flow solution nearly equal to the corresponding rate of a regular analysis problem.
Rizk, Magdi H.↗
An explicit solution to the exoatmospheric powered flight guidance and trajectory optimization problem for rocket propelled vehicles
A derivation of an explicit solution to the two point boundary-value problem of exoatmospheric guidance and trajectory optimization is presented. Fixed initial conditions and continuous burn, multistage thrusting are assumed. Any number of end conditions from one to six (throttling is required in the case of six) can be satisfied in an explicit and practically optimal manner. The explicit equations converge for off nominal conditions such as engine failure, abort, target switch, etc. The self starting, predictor/corrector solution involves no Newton-Rhapson iterations, numerical integration, or first guess values, and converges rapidly if physically possible. A form of this algorithm has been chosen for onboard guidance, as well as real time and preflight ground targeting and trajectory shaping for the NASA Space Shuttle Program.
Jaggers, R. F.↗
A procedure based on the Euler equations for correcting transonic wind tunnel wall interference
Based on an optimization formulation, a procedure has been developed to evaluate Mach number and angle-of-attack corrections. The Euler equations are assumed to be the flow governing equations. To obtain efficient solutions for the optimization problem, the iterative solutions for the flow variables and the design parameters are simultaneously updated. In addition to the model lift and geometry, the procedure requires pressure measurements near the tunnel walls. The accuracy and efficiency of several optimization techniques are investigated. The effect of perturbing certain test conditions on the residual interference is investigated.
Rizk, Magdi H.↗
Fuel optimal maneuvers for spacecraft with fixed thrusters
Several mathematical models, including a minimum integral square criterion problem, were used for the qualitative investigation of fuel optimal maneuvers for spacecraft with fixed thrusters. The solutions consist of intervals of "full thrust" and "coast" indicating that thrusters do not need to be designed as "throttleable" for fuel optimal performance. For the primary model considered, singular solutions occur only if the optimal solution is "pure translation". "Time optimal" singular solutions can be found which consist of intervals of "coast" and "full thrust". The shape of the optimal fuel consumption curve as a function of flight time was found to depend on whether or not the initial state is in the region admitting singular solutions. Comparisons of fuel optimal maneuvers in deep space with those relative to a point in circular orbit indicate that qualitative differences in the solutions can occur. Computation of fuel consumption for certain "pure translation" cases indicates that considerable savings in fuel can result from the fuel optimal maneuvers.
Carter, T. C.↗
Advanced Method Optimization with Categorical and Constrained Continuous Parameters
Traditional approaches to analytical method optimization (e.g., univariate and “guess-and-check”) can be time-consuming, costly, and often fail to identify true optima within the parameter space. Previous work defined and implemented a generalized technique for method optimization for continuous method parameters, but a knowledge gap remains for the incorporation of categorical variables into these advanced method optimization schemes. This work presents and validates a generalized optimization approach that incorporates both continuous and categorical variables while also utilizing a multivariate, multiobjective optimization scheme with Karush–Kuhn–Tucker conditions to bound the optimization space to solutions within the physical limitations of the parameter space. Method optimization from a case study using GC–MS for the analysis of 11 analytical standards with objectives to minimize peak width and maximize peak height resulted in a 3 orders of magnitude improvement in the average peak height and a 2 orders of magnitude improvement in the average peak width compared to the least optimal (but reasonable) instrumental parameters utilized in this study. This approach to optimization allows for a customizable method optimization in which users can include both continuous and categorical variables to achieve objectives specific to their analytical goals. This approach significantly reduces the labor and cost associated with traditional method development approaches and can be applied in a variety of scientific fields across a range of laboratory techniques (e.g., instrument method development, sample preparation, and extraction techniques).
Amorphous materials↗
A summary report on system effectiveness and optimization study
Report treats optimization and effectiveness separately. Report illustrates example of dynamic programming solution to system optimization. Computer algorithm has been developed to solve effectiveness problem and is included in report.
Williamson, O. L.↗
Tractable Pareto Optimization of Temporal Preferences
This paper focuses on temporal constraint problems where the objective is to optimize a set of local preferences for when events occur. In previous work, a subclass of these problems has been formalized as a generalization of Temporal CSPs, and a tractable strategy for optimization has been proposed, where global optimality is defined as maximizing the minimum of the component preference values. This criterion for optimality, which we call 'Weakest Link Optimization' (WLO), is known to have limited practical usefulness because solutions are compared only on the basis of their worst value; thus, there is no requirement to improve the other values. To address this limitation, we introduce a new algorithm that re-applies WLO iteratively in a way that leads to improvement of all the values. We show the value of this strategy by proving that, with suitable preference functions, the resulting solutions are Pareto Optimal.
Morris, Robert↗
Massively Parallel Dantzig-Wolfe Decomposition Applied to Traffic Flow Scheduling
Optimal scheduling of air traffic over the entire National Airspace System is a computationally difficult task. To speed computation, Dantzig-Wolfe decomposition is applied to a known linear integer programming approach for assigning delays to flights. The optimization model is proven to have the block-angular structure necessary for Dantzig-Wolfe decomposition. The subproblems for this decomposition are solved in parallel via independent computation threads. Experimental evidence suggests that as the number of subproblems/threads increases (and their respective sizes decrease), the solution quality, convergence, and runtime improve. A demonstration of this is provided by using one flight per subproblem, which is the finest possible decomposition. This results in thousands of subproblems and associated computation threads. This massively parallel approach is compared to one with few threads and to standard (non-decomposed) approaches in terms of solution quality and runtime. Since this method generally provides a non-integral (relaxed) solution to the original optimization problem, two heuristics are developed to generate an integral solution. Dantzig-Wolfe followed by these heuristics can provide a near-optimal (sometimes optimal) solution to the original problem hundreds of times faster than standard (non-decomposed) approaches. In addition, when massive decomposition is employed, the solution is shown to be more likely integral, which obviates the need for an integerization step. These results indicate that nationwide, real-time, high fidelity, optimal traffic flow scheduling is achievable for (at least) 3 hour planning horizons.
Rios, Joseph Lucio↗
Comparison of Real-Time Pressure Rail Selection Algorithms for the Hybrid Hydraulic Electric Architecture: Case Study on a Track Loader
Abstract The hybrid hydraulic electric architecture (HHEA) seeks to combine the high power/torque/force density of hydraulics with the efficiency of electric machines. A set of common pressure rails is used to provide a majority of the power and this power is modulated by small electric machines to provide precise control for the operator. The HHEA has been studied in previous work using off-line dynamic programming optimization to determine energy efficient pressure rail selections, but this approach requires drive cycle information apriori. A Lagrange multiplier method has also been investigated where a set of gains (Lagrange multipliers) are optimized off-line with the idea the these gains, once determined, could be used for real-time operation. In this work, three new real-time pressure rail selection algorithms that do not require future drive cycle information are investigated; greedy, torque minimizing, and thresholding. The greedy control is found to only use 1% more energy than the globally optimal dynamic programming solution; but a model of energy loss is required.
24 POWER TRANSMISSION AND DISTRIBUTION↗
FRANOPP: Framework for analysis and optimization problems user's guide
Framework for analysis and optimization problems (FRANOPP) is a software aid for the study and solution of design (optimization) problems which provides the driving program and plotting capability for a user generated programming system. In addition to FRANOPP, the programming system also contains the optimization code CONMIN, and two user supplied codes, one for analysis and one for output. With FRANOPP the user is provided with five options for studying a design problem. Three of the options utilize the plot capability and present an indepth study of the design problem. The study can be focused on a history of the optimization process or on the interaction of variables within the design problem.
Riley, K. M.↗
On domains of convergence in optimization problems
Numerical optimization algorithms require the knowledge of an initial set of design variables. Starting from an initial design x(sup 0), improved solutions are obtained by updating the design iteratively in a way prescribed by the particular algorithm used. If the algorithm is successful, convergence is achieved to a local optimal solution. Let A denote the iterative procedure that characterizes a typical optimization algorithm, applied to the problem: Find x belonging to R(sup n) that maximizes f(x) subject to x belonging to Omega contained in R(sup n). We are interested in problems with several local maxima (x(sub j))(sup *), j=1, ..., m, in the feasible design space Omega. In general, convergence of the algorithm A to a specific solution (x(sub j))(sup *) is determined by the choice of initial design x(sup 0). The domain of convergence D(sub j) of A associated with a local maximum (x(sub j))(sup *) is a subset of initial designs x(sup 0) in Omega such that the sequence (x(sup k)), k=0,1,2,... defined by x(sup k+1) = A(x(sup k)), k=0,1,... converges to (x(sub j))(sup *). The set D(sub j) is also called the basin of attraction of (x(sub j))(sup *). Cayley first proposed the problem of finding the basin of attraction for Newton's method in 1897. It has been shown that the basin of attraction for Newton's method exhibits chaotic behavior in problems with polynomial objective. This implies that there may be regions in the feasible design space where arbitrarily close starting points will converge to different local optimal solutions. Furthermore, the boundaries of the domains of convergence may have a very complex, even fractal structure. In this paper we show that even simple structural optimization problems solved using standard gradient based (first order) algorithms exhibit similar features.
Diaz, Alejandro R.↗
Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras
The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗