Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization algorithms”

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 703 records · Page 39

Flight assessment of the onboard propulsion system model for the Performance Seeking Control algorithm on an F-15 aircraft

Performance Seeking Control (PSC), an onboard, adaptive, real-time optimization algorithm, relies upon an onboard propulsion system model. Flight results illustrated propulsion system performance improvements as calculated by the model. These improvements were subject to uncertainty arising from modeling error. Thus to quantify uncertainty in the PSC performance improvements, modeling accuracy must be assessed. A flight test approach to verify PSC-predicted increases in thrust (FNP) and absolute levels of fan stall margin is developed and applied to flight test data. Application of the excess thrust technique shows that increases of FNP agree to within 3 percent of full-scale measurements for most conditions. Accuracy to these levels is significant because uncertainty bands may now be applied to the performance improvements provided by PSC. Assessment of PSC fan stall margin modeling accuracy was completed with analysis of in-flight stall tests. Results indicate that the model overestimates the stall margin by between 5 to 10 percent. Because PSC achieves performance gains by using available stall margin, this overestimation may represent performance improvements to be recovered with increased modeling accuracy. Assessment of thrust and stall margin modeling accuracy provides a critical piece for a comprehensive understanding of PSC's capabilities and limitations.

Orme, John S.↗

A homotopy algorithm for digital optimal projection control GASD-HADOC

The linear-quadratic-gaussian (LQG) compensator was developed to facilitate the design of control laws for multi-input, multi-output (MIMO) systems. The compensator is computed by solving two algebraic equations for which standard closed-loop solutions exist. Unfortunately, the minimal dimension of an LQG compensator is almost always equal to the dimension of the plant and can thus often violate practical implementation constraints on controller order. This deficiency is especially highlighted when considering control-design for high-order systems such as flexible space structures. This deficiency motivated the development of techniques that enable the design of optimal controllers whose dimension is less than that of the design plant. A homotopy approach based on the optimal projection equations that characterize the necessary conditions for optimal reduced-order control. Homotopy algorithms have global convergence properties and hence do not require that the initializing reduced-order controller be close to the optimal reduced-order controller to guarantee convergence. However, the homotopy algorithm previously developed for solving the optimal projection equations has sublinear convergence properties and the convergence slows at higher authority levels and may fail. A new homotopy algorithm for synthesizing optimal reduced-order controllers for discrete-time systems is described. Unlike the previous homotopy approach, the new algorithm is a gradient-based, parameter optimization formulation and was implemented in MATLAB. The results reported may offer the foundation for a reliable approach to optimal, reduced-order controller design.

Collins, Emmanuel G., Jr.↗

Application of the Differential Evolution Method to Solving Inverse Transport Problems

The differential evolution method, a powerful stochastic optimization algorithm that mimics the process of evolution in nature, is applied to inverse transport problems with several unknown parameters of mixed types, including interface location identification, source composition identification, and material mass density identification, in spherical and cylindrical radioactive source/shield systems. In spherical systems, measurements of leakages of discrete gamma-ray lines are assumed, while in cylindrical systems, measurements of scalar fluxes of discrete lines at points outside the system are assumed. The performance of the differential evolution algorithm is compared to the Levenberg-Marquardt method, a standard gradient-based technique, and the covariance matrix adaptation evolution strategy, another stochastic technique, on a variety of numerical test problems with several (i.e., three or more) unknown parameters. Numerical results indicate that differential evolution is the most adept method for finding the global optimum for these problems. In spherical geometry, differential evolution implemented serially is run-time competitive with gradient-based methods, while a parallel version of differential evolution would be run-time competitive with gradient-based techniques in cylindrical geometry. A hybrid differential evolution/Levenberg-Marquardt method is also introduced, and numerical results indicate that it can be a fast and robust optimizer for inverse transport problems.

99 GENERAL AND MISCELLANEOUS↗

Comparison of polynomial approximations and artificial neural nets for response surfaces in engineering optimization

Engineering optimization problems involve minimizing some function subject to constraints. In areas such as aircraft optimization, the constraint equations may be from numerous disciplines such as transfer of information between these disciplines and the optimization algorithm. They are also suited to problems which may require numerous re-optimizations such as in multi-objective function optimization or to problems where the design space contains numerous local minima, thus requiring repeated optimizations from different initial designs. Their use has been limited, however, by the fact that development of response surfaces randomly selected or preselected points in the design space. Thus, they have been thought to be inefficient compared to algorithms to the optimum solution. A development has taken place in the last several years which may effect the desirability of using response surfaces. It may be possible that artificial neural nets are more efficient in developing response surfaces than polynomial approximations which have been used in the past. This development is the concern of the work.

Carpenter, William C.↗

Solving a system of linear equations: From centralized to distributed methods

For a wide range of control engineering applications, the problem of solving a system of linear equations is often encountered and has been well studied. Traditionally, this problem has been mainly solved in a centralized manner. However, for applications related to large-scale complex networked systems, centralized algorithms are often subjected to some practical issues due to limited computational power and communication bandwidth. As a promising and viable alternative, distributed algorithms can effectively address the issues associated with centralized algorithms by solving the problem efficiently in a multi-agent setting that accords with the distributed nature of networked systems. Distributed algorithms decompose the entire problem into many sub-problems that are solved by individual agents in a cooperative manner. In this survey paper, we provide a detailed overview of the state of the art relevant to distributed algorithms for solving a system of linear equations. We will first review basic distributed algorithms including both discrete-time and continuous-time algorithms. Then we will discuss the extended algorithms to achieve communication efficiency. Furthermore, we will also introduce distributed algorithms to obtain the minimum-norm solution for a system of linear equations with multiple solutions, as well as the least-squares solutions when there is no solution. Finally, the relationship of distributed algorithms for solving a system of linear equations to the existing distributed optimization algorithms is discussed.

Wang, Peng↗

Optimal environmental and economic performance trade-offs for fifth generation district heating and cooling network topologies with waste heat recovery

Network topology greatly influences both the economic and environmental performance of fifth generation district heating and cooling (5GDHC) systems. In this study the optimal trade-offs between the environmental and economic performance of 5GDHC network topologies for a five-building district with waste heat recovery were explored. A life cycle assessment method was used to calculate the total life cycle CO 2 emissions (LCCO2) associated with the installation and operation of various network topologies. Twelve months of empirical data from a data center cooling system were analyzed to assess its suitability for integration into a 5GDHC system. The most suitable method for utilizing this waste heat was selected based on the ambient loop warm pipe setpoint, waste heat temperature, and district energy system configuration. A multi-objective optimization algorithm was used to select the 5GDHC network topology that provided the optimal trade-off between LCCO2 and life cycle cost (LCC). A trade-off parameter was employed to weigh the importance of each objective in the selection process. The results showed waste heat from the data center was suitable for integration into the 5GDHC system due to its availability and consistent temperature profile. When return temperatures of 25 °C or higher were available from the liquid-cooled system, direct pre-heating of the ambient loop warm pipe was found to be the most effective waste heat integration method. The selection of the network topology that provided the optimal trade-off between LCCO2 and LCC (optimal trade-off topology) was highly dependent on factors such as fuel prices, CO 2 prices, electricity CO 2 emissions factors, availability of waste heat, embodied CO 2 emissions associated with network installation and network infrastructure costs. Optimal trade-off topologies produced substantial LCCO2 reductions relative to corresponding LCC increases. LCCO2 reduction to LCC increase ratios from 5.78 to 117.79 were identified with CO 2 offset costs ranging from 4.77 to 60.08 ($/tCO 2 e).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Identifying Optimal Measurement Subspace for the Ensemble Kalman Filter

To reduce the computational load of the ensemble Kalman filter while maintaining its efficacy, an optimization algorithm based on the generalized eigenvalue decomposition method is proposed for identifying the most informative measurement subspace. When the number of measurements is large, the proposed algorithm can be used to make an effective tradeoff between computational complexity and estimation accuracy. This algorithm also can be extended to other Kalman filters for measurement subspace selection.

99 GENERAL AND MISCELLANEOUS↗

Computing single step operators of logic programming in radial basis function neural networks

Logic programming is the process that leads from an original formulation of a computing problem to executable programs. A normal logic program consists of a finite set of clauses. A valuation I of logic programming is a mapping from ground atoms to false or true. The single step operator of any logic programming is defined as a function (T{sub p}:I→I). Logic programming is well-suited to building the artificial intelligence systems. In this study, we established a new technique to compute the single step operators of logic programming in the radial basis function neural networks. To do that, we proposed a new technique to generate the training data sets of single step operators. The training data sets are used to build the neural networks. We used the recurrent radial basis function neural networks to get to the steady state (the fixed point of the operators). To improve the performance of the neural networks, we used the particle swarm optimization algorithm to train the networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SU-F-E-09: Respiratory Signal Prediction Based On Multi-Layer Perceptron Neural Network Using Adjustable Training Samples

Purpose: Dynamic tracking of moving organs, such as lung and liver tumors, under radiation therapy requires prediction of organ motions prior to delivery. The shift of moving organ may change a lot due to huge transform of respiration at different periods. This study aims to reduce the influence of that changes using adjustable training signals and multi-layer perceptron neural network (ASMLP). Methods: Respiratory signals obtained using a Real-time Position Management(RPM) device were used for this study. The ASMLP uses two multi-layer perceptron neural networks(MLPs) to infer respiration position alternately and the training sample will be updated with time. Firstly, a Savitzky-Golay finite impulse response smoothing filter was established to smooth the respiratory signal. Secondly, two same MLPs were developed to estimate respiratory position from its previous positions separately. Weights and thresholds were updated to minimize network errors according to Leverberg-Marquart optimization algorithm through backward propagation method. Finally, MLP 1 was used to predict 120∼150s respiration position using 0∼120s training signals. At the same time, MLP 2 was trained using 30∼150s training signals. Then MLP is used to predict 150∼180s training signals according to 30∼150s training signals. The respiration position is predicted as this way until it was finished. Results: In this experiment, the two methods were used to predict 2.5 minute respiratory signals. For predicting 1s ahead of response time, correlation coefficient was improved from 0.8250(MLP method) to 0.8856(ASMLP method). Besides, a 30% improvement of mean absolute error between MLP(0.1798 on average) and ASMLP(0.1267 on average) was achieved. For predicting 2s ahead of response time, correlation coefficient was improved from 0.61415 to 0.7098.Mean absolute error of MLP method(0.3111 on average) was reduced by 35% using ASMLP method(0.2020 on average). Conclusion: The preliminary results demonstrate that the ASMLP respiratory prediction method is more accurate than MLP method and can improve the respiration forecast accuracy.

60 APPLIED LIFE SCIENCES↗

A set of test problems for nonlinear optimization

The software is a set of test problems for nonlinear optimization algorithms, including subroutines such as linear algebra routines and automatic differentiation algorithms. The test problems come from chemical engineering open literature, and describe optimization tasks related to the design and operation of processes such as carbon capture, Hydrogen production, heat exchange, and distillation.

Parker, Robert↗

Determination of the size distribution of metallic nanoparticles by optical extinction spectroscopy

A method is proposed to estimate the size distribution of nearly spherical metallic nanoparticles (NPs) from optical extinction spectroscopy (OES) measurements based on Mie's theory and an optimization algorithm. The described method is compared against two of the most widely used techniques for the task: transmission electron microscopy (TEM) and small-angle x-ray scattering (SAXS). The size distribution of Au and Cu NPs, obtained by ion implantation in silica and a subsequent thermal annealing in air, was determined by TEM, grazing-incidence SAXS (GISAXS) geometry, and our method, and the average radius obtained by all the three techniques was almost the same for the two studied metals. Concerning the radius dispersion (RD), OES and GISAXS give very similar results, while TEM considerably underestimates the RD of the distribution.

36 MATERIALS SCIENCE↗

Learning Interactions in Complex Biological Systems

In this project, we developed novel methods for integrating simulation and data-driven methods to accelerate biomedical discovery. In particular, we exploit agent-based models of disease processes and deep reinforcement learning to identify potential novel multi-drug, patient-specific, and adaptive therapeutic strategies. We use the Innate Immune Response agent-based model (IIRABM) to model sepsis as a demonstration of our approach. We first calibrate the agent-based model using novel stochastic optimization algorithms develop in this project, then use the calibrated model to identify optimal cytokine mediation strategies using deep reinforcement learning (DRL). The learned policy achieves a dramatic reduction in mortality over a set of 500 simulated patients relative to standalone antibiotic therapy. Advantages of our approach are three-fold: 1) the use of simulation allows exploring therapeutic strategies beyond clinical practice and available data, 2) advances in DRL accommodate learning complex therapeutic strategies for complex biological systems, and 3) optimized treatments respond to a patient’s individual disease progression over time, therefore capturing both differences across patients and the inherent randomness of disease progression within a single patient. We hope that this work motivates both considering adaptive, personalized multi-cytokine mediation therapy for sepsis and exploiting simulation with DRL for precision medicine more broadly.

59 BASIC BIOLOGICAL SCIENCES↗

Optimal design of composite hip implants using NASA technology

Using an adaptation of NASA software, we have investigated the use of numerical optimization techniques for the shape and material optimization of fiber composite hip implants. The original NASA inhouse codes, were originally developed for the optimization of aerospace structures. The adapted code, which was called OPORIM, couples numerical optimization algorithms with finite element analysis and composite laminate theory to perform design optimization using both shape and material design variables. The external and internal geometry of the implant and the surrounding bone is described with quintic spline curves. This geometric representation is then used to create an equivalent 2-D finite element model of the structure. Using laminate theory and the 3-D geometric information, equivalent stiffnesses are generated for each element of the 2-D finite element model, so that the 3-D stiffness of the structure can be approximated. The geometric information to construct the model of the femur was obtained from a CT scan. A variety of test cases were examined, incorporating several implant constructions and design variable sets. Typically the code was able to produce optimized shape and/or material parameters which substantially reduced stress concentrations in the bone adjacent of the implant. The results indicate that this technology can provide meaningful insight into the design of fiber composite hip implants.

Blake, T. A.↗

Fleet Assignment Using Collective Intelligence

Airline fleet assignment involves the allocation of aircraft to a set of flights legs in order to meet passenger demand, while satisfying a variety of constraints. Over the course of the day, the routing of each aircraft is determined in order to minimize the number of required flights for a given fleet. The associated flow continuity and aircraft count constraints have led researchers to focus on obtaining quasi-optimal solutions, especially at larger scales. In this paper, the authors propose the application of an agent-based integer optimization algorithm to a "cold start" fleet assignment problem. Results show that the optimizer can successfully solve such highly- constrained problems (129 variables, 184 constraints).

Antoine, Nicolas E.↗

A class solution for volumetric-modulated arc therapy planning in postprostatectomy radiotherapy

This study is aimed to test a postprostatectomy volumetric-modulated arc therapy (VMAT) planning class solution. The solution applies to both the progressive resolution optimizer algorithm version 2 (PRO 2) and the algorithm version 3 (PRO 3), addressing the effect of an upgraded algorithm. A total of 10 radical postprostatectomy patients received 68 Gy to 95% of the planning target volume (PTV), which was planned using VMAT. Each case followed a set of planning instructions; including contouring, field setup, and predetermined optimization parameters. Each case was run through both algorithms only once, with no user interaction. Results were averaged and compared against Radiation Therapy Oncology Group (RTOG) 0534 end points. In addition, the clinical target volume (CTV) D{sub 100}, PTV D{sub 99}, and PTV mean doses were recorded, along with conformity indices (CIs) (95% and 98%) and the homogeneity index. All cases satisfied PTV D{sub 95} of 68 Gy and a maximum dose < 74.8 Gy. The average result for the PTV D{sub 99} was 64.1 Gy for PRO 2 and 62.1 Gy for PRO 3. The average PTV mean dose for PRO 2 was 71.4 Gy and 71.5 Gy for PRO 3. The CTV D{sub 100} average dose was 67.7 and 68.0 Gy for PRO 2 and PRO 3, respectively. The mean homogeneity index for both algorithms was 0.08. The average 95% CI was 1.17 for PRO 2 and 1.19 for PRO 3. For 98%, the average results were 1.08 and 1.12 for PRO 2 and PRO 3, respectively. All cases for each algorithm met the RTOG organs at risk dose constraints. A successful class solution has been established for prostate bed VMAT radiotherapy regardless of the algorithm used.

61 RADIATION PROTECTION AND DOSIMETRY↗

Orbit design and optimization based on global telecommunication performance metrics

The orbit selection of telecommunications orbiters is one of the critical design processes and should be guided by global telecom performance metrics and mission-specific constraints. In order to aid the orbit selection, we have coupled the Telecom Orbit Analysis and Simulation Tool (TOAST) with genetic optimization algorithms. As a demonstration, we have applied the developed tool to select an optimal orbit for general Mars telecommunications orbiters with the constraint of being a frozen orbit. While a typical optimization goal is to minimize tele-communications down time, several relevant performance metrics are examined: 1) area-weighted average gap time, 2) global maximum of local maximum gap time, 3) global maximum of local minimum gap time. Optimal solutions are found with each of the metrics. Common and different features among the optimal solutions as well as the advantage and disadvantage of each metric are presented. The optimal solutions are compared with several candidate orbits that were considered during the development of Mars Telecommunications Orbiter.

genetic algorithms↗

Optimization Methods for Large-Scale Machine Learning

Here this paper provides a review and commentary on the past, present, and future of numerical optimization algorithms in the context of machine learning applications. Through case studies on text classification and the training of deep neural networks, we discuss how optimization problems arise in machine learning and what makes them challenging. A major theme of our study is that large-scale machine learning represents a distinctive setting in which the stochastic gradient (SG) method has traditionally played a central role while conventional gradient-based nonlinear optimization techniques typically falter. Based on this viewpoint, we present a comprehensive theory of a straightforward, yet versatile SG algorithm, discuss its practical behavior, and highlight opportunities for designing algorithms with improved performance. This leads to a discussion about the next generation of optimization methods for large-scale machine learning, including an investigation of two main streams of research on techniques that diminish noise in the stochastic directions and methods that make use of second-order derivative approximations.

97 MATHEMATICS AND COMPUTING↗