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 1,747 records · Page 97

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Mercadal, Mathieu↗

Optimal compensator structure for linear time-invariant plant with inaccessible states

The problem is considered of designing an optimal linear time-invariant dynamic compensator for the regulation of an n-th order linear time-invariant plant with m independent outputs. The initial plant state is characterized by its first and second moments, and the cost is usual quadratic infinite-time penalty on the state and control, averaged over the initial plant and compensator states. The compensator is based on a minimal-order Luenberger observer and consequently has fixed dimension n-m. Necessary and sufficient conditions are derived for optimality of the compensator gains. The optimal compensator is shown to be unique if the plant has a particular canonical form, and, in general, for any arbitrary plant, the class of all optimal compensators is precisely determined.

Blanvillain, P. J. P.↗

Distributed Parallel Processing and Dynamic Load Balancing Techniques for Multidisciplinary High Speed Aircraft Design

Multidisciplinary design optimization (MDO) for large-scale engineering problems poses many challenges (e.g., the design of an efficient concurrent paradigm for global optimization based on disciplinary analyses, expensive computations over vast data sets, etc.) This work focuses on the application of distributed schemes for massively parallel architectures to MDO problems, as a tool for reducing computation time and solving larger problems. The specific problem considered here is configuration optimization of a high speed civil transport (HSCT), and the efficient parallelization of the embedded paradigm for reasonable design space identification. Two distributed dynamic load balancing techniques (random polling and global round robin with message combining) and two necessary termination detection schemes (global task count and token passing) were implemented and evaluated in terms of effectiveness and scalability to large problem sizes and a thousand processors. The effect of certain parameters on execution time was also inspected. Empirical results demonstrated stable performance and effectiveness for all schemes, and the parametric study showed that the selected algorithmic parameters have a negligible effect on performance.

Krasteva, Denitza T.↗

Generation-based Evolutionary Tool for the Optimization of Constellations (GenETOC)

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.

mission design↗

Sparse Solutions for Single Class SVMs: A Bi-Criterion Approach

In this paper we propose an innovative learning algorithm - a variation of One-class nu Support Vector Machines (SVMs) learning algorithm to produce sparser solutions with much reduced computational complexities. The proposed technique returns an approximate solution, nearly as good as the solution set obtained by the classical approach, by minimizing the original risk function along with a regularization term. We introduce a bi-criterion optimization that helps guide the search towards the optimal set in much reduced time. The outcome of the proposed learning technique was compared with the benchmark one-class Support Vector machines algorithm which more often leads to solutions with redundant support vectors. Through out the analysis, the problem size for both optimization routines was kept consistent. We have tested the proposed algorithm on a variety of data sources under different conditions to demonstrate the effectiveness. In all cases the proposed algorithm closely preserves the accuracy of standard one-class nu SVMs while reducing both training time and test time by several factors.

Das, Santanu↗

Numerical Simulation of One- and Two-Phase Flows in Propulsion Systems

In this report, we present some results of problems investigated during joint research between the Hampton University Fluid Mechanics and Acoustics Laboratory (HU/FM&AL), NASA GRC, and the LaRC Hyper-X Program. This work is supported by joint research between the NASA GRC and the Institute of Mechanics at Moscow State University (IM/MSU) in Russia under a CRDF grant. The main areas of current scientific interest of the HU/FM&AL include an investigation of the proposed and patented advanced methods for aircraft engine thrust and noise benefits. These methods are based on nontraditional 3D corrugated and composite nozzle, inlet, propeller and screw designs such as a Bluebell and Telescope nozzle, Mobius-shaped screw, etc. This is the main subject of our other projects, of which one is presented at the current conference. Here we analyze additional methods for exhaust jet noise reduction without essential thrust loss and even with thrust augmentation. Such additional approaches are: (1) to add some solid, fluid, or gas mass at discrete locations to the main supersonic gas stream to minimize the negative influence of strong shock waves formed in propulsion systems. This mass addition may be accompanied by heat addition to the main stream as a result of the fuel combustion or by cooling of this stream as a result of the liquid mass evaporation and boiling; (2) Use of porous or permeable nozzles and additional shells at the nozzle exit for preliminary cooling of the hot jet exhaust and pressure compensation for off-design conditions (so-called continuous ejector with small mass flow rate); and (3) to propose and analyze new effective methods of fuel injection into the flow stream in air-breathing engines. The research is focused on a wide regime of problems in the propulsion field as well as in experimental testing and theoretical and numerical simulation analyses for advanced aircraft and rocket engines. The FM&AL Team uses analytical methods, numerical simulations, and experimental tests at the Hampton University campus, NASA, and IM/MSU. The main outcomes during this reporting period are: (1) Publications: The AIAA Paper #01-1893 has been accepted for the AIAA/NAL-NASDA-ISAS 10th International Space Planes and Hypersonic Systems and Technologies Conference, 24-27 April 2001, Kyoto, Japan. The AIAA Paper #01-3204 has been accepted for presentation at the 37th AIAA/ASME/SAE/ASEE Joint Propulsion Conference being held on 08-11 July, in Salt Lake City, UT; (2) Grants and proposals: The HU/FM&AL was awarded the NASA grant NAG3-2495 in October 2000 and the CRDF award was granted to the NASA GRC-HU FM&AL and IM/MSU (Russia) in July 2000. A solicited proposal was submitted for the NASA NRA-01GRC-02 competition and two unsolicited proposals to NASA are in preparation; (3) Theory and numerical simulations: Analytical theory, numerical simulation, comparison of theoretical with experimental results, and modification of theoretical approaches, models, grids, etc. Such investigations have been conducted for three main problems: (a) Combustion efficiency optimization in the half-duct combustor system; (b) Drag reduction effects for blunt bodies with solid needles; and (c) Solid particle injection from the butt-end against a supersonic flow. The NASA CFL3D, HU/FM&AL, and IM/MSU GODUNOV codes were used and modified for solution of these problems. The codes are based on full Euler and Navier-Stokes solvers with and without nonequilibrium oxygen-nitrogen and air-hydrogen chemical reactions in laminar and turbulent gas flow regimes; (4) Experimental tests: In the IM/MSU supersonic wind tunnel, experimental tests were conducted with different number, location, and geometric parameters of solid needles mounted at the front of the butt-end in supersonic flow. Optimal parameters were determined that provide minimal butt-end drag in the stationary flow regime. Experimental and numerical simulation results are in good agreement; (5) Student Research Activity: Involvement of one graduate and two undergraduate students as research assistants in the current project.

Gilinsky, Mikhail↗

Optimal horizontal guidance law for aircraft in the terminal area.

Study of the horizontal guidance of aircraft in and near the terminal area. The problem of guiding an aircraft in minimum time from an arbitrary point to the outer marker is formulated as a nonlinear optimal control problem, and the control law solution is obtained by the application of the maximum principle. It is found that for some initial states the problem is singular. Furthermore, the extremal controls for this problem are not unique. Consequently, the optimal controls must be obtained on the basis of the value of the performance index. The control law is implemented in the form of a digital computer program which computes the optimal trajectory for arbitrary initial conditions.

Pecsvaradi, T.↗

Transient Optimization of an Electrified Gas Turbine Engine Using Machine Learning

Gas turbine engines are designed with sufficient margin to prevent stall under normal operating conditions throughout their life. This compromise ensures that during rapid accelerations, compressor operation remains stable, but at the cost of efficiency and thrust responsiveness. The design margin encompasses multiple sources of uncertainty and systematic deviances from the operating line, the largest of which is the transient allowance. This set-aside accounts for the temporary incoordination of the engine spools during an acceleration while still enabling it to meet the certification requirement to accelerate from low to high power within a specified time, and without experiencing overtemperature, surge, stall, or other detrimental factors. Electrification of the powertrain provides the opportunity to address this reserve and truly optimize the design. The addition of electric machines inherent in hybrid propulsion concepts offers a means to interact with the engine shafts such that the necessary margin can be reduced, which can positively impact the engine design. By adjusting the amount of power extracted from or injected to the engine spools by the electric machines during transient operation, excursions from the operating line can be minimized. Past work using a dynamic engine model has shown that optimization of the fuel flow schedule during acceleration can reduce the required margin while still meeting the time requirement, and results are further improved when combined with power injection and extraction. The current work uses machine learning through a genetic algorithm to address the problem holistically by concurrently optimizing the electric machine power command and fuel flow acceleration schedule using an updated, higher fidelity version of the original engine model.

Stall Margin↗

Transient Optimization of an Electrified Gas Turbine Engine Using Machine Learning

Gas turbine engines are designed with sufficient margin to prevent stall under normal operating conditions throughout their life. This compromise ensures that during rapid accelerations, compressor operation remains stable, but at the cost of efficiency and thrust responsiveness. The design margin encompasses multiple sources of uncertainty and systematic deviances from the operating line, the largest of which is the transient allowance. This set-aside accounts for the temporary incoordination of the engine spools during an acceleration while still enabling it to meet the certification requirement to accelerate from low to high power within a specified time, and without experiencing overtemperature, surge, stall, or other detrimental factors. Electrification of the powertrain provides the opportunity to address this reserve and truly optimize the design. The addition of electric machines inherent in hybrid propulsion concepts offers a means to interact with the engine shafts such that the necessary margin can be reduced, which can positively impact the engine design. By adjusting the amount of power extracted from or injected to the engine spools by the electric machines during transient operation, excursions from the operating line can be minimized. Past work using a dynamic engine model has shown that optimization of the fuel flow schedule during acceleration can reduce the required margin while still meeting the time requirement, and results are further improved when combined with power injection and extraction. The current work uses machine learning through a genetic algorithm to address the problem holistically by concurrently optimizing the electric machine power command and fuel flow acceleration schedule using an updated, higher fidelity version of the original engine model.

Stall Margin↗

Transient Optimization of an Electrified Gas Turbine Engine Using Machine Learning

Gas turbine engines are designed with sufficient margin to prevent stall under normal operating conditions throughout their life. This compromise ensures that during rapid accelerations, compressor operation remains stable, but at the cost of efficiency and thrust responsiveness. The design margin encompasses multiple sources of uncertainty and systematic deviances from the operating line, the largest of which is the transient allowance. This set-aside accounts for the temporary incoordination of the engine spools during an acceleration while still enabling it to meet the certification requirement to accelerate from low to high power within a specified time, and without experiencing overtemperature, surge, stall, or other detrimental factors. Electrification of the powertrain provides the opportunity to address this reserve and truly optimize the design. The addition of electric machines inherent in hybrid propulsion concepts offers a means to interact with the engine shafts such that the necessary margin can be reduced, which can positively impact the engine design. By adjusting the amount of power extracted from or injected to the engine spools by the electric machines during transient operation, excursions from the operating line can be minimized. Past work using a dynamic engine model has shown that optimization of the fuel flow schedule during acceleration can reduce the required margin while still meeting the time requirement, and results are further improved when combined with power injection and extraction. The current work uses machine learning through a genetic algorithm to address the problem holistically by concurrently optimizing the electric machine power command and fuel flow acceleration schedule using an updated, higher fidelity version of the original engine model.

Stall Margin↗

Sensitivity of Optimal Midcourse Correction Scheduling for Robust Cislunar Trajectory Design

A new approach to optimal trajectory design is the determination of optimal trajectories that are robust to initial trajectory dispersions, navigation errors, maneuver execution errors, and environment modeling errors. This paper investigates the sensitivity of cislunar robust optimal trajectory design to launch date, duration of navigation measurement passes, and navigation measurement frequency. For a given cislunar trajectory from translunar injection (TLI) to lunar orbit insertion (LOI), the optimal locations of midcourse corrections, also known as trajectory correction maneuvers (TCM) are determined by minimizing the final 3-σ ∆v subject to a final 3-σ position dispersion constraint for a given launch date, specified measurement pass duration prior to each maneuver, and measurement frequency. Optical navigation (OpNav) is assumed, and OpNav field-of-view (FOV) and lighting constraints are employed. These constraints turn out to be important elements of the problem. The sensitivity of the optimal TCM locations are then investigated by varying the launch date, duration of OpNav measurement passes, and the OpNav measurement frequency, and then re-optimizing the locations of the TCMs. Given the problem parameters provided herein, results show that while the optimal TCM locations with respect to TLI vary greatly from one launch date to another, their locations with respect to LOI are nearly invariant over a 2-month launch window. Results also show that in all cases the optimal location of the last TCM is found to be at the point where the OpNav lunar FOV constraint is first violated. For all other TCMs, OpNav measurement pass duration and measurement frequency can have a moderate to large affect on the optimal TCM locations.

Linear Covariance Analysis↗

A forward method for optimal stochastic nonlinear and adaptive control

A computational approach is taken to solve the optimal nonlinear stochastic control problem. The approach is to systematically solve the stochastic dynamic programming equations forward in time, using a nested stochastic approximation technique. Although computationally intensive, this provides a straightforward numerical solution for this class of problems and provides an alternative to the usual dimensionality problem associated with solving the dynamic programming equations backward in time. It is shown that the cost degrades monotonically as the complexity of the algorithm is reduced. This provides a strategy for suboptimal control with clear performance/computation tradeoffs. A numerical study focusing on a generic optimal stochastic adaptive control example is included to demonstrate the feasibility of the method.

Bayard, David S.↗

Reducing neural network training time with parallel processing

Obtaining optimal solutions for engineering design problems is often expensive because the process typically requires numerous iterations involving analysis and optimization programs. Previous research has shown that a near optimum solution can be obtained in less time by simulating a slow, expensive analysis with a fast, inexpensive neural network. A new approach has been developed to further reduce this time. This approach decomposes a large neural network into many smaller neural networks that can be trained in parallel. Guidelines are developed to avoid some of the pitfalls when training smaller neural networks in parallel. These guidelines allow the engineer: to determine the number of nodes on the hidden layer of the smaller neural networks; to choose the initial training weights; and to select a network configuration that will capture the interactions among the smaller neural networks. This paper presents results describing how these guidelines are developed.

Rogers, James L., Jr.↗

Automated distribution system management for multichannel space power systems

A NASA sponsored study of space power distribution system technology is in progress to develop an autonomously managed power system (AMPS) for large space power platforms. The multichannel, multikilowatt, utility-type power subsystem proposed presents new survivability requirements and increased subsystem complexity. The computer controls under development for the power management system must optimize the power subsystem performance and minimize the life cycle cost of the platform. A distribution system management philosophy has been formulated which incorporates these constraints. Its implementation using a TI9900 microprocessor and FORTH as the programming language is presented. The approach offers a novel solution to the perplexing problem of determining the optimal combination of loads which should be connected to each power channel for a versatile electrical distribution concept.

Fleck, G. W.↗

Learning and optimization with cascaded VLSI neural network building-block chips

To demonstrate the versatility of the building-block approach, two neural network applications were implemented on cascaded analog VLSI chips. Weights were implemented using 7-b multiplying digital-to-analog converter (MDAC) synapse circuits, with 31 x 32 and 32 x 32 synapses per chip. A novel learning algorithm compatible with analog VLSI was applied to the two-input parity problem. The algorithm combines dynamically evolving architecture with limited gradient-descent backpropagation for efficient and versatile supervised learning. To implement the learning algorithm in hardware, synapse circuits were paralleled for additional quantization levels. The hardware-in-the-loop learning system allocated 2-5 hidden neurons for parity problems. Also, a 7 x 7 assignment problem was mapped onto a cascaded 64-neuron fully connected feedback network. In 100 randomly selected problems, the network found optimal or good solutions in most cases, with settling times in the range of 7-100 microseconds.

Duong, T.↗

Statistical analysis of piloted simulation of real time trajectory optimization algorithms

A simulation of time-optimal intercept algorithms for on-board computation of control commands is described. The effects of three different display modes and two different computation modes on the pilots' ability to intercept a moving target in minimum time were tested. Both computation modes employed singular perturbation theory to help simplify the two-point boundary value problem associated with trajectory optimization. Target intercept time was affected by both the display and computation modes chosen, but the display mode chosen was the only significant influence on the miss distance.

Price, D. B.↗

Rolling Horizon with K-Position Search Method for Strategic Deconfliction of Package Delivery UAS

In this research, the strategic deconfliction of unmanned aircraft systems for an urban package delivery environment with two depots and multiple drop-off locations is studied. This research aims to formulate a mathematical model to compute both the departure sequence and scheduled time of departure for each unmanned aircraft system at a depot, considering temporal constraints at en-route crossing waypoints and depots for strategic deconfliction. However, the problem formulation results in an NP-hard mixed-integer nonlinear programming problem for the global optimal solution, so instead, a "rolling horizon with𝑘-position search"heuristic method is developed. The simulation studies show that an increase in the value of𝑘(the parameter used to determine the size of the local neighborhood) reduces the average ground delay at the cost of an increase in the computation time for a given problem size. The study also shows an order of magnitude increase in the maximum number of flights scheduled with the integration of rolling horizon (time decomposition) compared to those without the integration of rolling horizon in the heuristic algorithm for a given computation time cut off.

UTM↗

A Rigorous Framework for Optimization of Expensive Functions by Surrogates

The goal of the research reported here is to develop rigorous optimization algorithms to apply to some engineering design problems for which design application of traditional optimization approaches is not practical. This paper presents and analyzes a framework for generating a sequence of approximations to the objective function and managing the use of these approximations as surrogates for optimization. The result is to obtain convergence to a minimizer of an expensive objective function subject to simple constraints. The approach is widely applicable because it does not require, or even explicitly approximate, derivatives of the objective. Numerical results are presented for a 31-variable helicopter rotor blade design example and for a standard optimization test example.

Booker, Andrew J.↗