Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hybrid 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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Recursive dynamics algorithm for multibody systems with prescribed motion

This paper uses spatial operator techniques to develop a new algorithm for the dynamics of multibody systems with hinges undergoing prescribed motion. This algorithm is spatially recursive, and its computational complexity grows only linearly with the number of degrees of freedom in the system. Its structure is a hybrid of known recursive forward and inverse dynamics algorithms for regular multibody systems. Changes to the prescribed/nonprescribed nature of hinges can be implemented during run time since they are handled with very low overhead in the algorithm.

Jain, Abhinandan↗
NASA NTRS1989

Satellite cloud retrieval - Past, present, future

Satellite cloud observation is reviewed, including past accomplishments, current problems, and possible future developments. Past and current cloud retrieval algorithms are discussed, noting efforts to overcome various problems associated with cloud retrieval. The Hybrid Bispectral Threshold Method (Minnis and Harrison, 1984), the CO2 slicing algorithm (Chahine, 1974) and the ISCCEP algorithm (Rossow et al., 1985) are considered. An error analysis is presented for the determination of reference cloud fraction from Landsat TM data. The implications of the preliminary results from the First ISCCP Regional Experiment are examined and plans for future research projects are given.

Wielicki, Bruce A.↗
NASA NTRS1999

Weighted MinMax Algorithm for Color Image Quantization

The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique called weighted MinMax that is a hybrid between the MinMax and Linde-Buzo-Gray (LBG) algorithms is also described. The weighted MinMax algorithm incorporates activity weighting and seeks to minimize WRMSE, whereby obtaining high quality quantized images with significantly less visual distortion than the MinMax algorithm.

Reitan, Paula J.↗
NASA NTRS2008

Parallel Implementation of the Recursive Approximation of an Unsupervised Hierarchical Segmentation Algorithm

The hierarchical image segmentation algorithm (referred to as HSEG) is a hybrid of hierarchical step-wise optimization (HSWO) and constrained spectral clustering that produces a hierarchical set of image segmentations. HSWO is an iterative approach to region grooving segmentation in which the optimal image segmentation is found at N(sub R) regions, given a segmentation at N(sub R+1) regions. HSEG's addition of constrained spectral clustering makes it a computationally intensive algorithm, for all but, the smallest of images. To counteract this, a computationally efficient recursive approximation of HSEG (called RHSEG) has been devised. Further improvements in processing speed are obtained through a parallel implementation of RHSEG. This chapter describes this parallel implementation and demonstrates its computational efficiency on a Landsat Thematic Mapper test scene.

Tilton, James C.↗
NASA NTRS1986

A numerical algorithm for optimal feedback gains in high dimensional LQR problems

A hybrid method for computing the feedback gains in linear quadratic regulator problems is proposed. The method, which combines the use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated so as to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantage of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed and numerical evidence of the efficacy of our ideas presented.

Banks, H. T.↗
NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.,

McCarty, Steven L.↗
NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.

McCarty, Steven L.↗
DOE OSTI2023

Improved melt model for power flow

Accelerators that drive z-pinch experiments transport current densities in excess of 1 MA/cm 2 in order to melt or ionize the target and implode it on axis. These high current densities stress the transmission lines upstream from the target, where rapid electrode heating causes plasma formation, melt, and possibly vaporization. These plasmas negatively impact accelerator efficiency by diverting some portion of the current away from the target, referred to as “current loss”. Simulations that are able to reproduce this behavior may be applied to improving the efficiency of existing accelerators and to designing systems operating at ever higher current densities. The relativistic particle-in-cell code CHICAGO ® is the primary code for modeling power flow on Sandia National Laboratories’ Z accelerator. We report here on new algorithms that incorporate vaporization and melt into the standard power-flow simulation framework. Taking a hybrid approach, the CHICAGO® kinetic/multi-fluid treatment has been expanded to include vaporization while the quasi-neutral equation-of-motion has been updated for melt at high current-densities. For vaporization, a new one-dimensional substrate model provides a more accurate calculation of electrode thermal, mass, and magnetic field diffusion as well as a means of emitting absorbed contaminants and vaporized metal ions. A quasi-fluid model has been implemented expressly to mimic the motion of imploding liners for accurate inductance histories. For melt, a multi-ion Hall-MHD option has been implemented and benchmarked against Alegra MHD. This new model is described with sufficient detail to reproduce these algorithms in any hybrid kinetic code. Physics results from the new code are also presented. A CHICAGO ® Hall-MHD simulation of a radial transmission line demonstrates that Hall physics, not included in Alegra, has no significant impact on the diffusion of electrode material. When surface contaminant desorption is mocked in as a hydrogen surface plasma, both the surface and bulk-material plasmas largely compress under the influence of the j × B force. Similar results are seen in Alegra, which also shows magnetic and material diffusion scaling with peak current. Test vaporization simulations using MagLIF and a power-flow experimental geometry show Fe + ions diffuse only a few hundred µm from the electrodes, so present models of Z power flow remain valid.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Co-Optimization of Velocity and Charge-Depletion for Plug-In Hybrid Electric Vehicles: Accounting for Acceleration and Jerk Constraints

Abstract Recent advances in vehicle connectivity and automation technologies promote advanced control algorithms that co-optimize the longitudinal dynamics and powertrain operation of hybrid electric vehicles. Typically, a sequential optimization with the vehicle dynamics optimized followed by powertrain optimization is adopted to manage a number of complexities such as the inherent mixed-integer nature of the hybrid powertrain, the numerous state and control variables, the differing time scales of vehicle and powertrain subsystems, time-varying state constraints, and large horizon lengths. Instead, we solve the offline optimization problem in a centralize manner assuming exact knowledge of the lead vehicle's position over the entire trip by applying a discrete-time single shooting-based numerical approach, Discrete Mixed-Integer Shooting (DMIS), including a linearly increasing computational complexity to the problem horizon. In particular, the hierarchical problem structure is exploited to decompose the computationally intensive Hamiltonian minimization step into a set of low-dimensional optimizations. DMIS allows us to compute the direct fuel minimization problem including the vehicle and powertrain dynamics in a centralized manner to its full horizon while systematically tuning weighting factors that penalize passenger discomfort. For the first time, this study reveals that practically implemented sequential optimization exhibits similar fuel optimality as co-optimization when a certain level of passenger comfort is required.

Automation & Control Systems↗
DOE OSTI2021

Coreset Clustering on Small Quantum Computers

Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigated using this paradigm to perform k-means clustering on near-term quantum computers, by casting it as a QAOA optimization instance over a small coreset. We used numerical simulations to compare the performance of this approach to classical k-means clustering. We were able to find data sets with which coresets work well relative to random sampling and where QAOA could potentially outperform standard k-means on a coreset. However, finding data sets where both coresets and QAOA work well—which is necessary for a quantum advantage over k-means on the entire data set—appears to be challenging.

42 ENGINEERING↗
NASA NTRSDate not supplied

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗
DOE OSTI2020

A novel active optimization approach for rapid and efficient design space exploration using ensemble machine learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) which fits high-level information about the response surface, and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner, is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected to be evaluated using expensive function evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. This methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface. The performance of the new active learning approach is compared with traditional global optimization methods, namely micro-genetic algorithm (pGA) and particle swarm optimization (PSO). It is demonstrated that the new optimizer is able to reach the global optimum much faster with a significantly fewer number of function evaluations. Subsequently, the new optimizer is also applied to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is again found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to particle swarm and genetic algorithm-based optimization techniques.

Machine learning, active learning, design optimiza↗
DOE OSTI2020

A Novel Active Optimization Approach for Rapid and Efficient Design Space Exploration Using Ensemble Machine Learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) that fits high-level information about the response surface and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected for evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. Additionally, this methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface and, subsequently, to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to conventional optimization techniques, such as particle swarm and genetic algorithm-based optimization techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2023

Control and Scaling Approach for the Emulation of Dynamic Subscale Torque Loads

Research and development of electrified aircraft propulsion powertrains are relying on the use of electromechanical systems to emulate turbomachinery/rotor loads. Replacing a physical turbomachinery/rotor with a model driving a subscale electromechanical system capable of emulating subscale torque loads and responses is a lower risk, lower cost alternative to using the full-scale turbomachinery/rotor for initial control system verification. This paper outlines a novel control and scaling approach for emulating dynamic subscale torque loads using electric machine (EM) hardware for electrified aircraft propulsion research and development purposes. The approach, known as the Sliding Mode Impedance Controller with Scaling (SMICS), drives a mechanically coupled, two-EM system to behave like a subscale hardware representation of a hybrid-electric turbomachinery shaft. One EM reflects the inertial dynamics and torque load of the subscale turbomachinery under steady-state and transient operation while the second EM represents a motor/generator connected to the shaft, which is intended to hybridize the turbomachinery. This closed loop control and scaling algorithm applies impedance and sliding mode control schemes, along with parameter scaling, to match subscale, desired dynamics in real-time and to allow this system to be driven by a full-scale hybrid-electric turbomachinery model and control. The paper elaborates on the concept of the closed loop control and scaling approach and explains the significance of using impedance and sliding mode control. It shows a derivation of the closed loop control and scaling algorithm, its implementation, and presents a comparison of theoretical and actual simulation results acquired during hardware-in-the-loop testing of a partial turboelectric propulsion concept aircraft at the NASA Electric Aircraft Testbed (NEAT).The results show that the intended dynamic responses of the hardware and the aircraft model are achieved in both the time and frequency domain. Full scale propulsion control systems can be tested using this hardware and software approach.

Emulation↗
DOE OSTI2025

Hydrogen-Battery Hybrid Energy System on Repurposed Offshore Platforms for Efficient Clean-Energy Transition

Due to the rising global energy demand and enhanced awareness of the environmental impact of fossil fuels, the Gulf of Mexico, traditionally known for oil extraction, offers a distinct chance to repurpose the existing offshore infrastructure. With the depletion of oil reserves, it is feasible to adapt previously utilized floating platforms for extraction to generate renewable energy, specifically through wind-generated power and hydrogen production. This adaptation seeks to promote a transport system that is more ecologically friendly in the future. Offshore wind turbines serve as the main energy source, with help from battery storage and hydrogen production to enhance the overall system performance, hydrogen creation, fuel, and electricity delivery for sustainable energy production. The system is divided into two distinct cases, each evaluated for cost, performance, and feasibility, with a focus on minimizing both the Levelized Cost of Energy (LCOE) and the Levelized Cost of Hydrogen (LCOH). The first case examines the integration of offshore wind turbines with hydrogen production. Excess electricity generated by wind turbines is directed toward hydrogen production via electrolysis. The hydrogen produced can be used as fuel for vehicles or transported to the shore via pipelines. The second case investigates a technology that combines wind turbines with battery storage. The batteries possess an ability to supply electricity for a continuous duration of 4 hours maximum each day. The main objective is to reduce the LCOE by considering the battery's charging and discharging cycles, together with the uncertain attributes of wind power and battery deterioration. The produced energy can be distributed for onshore applications or utilized for the purpose of offsetting offshore loads such as subsea oil and gas production, transportation, etc. The offshore hydrogen-battery hybrid system is improved via three advanced algorithms, Particle Swarm Optimization (PSO), and Grey Wolf Optimizer (GWO). In Case 1, PSO improves hydrogen production by efficiently managing the electrolyzer’s power consumption, decreasing production costs significantly. Particle Swarm Optimization (PSO) is applied to improve the efficiency of the electrolyzer, reducing production costs and achieving an optimized CAPEX of $240.00 million (from an initial $300.00 million) and OPEX of $9.60 million per year. This system produces 4,720,000 kg of hydrogen annually, with a Levelized Cost of Hydrogen (LCOH) of $6.40/kg and an annual profit of $9.27 million. In Case 2, GWO effectively reduces the overall energy cost by improving the charge-discharge management of batteries, which extends battery life and optimizes their use. The second case focuses on integrating battery storage, optimized using the Grey Wolf Optimizer (GWO), which enhances battery charge-discharge cycles, extending battery life and lowering costs. This system achieves an optimized CAPEX of $204.80 million (from an initial $256.00 million) and OPEX of $9.29 million per year, producing 310883.39 MWh of electricity annually at a Levelized Cost of Energy (LCOE) of $86.13/MWh, with an annual profit of $6.25 million. The implementation of a comprehensive strategy results in a substantial reduction in costs, improved energy efficiency, and a dependable supply of both electric power and hydrogen, emphasizing the benefits of converting offshore oil platforms for clean energy transition. This study explores a clean strategy to enable cost-effective repurposing of offshore O&G platforms. Both cases highlight the economic and technical feasibility of transitioning offshore oil platforms to clean energy systems, demonstrating substantial cost reductions and reliable energy and hydrogen supplies for sustainable energy production.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Final Technical Report for "Cloud-based Low-Scaling Quantum Chemistry Simulations for Materials"

The objective of phase I was to develop the basic infrastructure for performing efficient hybrid DFT calculations on solid materials with a turnaround time amenable to the use in large-scale data-driven approaches. To fulfill the goal we have developed a novel algorithm that significantly reduces the cost of exchange matrix formation. The algorithm does so by making use of three ingredients (a) interpolative decomposition of the electron integrals (b) robust pseudospectral method and (c) occ-RI approach. Our published work demonstrates that the algorithm is orders of magnitude faster than any other hybrid-DFT method and is on the order of only 3-4 times slower than pure DFT. All steps of the algorithm developed during phase I can be accelerated to the point that, for large enough systems, the diagonalization of the Fock matrix will become the most expensive step. To treat such large systems we have created an interface to the ASCR-funded PEXSI library. The PEXSI method is used to compute the density matrix directly from the Fock matrix in a manner that preserves the sparsity of the local representation.

Shiozaki, Toru↗