Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 865 records · Page 48

Far-field mission planning for nap-of-the-earth flight

In the face of numerically superior hostile forces, deployment of individual vehicles to the right place, at the right time, and the ability to plan missions with less conservatism, will become significant force multipliers. Far-field mission planning is one of the enabling technologies that will facilitate force coordination through management of mission timeline, vehicle survivability and fuel constraints. On-board replanning is required to deal responsively with departures from nominal plan execution that result from imperfect knowledge of and temporal variability in the mission environment. The far-field planning problem is posed as a constrained optimization problem and algorithms and structural organization are proposed for the solution.

Deutsch, Owen L.↗

Performance of Four-Wheel-Steering Vehicles in Lane Change Maneuvers

This study addresses the performance of four-wheel-steering vehicles in high-speed lane change maneuvers. We compare the steering commands of an experienced driver in executing high-speed lane change maneuvers in road tests with those determined via solving suitably formulated optimization problems. It turns out that the optimal control determined is qualitatively comparable to the steering commands used by experienced drivers in road tests. Hence, we can analytically compare the performance of an experienced driver in executing lane change maneuvers using different vehicles.

Four-wheel-steering lane change maneuvers obstacle↗

Gain-Scheduled Fault Tolerance Control Under False Identification

An active fault tolerant control (FTC) law is generally sensitive to false identification since the control gain is reconfigured for fault occurrence. In the conventional FTC law design procedure, dynamic variations due to false identification are not considered. In this paper, an FTC synthesis method is developed in order to consider possible variations of closed-loop dynamics under false identification into the control design procedure. An active FTC synthesis problem is formulated into an LMI optimization problem to minimize the upper bound of the induced-L2 norm which can represent the worst-case performance degradation due to false identification. The developed synthesis method is applied for control of the longitudinal motions of FASER (Free-flying Airplane for Subscale Experimental Research). The designed FTC law of the airplane is simulated for pitch angle command tracking under a false identification case.

Shin, Jong-Yeob↗

Development of a Test Facility for Air Revitalization Technology Evaluation

An active fault tolerant control (FTC) law is generally sensitive to false identification since the control gain is reconfigured for fault occurrence. In the conventional FTC law design procedure, dynamic variations due to false identification are not considered. In this paper, an FTC synthesis method is developed in order to consider possible variations of closed-loop dynamics under false identification into the control design procedure. An active FTC synthesis problem is formulated into an LMI optimization problem to minimize the upper bound of the induced-L2 norm which can represent the worst-case performance degradation due to false identification. The developed synthesis method is applied for control of the longitudinal motions of FASER (Free-flying Airplane for Subscale Experimental Research). The designed FTC law of the airplane is simulated for pitch angle command tracking under a false identification case.

Lu, Sao-Dung↗

Design of Spacecraft Missions to Remove Multiple Orbital Debris Objects

The amount of hazardous debris in Earth orbit has been increasing, posing an evergreater danger to space assets and human missions. In January of 2007, a Chinese ASAT test produced approximately 2600 pieces of orbital debris. In February of 2009, Iridium 33 collided with an inactive Russian satellite, yielding approximately 1300 pieces of debris. These recent disastrous events and the sheer size of the Earth orbiting population make clear the necessity of removing orbital debris. In fact, experts from both NASA and ESA have stated that 10 to 20 pieces of orbital debris need to be removed per year to stabilize the orbital debris environment. However, no spacecraft trajectories have yet been designed for removing multiple debris objects and the size of the debris population makes the design of such trajectories a daunting task. Designing an efficient spacecraft trajectory to rendezvous with each of a large number of orbital debris pieces is akin to the famous Traveling Salesman problem, an NP-complete combinatorial optimization problem in which a number of cities are to be visited in turn. The goal is to choose the order in which the cities are visited so as to minimize the total path distance traveled. In the case of orbital debris, the pieces of debris to be visited must be selected and ordered such that spacecraft propellant consumption is minimized or at least kept low enough to be feasible. Emergent Space Technologies, Inc. has developed specialized algorithms for designing efficient tour missions for near-Earth asteroids that may be applied to the design of efficient spacecraft missions capable of visiting large numbers of orbital debris pieces. The first step is to identify a list of high priority debris targets using the Analytical Graphics, Inc. SOCRATES website and then obtain their state information from Celestrak. The tour trajectory design algorithms will then be used to determine the itinerary of objects and v requirements. These results will shed light on how many debris pieces can be visited for various amounts of propellant, which launch vehicles can accommodate such missions, and how much margin is available for debris removal system payloads.

Barbee, Brent W.↗

A Functional Interpolation Approach to Compute Period Orbits in the Circular Restricted Three-body Problem

In this paper, we develop a method to solve for periodic orbits, i.e., Lyapunov and Halo orbits, using a functional interpolation scheme called the Theory of Func- tional Connections (TFC). Using this technique, a periodic constraint is analyti- cally embedded into the TFC constrained expression. By doing this, the system of differential equations governing the three-body problem is transformed into an unconstrained optimization problem where simple numerical schemes can be used to find a solution, e.g., nonlinear least-squares is used. This allows for a simpler numerical implementation with comparable accuracy and speed to the traditional differential corrector method.

Mortari, Daniele↗

DEVELOPING A TRAFFIC SIGNAL ECO-COOPERATIVE ADAPTIVE CRUISE CONTROL SYSTEM FOR BATTERY ELECTRIC VEHICLES

This study developed an eco-driving strategy for battery electric vehicles (BEVs) in the vicinity of signalized intersections, known as BEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The system computes a real-time, energy-optimized vehicle trajectory using a BEV vehicle dynamics and energy consumption model. In the proposed approach, the relationship between vehicle speed, acceleration level, and tractive/resistance forces on the vehicle follows the vehicle dynamics model. The Virginia Tech Comprehensive Power-based Electric Vehicle Energy Consumption Model (VT-CPEM) is used to compute the instantaneous battery energy consumption, with the consideration of battery energy regeneration during braking. The Eco-CACC-I energy-optimum trajectory computation is formulated as an optimization problem with constraints. Considering that the optimization solution needs to be computed at a rapid frequency (e.g., 10 Hz) for real-time applications, an A-star algorithm was used here to expedite the computational speed. Lastly, the proposed BEV Eco-CACC-I system was tested in simulation by considering the impacts of various road grades, speed limits, and signal timings. Simulations for an Internal Combustion Engine Vehicles (ICEVs) was conducted to compare with the BEV test results. The results of the comparison indicate that the energy-optimum solution for BEVs is different from that for ICEVs and thus demonstrating the need for vehicle-tailored optimum trajectories.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Learning Optimal Aerodynamic Designs

This project created a framework for efficient, accurate, and scalable deep neural network representations of design optimization problem solutions. The inputs to these DNN representations are the vector of design requirement parameters, the outputs are the optimal design variables, and the goal is to learn the map from inputs to outputs (i.e., inverse design). The team addressed the problem of the optimal shape design of aerodynamic lifting surfaces—in particular aircraft wings—using a Reynolds-Average Navier Stokes model to govern the CFD-based aerodynamic shape optimization. The inverse design map for such problems is very complex and high-dimensional, involving inputs and outputs on the order of 1000s. To approximate this inverse design map, the team developed algorithms to construct parsimonious DNN architectures, which automatically identify low-dimensional manifolds in which design requirements affect optimal shape parameters, and trained these architectures with multifidelity optimization methods. The resulting methodology accurately and automatically designs optimal aerodynamic lifting surfaces with very high accuracy (99%) at interactive speeds, of the order of milliseconds, resulting in factors of one million or more speedup relative to CFD-based design optimization.

97 MATHEMATICS AND COMPUTING↗

Optimal guidance law development for an advanced launch system

A regular perturbation analysis is presented. Closed-loop simulations were performed with a first order correction including all of the atmospheric terms. In addition, a method was developed for independently checking the accuracy of the analysis and the rather extensive programming required to implement the complete first order correction with all of the aerodynamic effects included. This amounted to developing an equivalent Hamiltonian computed from the first order analysis. A second order correction was also completed for the neglected spherical Earth and back-pressure effects. Finally, an analysis was begun on a method for dealing with control inequality constraints. The results on including higher order corrections do show some improvement for this application; however, it is not known at this stage if significant improvement will result when the aerodynamic forces are included. The weak formulation for solving optimal problems was extended in order to account for state inequality constraints. The formulation was tested on three example problems and numerical results were compared to the exact solutions. Development of a general purpose computational environment for the solution of a large class of optimal control problems is under way. An example, along with the necessary input and the output, is given.

Calise, Anthony J.↗

Parallel Aircraft Trajectory Optimization with Analytic Derivatives

Trajectory optimization is an integral component for the design of aerospace vehicles, but emerging aircraft technologies have introduced new demands on trajectory analysis that current tools are not well suited to address. Designing aircraft with technologies such as hybrid electric propulsion and morphing wings requires consideration of the operational behavior as well as the physical design characteristics of the aircraft. The addition of operational variables can dramatically increase the number of design variables which motivates the use of gradient based optimization with analytic derivatives to solve the larger optimization problems. In this work we develop an aircraft trajectory analysis tool using a Legendre-Gauss-Lobatto based collocation scheme, providing analytic derivatives via the OpenMDAO multidisciplinary optimization framework. This collocation method uses an implicit time integration scheme that provides a high degree of sparsity and thus several potential options for parallelization. The performance of the new implementation was investigated via a series of single and multi-trajectory optimizations using a combination of parallel computing and constraint aggregation. The computational performance results show that in order to take full advantage of the sparsity in the problem it is vital to parallelize both the non-linear analysis evaluations and the derivative computations themselves. The constraint aggregation results showed a significant numerical challenge due to difficulty in achieving tight convergence tolerances. Overall, the results demonstrate the value of applying analytic derivatives to trajectory optimization problems and lay the foundation for future application of this collocation based method to the design of aircraft with where operational scheduling of technologies is key to achieving good performance.

aircraft↗

H2-optimal control with generalized state-space models for use in control-structure optimization

Several advances are provided solving combined control-structure optimization problems. The author has extended solutions from H2 optimal control theory to the use of generalized state space models. The generalized state space models preserve the sparsity inherent in finite element models and hence provide some promise for handling very large problems. Also, expressions for the gradient of the optimal control cost are derived which use the generalized state space models.

Wette, Matt↗

A Multi-Objective Bayesian Optimization Approach Using the Weighted Tchebycheff Method

Abstract Bayesian optimization (BO) is a low-cost global optimization tool for expensive black-box objective functions, where we learn from prior evaluated designs, update a posterior surrogate Gaussian process model, and select new designs for future evaluation using an acquisition function. This research focuses upon developing a BO model with multiple black-box objective functions. In the standard multi-objective (MO) optimization problem, the weighted Tchebycheff method is efficiently used to find both convex and non-convex Pareto frontiers. This approach requires knowledge of utopia values before we start optimization. However, in the BO framework, since the functions are expensive to evaluate, it is very expensive to obtain the utopia values as a prior knowledge. Therefore, in this paper, we develop a MO-BO framework where we calibrate with multiple linear regression (MLR) models to estimate the utopia value for each objective as a function of design input variables; the models are updated iteratively with sampled training data from the proposed MO-BO. These iteratively estimated mean utopia values are used to formulate the weighted Tchebycheff MO acquisition function. The proposed approach is implemented in two numerical test examples and one engineering design problem of optimizing thin tube geometries under constant loading of temperature and pressure, with minimizing the risk of creep-fatigue failure and design cost, along with risk-based and manufacturing constraints. Finally, the model accuracy with frequentist, Bayesian and without MLR-based calibration are compared to true Pareto solutions.

Engineering↗

Stochastic Unit Commitment: Model Reduction via Learning

As weather-dependent renewable generation increases its share in the generation mix of most electric energy systems, a stochastic unit commitment becomes the natural day-ahead scheduling tool. However, such a tool is generally computationally intractable if a detailed uncertainty description is considered. Taking this into account, we proposed a learning method to make the stochastic unit commitment problem tractable. Here, recent advances in statistical learning and machine learning to address optimization problems can be advantageously applied to the rather intractable stochastic unit commitment problem. Considering these advances, we explore simple learning techniques to drastically reduce the size of a stochastic unit commitment problem without significantly altering its optimal solution. The considered stochastic unit commitment problem is formulated as a two-stage stochastic programming problem. The first stage represents commitment decisions, while the second one represents the operation conditions under different scenarios. Taking into account historical solved instances (or proxies for them), we reduce the size (measured by numbers of constraints and variables) of the stochastic unit commitment problem by (i) fixing unchanged binary variables and by (ii) eliminating inactive inequality constraints. Our numerical results show that the reduced problem generally requires significantly less time to solve while obtaining high-quality solutions, which are very close to or indistinguishable from the one obtained by solving the original problem. We use an Illinois 200-bus system to illustrate and characterize the performance of the proposed problem-reduction method.

42 ENGINEERING↗

Classifier-guided sampling for discrete variable, discontinuous design space exploration: Convergence and computational performance

A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.

42 ENGINEERING↗

Liquid Crystal Orientation and Shape Optimization for the Active Response of Liquid Crystal Elastomers

Liquid crystal elastomers (LCEs) are responsive materials that can undergo large reversible deformations upon exposure to external stimuli, such as electrical and thermal fields. Controlling the alignment of their liquid crystals mesogens to achieve desired shape changes unlocks a new design paradigm that is unavailable when using traditional materials. While experimental measurements can provide valuable insights into their behavior, computational analysis is essential to exploit their full potential. Accurate simulation is not, however, the end goal; rather, it is the means to achieve their optimal design. Such design optimization problems are best solved with algorithms that require gradients, i.e., sensitivities, of the cost and constraint functions with respect to the design parameters, to efficiently traverse the design space. In this work, a nonlinear LCE model and adjoint sensitivity analysis are implemented in a scalable and flexible finite element-based open source framework and integrated into a gradient-based design optimization tool. To display the versatility of the computational framework, LCE design problems that optimize both the material, i.e., liquid crystal orientation, and structural shape to reach a target actuated shapes or maximize energy absorption are solved. Multiple parameterizations, customized to address fabrication limitations, are investigated in both 2D and 3D. The case studies are followed by a discussion on the simulation and design optimization hurdles, as well as potential avenues for improving the robustness of similar computational frameworks for applications of interest.

42 ENGINEERING↗

Post-Optimality Analysis In Aerospace Vehicle Design

This analysis pertains to the applicability of optimal sensitivity information to aerospace vehicle design. An optimal sensitivity (or post-optimality) analysis refers to computations performed once the initial optimization problem is solved. These computations may be used to characterize the design space about the present solution and infer changes in this solution as a result of constraint or parameter variations, without reoptimizing the entire system. The present analysis demonstrates that post-optimality information generated through first-order computations can be used to accurately predict the effect of constraint and parameter perturbations on the optimal solution. This assessment is based on the solution of an aircraft design problem in which the post-optimality estimates are shown to be within a few percent of the true solution over the practical range of constraint and parameter variations. Through solution of a reusable, single-stage-to-orbit, launch vehicle design problem, this optimal sensitivity information is also shown to improve the efficiency of the design process, For a hierarchically decomposed problem, this computational efficiency is realized by estimating the main-problem objective gradient through optimal sep&ivity calculations, By reducing the need for finite differentiation of a re-optimized subproblem, a significant decrease in the number of objective function evaluations required to reach the optimal solution is obtained.

Braun, Robert D.↗

Visualization for Hyper-Heuristics: Front-End Graphical User Interface

Modern society is faced with ever more complex problems, many of which can be formulated as generate-and-test optimization problems. General-purpose optimization algorithms are not well suited for real-world scenarios where many instances of the same problem class need to be repeatedly and efficiently solved because they are not targeted to a particular scenario. Hyper-heuristics automate the design of algorithms to create a custom algorithm for a particular scenario. While such automated design has great advantages, it can often be difficult to understand exactly how a design was derived and why it should be trusted. This project aims to address these issues of usability by creating an easy-to-use graphical user interface (GUI) for hyper-heuristics to support practitioners, as well as scientific visualization of the produced automated designs. My contributions to this project are exhibited in the user-facing portion of the developed system and the detailed scientific visualizations created from back-end data.

97 MATHEMATICS AND COMPUTING↗