Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic Optimization”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

SU-G-TeP1-10: Predicting Photon Percentage Depth Dose From Profile Due to Changes in Beam Quality

Purpose: To predict photon percentage depth dose (PDD) from profile due to a change in flattened (FF) and flattening-filter-free (FFF) beam quality. Methods: 6MV photon beam PDDs and profiles in a 3D water tank (3DW) and profiles in an ionization chamber array (ICP) were collected for different field sizes and depths with FF and FFF beams in a Versa HD (Elekta Ltd.). The energy was adjusted by changing the bending magnet current (BMC) ±15% from the clinical beam (6MV) in 5% increments. For baseline establishment, PDDs(depth≥3cm) were parameterized with bi-exponential functions and the PDD 20 to 10cm ratios (PDD{sub 20,10}) were calculated. Then, the FF profile at 10cm from the central axis (Pr{sub 10}) and the slope of the FFF central linear region (SFFF) were calculated. Calibration curves were established: (1) change in Pr{sub 10} and SFFF as functions of the change in PDD{sub 20,10} and (2) change in PDD(depth=3, 15 and 30cm) as function of the change in PDD{sub 20,10}. The differences between Pr{sub 10} and SFFF from baseline were calculated and, from calibration curves, changes in PDD{sub 20,10} and PDD(depth=3, 15 and 30cm) were obtained. Then, absolute PDD(depth=3, 15 and 30cm) values were input into a least-square-optimization algorithm to calculate the bi-exponential function’s optimal coefficients and generate the PDD(depths≥3cm). Results: The change in PDD{sub 20,10} relative to baseline increased (<±4%) with BMC. Pr{sub 10} increased (±6%) and SFFF decreased (±11%) with BMC. Relative differences between measured and calculated (i.e. PDD calculation from Pr{sub 10} and SFFF) PDDs were less than 1%. Results apply to FF and FFF beams measured in 3DW and ICP. Conclusion: Pr{sub 10} and SFFF are more sensitive than PDD to changes in beam energy and PDD information can be accurately generated from them. With known 3DW and ICP profile relationship, ICP can be used to obtain PDD for current photon beam.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

A Multi-Objective Approach for Optimizing Edge-Based Resource Allocation Using TOPSIS

Existing approaches for allocating resources on edge environments are inefficient and lack the support of heterogeneous edge devices, which in turn fail to optimize the dependency on cloud infrastructures or datacenters. To this extent, we propose in this paper OpERA, a multi-layered edge-based resource allocation optimization framework that supports heterogeneous and seamless execution of offloadable tasks across edge, fog, and cloud computing layers and architectures. By capturing offloadable task requirements, OpERA is capable of identifying suitable resources within nearby edge or fog layers, thus optimizing the execution process. Throughout the paper, we present results which show the effectiveness of our proposed optimization strategy in terms of reducing costs, minimizing energy consumption, and promoting other residual gains in terms of processing computations, network bandwidth, and task execution time. We also demonstrate that by optimizing resource allocation in computation offloading, it is then possible to increase the likelihood of successful task offloading, particularly for computationally intensive tasks that are becoming integral as part of many IoT applications such robotic surgery, autonomous driving, smart city monitoring device grids, and deep learning tasks. The evaluation of our OpERA optimization algorithm reveals that the TOPSIS MCDM technique effectively identifies optimal compute resources for processing offloadable tasks, with a 96% success rate. Moreover, the results from our experiments with a diverse range of use cases show that our OpERA optimization strategy can effectively reduce energy consumption by up to 88%, and operational costs by 76%, by identifying relevant compute resources.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Performance limits for optimal microburst encounter

An effort has been made to ascertain the envelope-edges for uneventful aircraft penetrations of microburst windshears on the basis of optimal aircraft control strategies. Over 1100 such trajectories have been computed for contemporary airliners and general aviation aircraft, in the case of idealized microbursts, using a successive quadratic program trajectory optimization algorithm able to directly handle inequality constraints. Variations of optimal performance with microburst type, intensity, length scale, and location, define performance limits; these limits fall into short, intermediate, and long microburst length scale regimes. The ability to safely transit a microburst also varies strongly with microburst location.

Psiaki, Mark L.↗
NASA NTRS1991

Designing laminated composites using random search techniques

A computer program called UWCODA is presented. UWCODA is intended to assist in the design, analysis and optimization of composite plates. UWCODA combines a state-of-the-art global optimization algorithm (Improving Hit and Run) with classical lamination theory. Optimization results are presented for simple loading conditions as well as for complex, biaxial load conditions. The computer code proved to be very effective in the design of composite plates.

Graesser, D. L.↗
NASA NTRS2014

Aeroelastic Optimization Study Based on the X-56A Model

One way to increase the aircraft fuel efficiency is to reduce structural weight while maintaining adequate structural airworthiness, both statically and aeroelastically. A design process which incorporates the object-oriented multidisciplinary design, analysis, and optimization (MDAO) tool and the aeroelastic effects of high fidelity finite element models to characterize the design space was successfully developed and established. This paper presents two multidisciplinary design optimization studies using an object-oriented MDAO tool developed at NASA Armstrong Flight Research Center. The first study demonstrates the use of aeroelastic tailoring concepts to minimize the structural weight while meeting the design requirements including strength, buckling, and flutter. Such an approach exploits the anisotropic capabilities of the fiber composite materials chosen for this analytical exercise with ply stacking sequence. A hybrid and discretization optimization approach improves accuracy and computational efficiency of a global optimization algorithm. The second study presents a flutter mass balancing optimization study for the fabricated flexible wing of the X-56A model since a desired flutter speed band is required for the active flutter suppression demonstration during flight testing. The results of the second study provide guidance to modify the wing design and move the design flutter speeds back into the flight envelope so that the original objective of X-56A flight test can be accomplished successfully. The second case also demonstrates that the object-oriented MDAO tool can handle multiple analytical configurations in a single optimization run.

flutter constraints↗
NASA NTRS2014

Aeroelastic Optimization Study Based on X-56A Model

A design process which incorporates the object-oriented multidisciplinary design, analysis, and optimization (MDAO) tool and the aeroelastic effects of high fidelity finite element models to characterize the design space was successfully developed and established. Two multidisciplinary design optimization studies using an object-oriented MDAO tool developed at NASA Armstrong Flight Research Center were presented. The first study demonstrates the use of aeroelastic tailoring concepts to minimize the structural weight while meeting the design requirements including strength, buckling, and flutter. A hybrid and discretization optimization approach was implemented to improve accuracy and computational efficiency of a global optimization algorithm. The second study presents a flutter mass balancing optimization study. The results provide guidance to modify the fabricated flexible wing design and move the design flutter speeds back into the flight envelope so that the original objective of X-56A flight test can be accomplished.

flutter constraints↗
DOE OSTI2018

An energy-aware multiobjective ant colony algorithm to minimize total completion time and energy cost on a single-machine preemptive scheduling

Energy-aware scheduling in manufacturing operations with time-of-use electricity tariffs is a challenging problem. Sustainable manufacturing is gaining significant momentum: companies are not only improving their product quality, but also optimizing the production processes to improve energy consumption (i.e., minimizing energy cost) in order to manage environmental challenges which contribute to global climate change. The purpose of this paper is to study a preemptive scheduling problem on a single-machine to minimize the total completion time and total energy cost under time-of-use electricity tariffs, which is a mixed-integer multiobjective mathematical programming model. To solve these objectives, we develop several new holistic ant colony optimization algorithms. The proposed model is solved via several methods including weighted sum method (WSM) using CPLEX, and multiobjective ant colony optimization based on a dominance ranking (ACO-DR) or based on a dominance ranking procedure and crowding distance comparison (ACO-DRC) or based on a heuristic approach to obtain an approximate Pareto-front and also provide information on when to start and resume each job for any solution on the Pareto-front. We provide detailed experimental results evaluating the performance of the proposed algorithms. In a case study, we demonstrate how the results of the multiobjective model could be utilized in decision making using the multiobjective optimization on the basis of ratio analysis (MOORA) method. Furthermore, this proposed model and heuristics allows decision makers to operate in challenging-data enabled environments in industrial internet of things ecosystem, and assists in optimizing production planning to improve energy cost.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2000

Improved Speech Coding Based on Open-Loop Parameter Estimation

A nonlinear optimization algorithm for linear predictive speech coding was developed early that not only optimizes the linear model coefficients for the open loop predictor, but does the optimization including the effects of quantization of the transmitted residual. It also simultaneously optimizes the quantization levels used for each speech segment. In this paper, we present an improved method for initialization of this nonlinear algorithm, and demonstrate substantial improvements in performance. In addition, the new procedure produces monotonically improving speech quality with increasing numbers of bits used in the transmitted error residual. Examples of speech encoding and decoding are given for 8 speech segments and signal to noise levels as high as 47 dB are produced. As in typical linear predictive coding, the optimization is done on the open loop speech analysis model. Here we demonstrate that minimizing the error of the closed loop speech reconstruction, instead of the simpler open loop optimization, is likely to produce negligible improvement in speech quality. The examples suggest that the algorithm here is close to giving the best performance obtainable from a linear model, for the chosen order with the chosen number of bits for the codebook.

Juang, Jer-Nan↗
DOE OSTI2024

Metric Learning to Accelerate Convergence of Operator Splitting Methods

Recent developments in machine learning have led to promising advances in accelerating the solution of constrained optimization problems. Increasing demand for real-time decision-making capabilities in applications such as artificial intelligence and optimal control has led to a variety of proposed strategies for learning to produce fast solutions to optimization problems. For example, recent works have shown that it is possible to accelerate the convergence of optimization algorithms by learning to select their parameters, such as gradient descent stepsizes. This work proposes a new approach, in which the underlying metric spaces of proximal operator splitting algorithms are learned to maximize convergence rate. While prior works in optimization theory have derived optimal metrics in simple cases, no such result exists for many practical problem forms including general Quadratic Programming (QP). This paper shows how differentiable optimization can enable the end-to-end learning of proximal metrics, enhancing the convergence of proximal algorithms for QP problems beyond what is possible based on known theory. Additionally, the results illustrate a strong connection between the learned proximal metrics and active constraints at the optima, leading to an interpretation in which the predicted proximal metrics can be viewed as a form of active set prediction.

King, Ethan [BATTELLE (PACIFIC NW LAB)]↗
NASA NTRS1988

Spatial compression of Seasat SAR imagery

The results of a study of techniques for spatial compression of synthetic-aperture-radar (SAR) imagery are summarized. Emphasis is on image-data volume reduction for archive and online storage applications while preserving the image resolution and radiometric fidelity. A quantitative analysis of various techniques, including vector quantization (VQ) and adaptive discrete cosine transform (ADCT), is presented. Various factors such as compression ratio, algorithm complexity, and image quality are considered in determining the optimal algorithm. The compression system requirements are established for electronic access of an online archive system based on the results of a survey of the science community. The various algorithms are presented and their results evaluated considering the effects of speckle noise and the wide dynamic range inherent in SAR imagery. The conclusion is that although the ADCT produces the best signal-to-distortion-noise ratio for a given compression ratio, the two-level tree-searched VQ technique is preferred due to its simplicity of decoding and near-optimal performance.

Chang, C. Y.↗
DOE OSTI2021

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

Genetic Algorithm for Hyperparameter Optimization in Gaussian Process Modeling

A genetic algorithm is developed and applied to optimize hyperparameters of convolutional recursively determined dual neural network-Gaussian process (NNGP) kernels. As a specific application of the combined GPNN-GA algorithm, it is applied to image classification in publicly available data of Hyper Suprime-Cam Subaru Strategic Program. Matthews correlation coefficient is calculated based on results of binary star-galaxy classification and used as a fitting function of the GA module of the algorithm. The simulation results confirm significant improvement of the classification accuracy with optimized hyperparameters.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Advancing the STS Neutron Moderator Design with an Automated Optimization Workflow and Unstructured Mesh Modeling

With the Second Target Station approaching its final design phase, a detailed neutronics evaluation of its critical components is necessary. Optimizing the dimensions of the two cold-source moderators that are at the heart of this facility presents a multi-objective optimization problem for which an accurate geometric description is crucial. We have applied a fully automated optimization workflow in which a detailed unstructured mesh geometry is automatically generated with Attila4MC, starting from a parametrized CREO geometry followed by preprocessing with SpaceClaim. With this geometry, a MCNP run is performed to calculate the brightness metrics, which are subsequently provided to the optimization algorithm in DAKOTA that provides new parameters and drives the optimization loop until convergence. In this paper, we show the results of the analysis that are used for the final design of the cylindrical and tube moderator. The optimization simulations provide a refinement to and confirmation of the conclusions of the previous design iteration. Additional to the optimization, a sensitivity study is performed to study the effect of minor geometry changes, which is important for the final engineering design. In conclusion, with these studies, we demonstrate that the automated workflow and high-fidelity unstructured mesh modeling are efficient tools for a thorough design evaluation.

DAKOTA↗
DOE OSTI2021

A Novel Framework for Optimizing Ramping Capability of Hybrid Energy Storage Systems

Hybrid Energy Storage System has been widely applied in aerospace, electric vehicle, and microgrid applications. The advantages are that they include complimentary technologies with both high power and energy capabilities. HESS have the potential to be useful to the bulk power systems, for example to increase the value of energy produced by variable generation resource through enabling participation in ancillary service markets. Actualizing the benefits of HESSs requires optimizing the combined ramping capability of aggregated HESS resources. To provide quality ancillary service, source of HESSs locating at multiple sites of variable generation resource must be optimally sized and cohesively controlled. Optimizing aggregated resources can be formulated as an optimization problem. Successfully solving this problem not only requires using effective solution methods but also depends on accurately and rapidly setting the necessary parameters in the problem formula. This article proposes a novel framework with double-layer structure to solve the optimization problem of aggregating ramping capability. Program developed on the upper layer focuses on solving the optimization of aggregating ramping capability among multiple HESSs and is compatible with most existing optimization algorithms. Program on lower layer of the framework targets at optimizing the local control of a single HESS based on a thorough analytics of HESS operation strategy presented in this article. Result of local optimization is also provided to upper layer program for updating the parameters in formula of optimization problem. Real time hardware-in-the-loop test is conducted to verify the performance of the optimization framework developed. The work presented is expected to provide guidance for implementing this framework in practical operation.

Luo, Yushen↗
DOE OSTI2019

Beyond Moore’s Law: Exploring the Future of Computation

Conclusions: Emerging computational hardware may fundamentally change optimization algorithm development; Ising Coprocessors are like ALUs or GPUs for optimization!; Based on initial benchmarking efforts D-Wave hardware is not outperforming state-of-the-art alternatives, but seems competitive

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

Data-Driven Optimization for the Design and Control of Large-Scale Systems (LDRD Final Report)

Engineering decisions are often formulated as optimization problems such as the optimal design or control of physical systems. In these applications, the resulting optimization problems are constrained by large-scale simulations involving systems of partial differential equations (PDEs), ordinary differential equations (ODEs), and differential algebraic equations (DAEs). In addition, critical components of these systems are fraught with uncertainty, including unverifiable modeling assumptions, unknown boundary and initial conditions, and uncertain coefficients. Typically, these components are estimated using noisy and incomplete data from a variety of sources (e.g., physical experiments). The lack of knowledge of the true underlying probabilistic characterization of model inputs motivates the need for optimal solutions that are robust to this uncertainty. In this report, we introduce a framework for handling "distributional" uncertainties in the context of simulation-based optimization. This includes a novel measure discretization technique that will lead to an adaptive optimization algorithm tailored to exploit the structures inherent to simulation- based optimization.

42 ENGINEERING↗
DOE OSTI2017

The Pointing Self-calibration Algorithm for Aperture Synthesis Radio Telescopes

This paper is concerned with algorithms for calibration of direction-dependent effects (DDE) in aperture synthesis radio telescopes (ASRT). After correction of direction-independent effects (DIE) using self-calibration, imaging performance can be limited by the imprecise knowledge of the forward gain of the elements in the array. In general, the forward gain pattern is directionally dependent and varies with time due to a number of reasons. Some factors, such as rotation of the primary beam with Parallactic Angle for Azimuth–Elevation mount antennas are known a priori. Some, such as antenna pointing errors and structural deformation/projection effects for aperture-array elements cannot be measured a priori. Thus, in addition to algorithms to correct for DD effects known a priori, algorithms to solve for DD gains are required for high dynamic range imaging. Here, we discuss a mathematical framework for antenna-based DDE calibration algorithms and show that this framework leads to computationally efficient optimal algorithms that scale well in a parallel computing environment. As an example of an antenna-based DD calibration algorithm, we demonstrate the Pointing SelfCal (PSC) algorithm to solve for the antenna pointing errors. Our analysis show that the sensitivity of modern ASRT is sufficient to solve for antenna pointing errors and other DD effects. We also discuss the use of the PSC algorithm in real-time calibration systems and extensions for antenna Shape SelfCal algorithm for real-time tracking and corrections for pointing offsets and changes in antenna shape.

79 ASTRONOMY AND ASTROPHYSICS↗