Special orbits for the exploration of Mars and Venus
Planetary exploration optimization problems using swing-by trajectories and capture orbits
CAPTURE EFFECT↗
SEARCH · Search NASA
Results for “optimization problems”
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.
Constrained optimization using design of experiment surfaces
An algorithm for solving constrained optimization problems is presented. First, design of experiment techniques are used to survey the design space. After evaluating the objective and constraint functions, as specified by Taguchi orthogonal arrays, analytical models of these functions are generated using a least-squares regression analysis. Next, a nonlinear programming package is used to optimize the analytical model. Based on the optimization information, the design space is reduced so as to close in around the minimum, and the entire procedure is repeated until convergence. An important feature of the algorithm is that function gradients are not required; therefore, for problems in which gradients would have to be estimated using finite-differences the number of function evaluations required for the optimization is significantly reduced, when compared with traditional nonlinear programming techniques. In addition, there is no requirement that the gradients must be smooth and continuous.
Bolt, Marvin Vance↗
Learning to Branch with Interpretable Machine Learning Models
This presentation describes an algorithm for applying machine learning to branching to speed up the solution of integer optimization problems. These problems are challenging and solved multiple times a day by power systems operators. We show that our approach speeds up a widely used open-source optimization solver.
Bayramoglu, Selin↗
Constant directions of the Riccati equation
A constant direction of the Riccati equation associated with a class of singular discrete-time optimization problems is defined. The set of constant directions is completely characterized using a control viewpoint. Constant directions are used to reduce the computational complexity of the optimal system. Application to optimal filtering in colored noise is given.
Rappaport, D.↗
Problem solving with genetic algorithms and Splicer
Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.
Bayer, Steven E.↗
Retrieving Storm Electric Fields From Aircraft Field Mill Data. Part I: Theory
It is shown that the problem of retrieving storm electric fields from an aircraft instrumented with several electric field mill sensors can be expressed in terms of a standard Lagrange multiplier optimization problem. The method naturally removes aircraft charge from the retrieval process without having to use a high voltage stinger and linearly combined mill data values. It also allows a variety of user-supplied physical constraints (the so-called side constraints in the theory of Lagrange multipliers). Additionally, this paper introduces a novel way of performing the absolute calibration of an aircraft that has several benefits over conventional analyses. In the new approach, absolute calibration is completed by inspecting the time derivatives of mill and pitch data for a pitch down maneuver performed at high (greater than 1 km) altitude. In Part II of this study, the above methods are tested and then applied to complete a full calibration of a Citation aircraft.
Koshak, W. J.↗
Retrieving Storm Electric Fields from Aircraft Field Mill Data: Theory - Part 1
It is shown that the problem of retrieving storm electric fields from an aircraft instrumented with several electric field mill sensors can be expressed in terms of a standard Lagrange multiplier optimization problem. The method naturally removes aircraft charge from the retrieval process without having to use a high voltage stinger and linearly combined mill data values. It allows a variety of user-supplied physical constraints (the so-called side constraints in the theory of Lagrange multipliers) and also helps improve absolute calibration. Additionally, this paper introduces an alternate way of performing the absolute calibration of an aircraft that has some benefits over conventional analyses. It is accomplished by using the time derivatives of mill and pitch data for a pitch down maneuver performed at high (greater than 1 km) altitude. In Part II of this study, the above methods are tested and then applied to complete a full calibration of a Citation aircraft.
Koshak, W. J.↗
An optimal stochastic control problem with observation cost
Linear systems simultaneous optimal stochastic control and observation strategies, assuming quadratic observation cost
Cooper, C. A.↗
Multi-plane moment-of-fluid interface reconstruction in 3D
Moment-of-fluid (MOF) methods for interface reconstruction approximate the region occupied by material in each mesh element only through reference to its geometric moments. Here, we present a 3D MOF method that represents the material (POM) in each cell as the convex intersection of the cell and multiple half-spaces, each selected to minimize the least-squares error between computed moments of the approximated material and provided reference moments. This optimization problem is highly non-linear and non-convex, making the numerical result very sensitive to the initial guess. To create an effective initial guess in each cell, we construct an ellipsoid from 0th–2nd order reference moments such that its shape corresponds with that of the POM. Within this ellipsoid we inscribe a polyhedron, and initialize the minimization problem with the half-spaces defined by each of its faces. The inscribed polyhedron has minimally 4 faces, and using up to 3rd order moments permits optimization over up to 20 unknown values. We therefore define MOF methods that utilize 4, 5, or 6 half-spaces, correspondingly initialized with the faces of a single inscribed tetrahedron, triangular prism, or hexahedron. Stability of the non-linear optimization is further improved with a prepossessing step that normalizes the reference moments according to the axes of the reference ellipsoid. Using this approach, the non-linear least-squares solver reliably converges to a near-global minimum from a single initial guess. We demonstrate accuracy and robustness using single-cell and multi-cell examples over a wide spectrum of geometry. In particular, we demonstrate our ability to exactly reproduce several important and complex features defined by up to four half-spaces, such as corners, filaments, filament tips, and embedded material in the cell.
3D interface reconstruction↗
New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms
While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.
97 MATHEMATICS AND COMPUTING↗
An accelerated gradient method for parameter optimization with non-linear constraints.
Accelerated gradient method for numerical solution of parameter optimization problems with nonlinear constraints
NUMERICAL ANALYSIS↗
Minimum fuel trajectory for the aerospace-plane
An overall trajectory for a single-stage-to-orbit vehicle with an initial weight of 234 tons is calculated, and four different propulsion models including turbojet, ramjet, scramjet, and rocket are considered. First, the atmospheric flight in the thicker atmosphere is discussed with emphasis on trajectory optimization, optimization problem, aerodynamic problem, propulsion model, and initial conditions. The performance of turbojet and ramjet-scramjet engines is analyzed; and then the flight to orbit is assessed from the optimization point of view. It is shown that roll modulation saves little during the trajectory, and the combined application of airbreathing propulsion and aerodynamic lift is suggested.
Breakwell, John V.↗
Active versus passive damping in large flexible structures
Optimal passive and active damping control can be considered in the context of a general control/structure optimization problem. Using a mean square output response approach, it is shown that the weight sensitivity of the active and passive controllers can be used to determine an optimal mix of active and passive elements in a flexible structure.
Slater, Gary L.↗
Inference in infinite-dimensional inverse problems - Discretization and duality
Many techniques for solving inverse problems involve approximating the unknown model, a function, by a finite-dimensional 'discretization' or parametric representation. The uncertainty in the computed solution is sometimes taken to be the uncertainty within the parametrization; this can result in unwarranted confidence. The theory of conjugate duality can overcome the limitations of discretization within the 'strict bounds' formalism, a technique for constructing confidence intervals for functionals of the unknown model incorporating certain types of prior information. The usual computational approach to strict bounds approximates the 'primal' problem in a way that the resulting confidence intervals are at most long enough to have the nominal coverage probability. There is another approach based on 'dual' optimization problems that gives confidence intervals with at least the nominal coverage probability. The pair of intervals derived by the two approaches bracket a correct confidence interval. The theory is illustrated with gravimetric, seismic, geomagnetic, and helioseismic problems and a numerical example in seismology.
Stark, Philip B.↗
Dynamic Modeling, Trajectory Optimization, and Linear Control of Cable-Driven Parallel Robots for Automated Panelized Building Retrofits
The construction industry faces a growing need for automation to reduce costs, improve accuracy and productivity, and address labor shortages. One area that stands to benefit significantly from automation is panelized prefabricated building envelope retrofits, which can improve a building’s energy efficiency in heating and cooling interior spaces. In this paper, we propose using cable-driven parallel robots (CDPRs), which can effectively lift and handle large objects, to install these panels. However, implementing CDPRs presents significant challenges because of their nonlinear dynamics, complex trajectory planning, and precise control requirements. To tackle these challenges, this work focuses on a new application of established control and trajectory optimization theories in a CDPR simulation of a building envelope retrofit under real-world conditions. We first model the dynamics of CDPRs, highlighting the critical role of damping in system behavior. Building on this dynamic model, we formulate a trajectory optimization problem to generate feasible and efficient motion plans for the robot under operational and environmental constraints. Given the high precision required in the construction industry, accurately tracking the optimized trajectory is essential. However, challenges such as partial observability and external vibrations complicate this task. To address these issues, a Linear Quadratic Gaussian control framework is applied, enabling the robot to track the optimized trajectories with precision. Simulation results show that the proposed controller enables precise end effector positioning with errors under 4 mm, even in the presence of external wind disturbances. Through comprehensive simulations, our approach allows for an in-depth exploration of the system’s nonlinear dynamics, trajectory optimization, and control strategies under controlled yet highly realistic conditions. The results demonstrate the feasibility of CDPRs for automating panel installation and provide insights into their practical deployment.
CDPR↗
Tradeoff methods in multiobjective insensitive design of airplane control systems
The latest results of an ongoing study of computer-aided design of airplane control systems are given. Constrained minimization algorithms are used, with the design objectives in the constraint vector. The concept of Pareto optimiality is briefly reviewed. It is shown how an experienced designer can use it to find designs which are well-balanced in all objectives. Then the problem of finding designs which are insensitive to uncertainty in system parameters are discussed, introducing a probabilistic vector definition of sensitivity which is consistent with the deterministic Pareto optimal problem. Insensitivity is important in any practical design, but it is particularly important in the design of feedback control systems, since it is considered to be the most important distinctive property of feedback control. Methods of tradeoff between deterministic and stochastic-insensitive (SI) design are described, and tradeoff design results are presented for the example of the a Shuttle lateral stability augmentation system. This example is used because careful studies have been made of the uncertainty in Shuttle aerodynamics. Finally, since accurate statistics of uncertain parameters are usually not available, the effects of crude statistical models on SI designs are examined.
Schy, A. A.↗
Flight-test guidance for airbreathing hypersonic vehicles
A guidance solution for aerospace planes is given based on a family of energy-heading extremal solutions that can be used for feedback implementations. Test conditions are developed as steady-cruise solutions by means of energy-heading extremal solutions to a time/fuel-range flight-optimization problem. Feedback charts are derived that give control as a function of energy and heading-to-go, and the reduced-order model is compared to numerically optimized point-mass solutions for flight optimization. The energy-heading model is shown to provide feedback-control charts that yield fuel-efficient turn/acceleration maneuvers with significant weight-change as compared to the point-mass solutions. Such variables as Mach number, dynamic pressure, and lift are found to influence the solutions significantly.
Cliff, Eugene M.↗
Newton modified barrier method in constrained optimization
In this paper, we develop and investigate the Newton method for solving constrained (non-smooth) optimization problems. This approach is based on the modified barrier functions (MBF) theory and on the global converging step-size version of the Newton method for smooth unconstrained optimization. Due to the excellent properties of the MBF near primal-dual solution, the Newton modified barrier method (NMBM) has a better rate of convergence, better complexity bound, and is much more stable in the final stage of the computational process than the methods which are based on the classical barrier functions (CBF).
Polyak, R.↗