Theory of optimal control and mathematical programming
Book on theory of optimal control and mathematical programming covering linear, nonlinear, quadratic programmings, etc
SEARCH · Search NASA
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.
Book on theory of optimal control and mathematical programming covering linear, nonlinear, quadratic programmings, etc
A problem of choosing the best scaling function as a mathematical optimization problem is formulated and solved under different optimality criteria. A list of functions which are optimal under different criteria is presented which includes both the best functions empirically proved and new functions that may be worth trying.
C3PU sets up a model predictive control formulation for the optimal charging control of battery packs and can be deployed for real-time operation on an embedded microprocessor. C3PU uses electrochemical and thermal models of battery packs to predict the charging trajectories of the battery pack over a time horizon under different operating conditions. It then selects the optimal charging trajectory such that a pre-defined objective is minimized, which in the present state of the code is to minimize the charging duration of the battery pack. The optimal charging trajectory is obtained by solving an underlying mathematical problem. However, C3PU is flexible to incorporate other charging objectives. The underlying battery models can be swapped as well, as long as they follow certain mathematical properties. Mathematically, optimal control problems (in this case, optimally controlling the charging current of the battery pack) are computationally expensive. C3PU implements advanced numerical techniques, namely pseudo-spectral optimization, to reduce the computational burden of the underlying problem to solve. This allows for the problem to be solved in real-time in an embedded system. Once the optimal charging trajectory is computed over a time horizon, C3PU can package such data and send it out via appropriate communication protocols.
The prevalent use of organic materials in manufacturing is a fire safety concern, and motivates the need for predictive thermal decomposition models. A critical component of predictive modeling is numerical inference of kinetic parameters from bench scale data. Currently, an active area of computational pyrolysis research focuses on identifying efficient, robust methods for optimization. This paper demonstrates that kinetic parameter calibration problems can successfully be solved using classical gradient-based optimization. We explore calibration examples that exhibit characteristics of concern: high nonlinearity, high dimensionality, complicated schemes, overlapping reactions, noisy data, and poor initial guesses. The examples demonstrate that a simple, non-invasive change to the problem formulation can simultaneously avoid local minima, avoid computation of derivative matrices, achieve a computational efficiency speedup of 10x, and make optimization robust to perturbations of parameter components. Techniques from the mathematical optimization and inverse problem communities are employed. By re-examining gradient-based algorithms, we highlight opportunities to develop kinetic parameter calibration methods that should outperform current methods.
The purpose of this study is to create, test and document a procedure to integrate mathematical optimization algorithms with COSMIC NASTRAN. This procedure is very important to structural design engineers who wish to capitalize on optimization methods to ensure that their design is optimized for its intended application. The OPTNAST computer program was created to link NASTRAN and design optimization codes into one package. This implementation was tested using two truss structure models and optimizing their designs for minimum weight, subject to multiple loading conditions and displacement and stress constraints. However, the process is generalized so that an engineer could design other types of elements by adding to or modifying some parts of the code.
The idea behind genetic algorithms is to extract optimization strategies nature uses successfully - known as Darwinian Evolution - and transform them for application in mathematical optimization theory to find the global optimum in a defined phase space. One could imagine a population of individual 'explorers' sent into the optimization phase-space. Each explorer is defined by its genes, what means, its position inside the phase-space is coded in his genes. Every explorer has the duty to find a value of the quality of his position in the phase space. (Consider the phase-space being a number of variables in some technological process, the value of quality of any position in the phase space - in other words: any set of the variables - can be expressed by the yield of the desired chemical product.) Then the struggle of 'life' begins. The three fundamental principles are selection, mating/crossover, and mutation. Only explorers (= genes) sitting on the best places will reproduce and create a new population. This is performed in the second step (mating/crossover). The 'hope' behind this part of the algorithm is, that 'good' sections of two parents will be recombined to yet better fitting children. In fact, many of the created children will not be successful (as in biological evolution), but a few children will indeed fulfill this hope. These good sections are named in some publications as building blocks. Now there appears a problem. Repeating these steps, no new area would be explored. The two former steps would only exploit the already known regions in the phase space, which could lead to premature convergence of the algorithm with the consequence of missing the global optimum by exploiting some local optimum. The third step, mutation, ensures the necessary accidental effects. One can imagine the new population being mixed up a little bit to bring some new information into this set of genes. Whereas in biology a gene is described as a macro-molecule with four different bases to code the genetic information, a gene in genetic algorithms is usually defined as a bitstring (a sequence of b 1's and 0's).
This work presents PRIMO’s main capabilities and introduces the PRIMO web application, an intuitive user interface that leverages our sophisticated mathematical optimization model to rigorously optimize P&A priorities and plugging campaign efficiency. The web app simplifies user interaction, provides a powerful data management framework, and supports a broad user base (e.g., state agencies, well owners/operators, and plugging companies) to use PRIMO for decision-making. Specifically, we provide a demonstration of how to input the information on candidate wells, plugging campaign budget, user-defined priority and efficiency criteria to PRIMO. A real-world case study that consists of 1411 oil and gas wells and impact and efficiency priorities (e.g., well age, well proximity to schools/hospitals, well accessibility, distance between wells in projects) is presented to showcase PRIMO’s core capabilities: (i) ranking a candidate well population based on priorities, (ii) recommending high-impact and high-efficiency P&A projects, and (iii) assigning impact and efficiency scores to projects allowing for rigorous quantitative comparison among them.
A user's manual for Macintosh PASCO is presented. Macintosh PASCO is an Apple Macintosh version of PASCO, an existing computer code for structural analysis and optimization of longitudinally stiffened composite panels. PASCO combines a rigorous buckling analysis program with a nonlinear mathematical optimization routine to minimize panel mass. Macintosh PASCO accepts the same input as mainframe versions of PASCO. As output, Macintosh PASCO produces a text file and mode shape plots in the form of Apple Macintosh PICT files. Only the user interface for Macintosh is discussed here.
The purpose is to develop procedures to extract sensitivity analysis information from COSMIC/NASTRAN and to couple it with a mathematical optimization package. At present, the analysis will be limited to stress, displacement, and frequency constraints with structures modeled with membrane elements, rods, and bar elements. Two types of sensitivity analysis are discussed: an adjoint variable approach which is most effective when the number of active constraints is significantly less than the number of physical variables, and an approach based on a first order approximation of a Taylor series. The latter approach is more effective when the number of independent design variables is significantly less than the number of active constraints.
Methods are presented for the reduction of helicopter rotor blade vibration through a formal mathematical optimization technique determination of optimum tuning mass sizes and locations; these are used as design variables that are systematically changed to achieve low values of shear without large mass penalty. Matrix expressions are obtained for the modal shaping parameter and modal shear amplitude that are required for FEM structural analysis of the blade as well as the optimization formulation. Sensitivity derivatives are also obtained. Three different optimization strategies are developed and tested.
This paper presents the formulation and results for a control-aware optimization of the combined geometric and structural design of an energy-harvesting underwater kite. Because kite-based energy-harvesting systems, both airborne and underwater, possess strong coupling between closed-loop flight control, geometric design, and structural design, consideration of all three facets of the design within a single codesign framework is highly desirable. However, while prior literature has addressed one or two attributes of the design at a time, this work constitutes the first comprehensive effort aimed at addressing all three. In particular, focusing on the goals of power maximization and mass minimization, we present a codesign formulation that fuses a geometric optimization tool, structural optimization tool, and closed-loop flight efficiency map. The resulting integrated codesign tool is used to address two mathematical optimization formulations that exhibit subtle differences: a Pareto optimal formulation and a dual-objective formulation that focuses on a weighted power-to-mass ratio as the techno-economic metric of merit. Further, based on the resulting geometric and structural designs, using a mediumfidelity closed-loop simulation tool, the proposed formulation is shown to achieve more than three times the powerto-mass ratio of a previously published, unoptimized benchmark design.
At the outset ARPA-e’s grid optimization competition sought to test a hypothesis that modern nonlinear optimization methods had reached a level of performance and reliability necessary to optimize energy grids using nonlinear power flow equations. The results demonstrated by this project and the other participants in the grid optimization competition have demonstrated beyond any shadow of doubt that this hypothesis is true. This result suggest that the mathematical optimization technology now exists to produce a revolution in power grid optimization software, which would improve the efficiency of energy grid operations to the broad benefit of society.
With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail.
With the rapid growth in the capabilities of smaller satellites, satellite architectures that replace a single, extremely capable spacecraft with multiple, cheaper ones are gaining in popularity. Unfortunately, the orbit design process for constellations can be significantly more involved, especiallywhen the relative placement of the individual spacecraft within the constellation is not constrained by mission and/or science objectives. Optimizing a satellite constellation in the presence of multiple, competing objectives is a highly complex problem to which many traditional mathematical optimization methods cannot be applied and few tools exist to help mission designers search for promising candidate mission designs. The Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC) has been created to search for near-optimal constellation design options. GenETOC combines a modified version of the Non-dominated Sorting Genetic Algorithm II (NSGA II) with STK Components libraries (a 3rdparty .NET package created by Analytical Graphics Inc.) to create a framework that enables a mission designer to generate a simulation that models the design problem and obtain a family of potential, near-optimal solutions that can be investigated more in detail. GenETOC was developed in C# using the .NET framework with Windows Presentation Foundation (WPF) serving as the framework from which to create the graphical user interface (GUI). GenETOC user inputs can be categorized into three major data components: definition of the problem (areas of interest, satellite decision parameters, and sensor configurations), definition of performance objectives, and specification of the genetic algorithm (GA) parameters. In the problem definition component, the user is prompted to define the areas of interest against which the performance metrics will be computed, define the sensor parameters and attach them to specific spacecraft, select which satellite orbital parameters will be added to the decision space of the GA, and specify the range of desired values for each optimization parameter. For performance objectives, the user is presented with a list of available coverage and revisit performance based calculation options from which two metrics are chosen to serve as the objective functions that the GA will use to evaluate solutions during the optimization process. Finally, the definition of the GA parameters provides user control over the number of generations (number of optimization iterations), the population size (number of candidate constellations created in each generation), and the adaptive mutation and crossover threshold values (control parameters for how frequently each process occurs during the optimization). GenETOC has been extensively tested to verify the individual components of the optimization process. The GA has been tested against a suite of GA test problems to confirm convergence to the known two and three-dimensional Pareto fronts. The coverage and revisit performance metrics obtained in GenETOC are compared with STK desktop scenarios, confirming the constellations are being appropriately modeled within GenETOC simulations. A walkthrough of a simple, example problem is provided to illustrate the workings of GenETOC and to demonstrate the output available to the mission designer.
The requirements for extremely precise and powerful large space antenna reflectors have motivated the development of a procedure for shape control of the reflector surface. A mathematical optimization procedure has been developed which improves antenna performance while minimizing necessary shape correction effort. In contrast to previous work which proposed controlling the rms distortion error of the surface thereby indirectly improving antenna performance, the current work includes electromagnetic (EM) performance calculations as an integral of the control procedure. The application of the procedure to a radiometer design with a tetrahedral truss backup structure demonstrates the potential for significant improvement. The results indicate the benefit of including EM performance calculations in procedures for shape control of large space antenna reflectors.
The requirements for extremely precise and powerful large space antenna reflectors have motivated the development of a procedure for shape control of the reflector surface. A mathematical optimization procedure has been developed which improves antenna performance while minimizing necessary shape correction effort. In contrast to previous work which proposed controlling the rms distortion error of the surface thereby indirectly improving antenna performance, the current work includes electromagnetic (EM) performance calculations as an integral part of the control procedure. The application of the procedure to a radiometer design with a tetrahedral truss backup structure demonstrates the potential for significant improvement. The results indicate the benefit of including EM performance calculations in procedures for shape control of large space antenna reflectors.
The demand for fast, localized delivery has grown significantly in recent years. Whether for cheesy snacks, prepared food, medical solutions, or business deliveries, fast and efficient delivery is increasingly a demand and differentiator. Drone delivery in the freight sector offers to revolutionize last-mile logistics and improve services. This research analyzes the impacts of drone energy for delivery operations, aiming to compare various types of drones (large and small, rotary and VTOL) and various types of business methods. The project executes novel open-air and laboratory-based testing to look at the impacts of weights, operations, temperatures and weather conditions. The study combines this real-world experimental data with fleet optimization mathematical models to assess energy consumption of different scenarios as well as examine the minimum fleet size and additional battery requirements. These fleet optimization models compare energy between types of deployments with existing delivery methods. The model was also extended to look at mixed fleets of aerial drones and ground vehicles to accommodate different restrictions on drones or when weather prohibits their use. The analysis provided insights into factors such as drone design, payload weight, flight distance, weather conditions and operational parameters and impacts of each. It showed how to combine different types of vehicles to reduce energy and improve services. And it showed that drone speed, routing restrictions, and unfavorable weather significantly influence energy consumption. Our open experiment data and optimization models can assist stakeholders and industry in understanding drone package delivery and offers keys to improving deployment.
Described are methods for reducing vibration in helicopter rotor blades by determining optimum sizes and locations of tuning masses through formal mathematical optimization techniques. An optimization procedure is developed which employs the tuning masses and corresponding locations as design variables which are systematically changed to achieve low values of shear without a large mass penalty. The finite-element structural analysis of the blade and the optimization formulation require development of discretized expressions for two performance parameters: modal shaping parameter and modal shear amplitude. Matrix expressions for both quantities and their sensitivity derivatives are developed. Three optimization strategies are developed and tested. The first is based on minimizing the modal shaping parameter which indirectly reduces the modal shear amplitudes corresponding to each harmonic of airload. The second strategy reduces these amplitudes directly, and the third strategy reduces the shear as a function of time during a revolution of the blade. The first strategy works well for reducing the shear for one mode responding to a single harmonic of the airload, but has been found in some cases to be ineffective for more than one mode. The second and third strategies give similar results and show excellent reduction of the shear with a low mass penalty.