Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal 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 1,783 records · Page 99
All sourcesNASA NTRSDOE OSTI
NASA NTRS2011

Optimal Padding for the Two-Dimensional Fast Fourier Transform

One-dimensional Fast Fourier Transform (FFT) operations work fastest on grids whose size is divisible by a power of two. Because of this, padding grids (that are not already sized to a power of two) so that their size is the next highest power of two can speed up operations. While this works well for one-dimensional grids, it does not work well for two-dimensional grids. For a two-dimensional grid, there are certain pad sizes that work better than others. Therefore, the need exists to generalize a strategy for determining optimal pad sizes. There are three steps in the FFT algorithm. The first is to perform a one-dimensional transform on each row in the grid. The second step is to transpose the resulting matrix. The third step is to perform a one-dimensional transform on each row in the resulting grid. Steps one and three both benefit from padding the row to the next highest power of two, but the second step needs a novel approach. An algorithm was developed that struck a balance between optimizing the grid pad size with prime factors that are small (which are optimal for one-dimensional operations), and with prime factors that are large (which are optimal for two-dimensional operations). This algorithm optimizes based on average run times, and is not fine-tuned for any specific application. It increases the amount of times that processor-requested data is found in the set-associative processor cache. Cache retrievals are 4-10 times faster than conventional memory retrievals. The tested implementation of the algorithm resulted in faster execution times on all platforms tested, but with varying sized grids. This is because various computer architectures process commands differently. The test grid was 512 512. Using a 540 540 grid on a Pentium V processor, the code ran 30 percent faster. On a PowerPC, a 256x256 grid worked best. A Core2Duo computer preferred either a 1040x1040 (15 percent faster) or a 1008x1008 (30 percent faster) grid. There are many industries that can benefit from this algorithm, including optics, image-processing, signal-processing, and engineering applications.

Dean, Bruce H.↗
DOE OSTI2023

Optimizing Fast Charging and Wetting in Lithium-Ion Batteries with Optimal Microstructure Patterns Identified by Genetic Algorithm

To sustain the high-rate current required for fast charging electric vehicle batteries, electrodes must exhibit sufficiently high effective ionic diffusion. Additionally, to reduce battery manufacturing costs, wetting time must decrease. Both of these issues can be addressed by structuring the electrodes with mesoscale pore channels. However, their optimal spatial distribution, or patterns, is unknown. Herein, a genetic algorithm has been developed to identify these optimal patterns using a CPU-cheap proxy distance-based model to evaluate the impact of the added pore networks. Both coin-cell and pouch cell form factors have been considered for the wetting analysis, with their respective electrolyte infiltration mode. Regular hexagonal and mud-crack-like patterns, respectively, for fast charging and fast wetting were found to be optimal and have been compared with pre-determined, easier to manufacture, patterns. The model predicts that using cylindrical channels arranged in a regular hexagonal pattern is ∼6.25 times more efficient for fast charging as compared to grooved lines with both structuring strategies being restricted to a 5% electrode total volume loss. The model also shows that only a very limited electrode volume loss (1%–2%) is required to dramatically improve the wetting (5–20 times) compared to an unstructured electrode.

25 ENERGY STORAGE↗
NASA NTRS1993

Robust on-off pulse control of flexible space vehicles

The on-off reaction jet control system is often used for attitude and orbital maneuvering of various spacecraft. Future space vehicles such as the orbital transfer vehicles, orbital maneuvering vehicles, and space station will extensively use reaction jets for orbital maneuvering and attitude stabilization. The proposed robust fuel- and time-optimal control algorithm is used for a three-mass spacing model of flexible spacecraft. A fuel-efficient on-off control logic is developed for robust rest-to-rest maneuver of a flexible vehicle with minimum excitation of structural modes. The first part of this report is concerned with the problem of selecting a proper pair of jets for practical trade-offs among the maneuvering time, fuel consumption, structural mode excitation, and performance robustness. A time-optimal control problem subject to parameter robustness constraints is formulated and solved. The second part of this report deals with obtaining parameter insensitive fuel- and time- optimal control inputs by solving a constrained optimization problem subject to robustness constraints. It is shown that sensitivity to modeling errors can be significantly reduced by the proposed, robustified open-loop control approach. The final part of this report deals with sliding mode control design for uncertain flexible structures. The benchmark problem of a flexible structure is used as an example for the feedback sliding mode controller design with bounded control inputs and robustness to parameter variations is investigated.

Wie, Bong↗
DOE OSTI2024

Studying Transient Phenomena in Thin Films with Reinforcement Learning

Neutron reflectometry has long been a powerful tool to study the interfacial properties of energy materials. Recently, time-resolved neutron reflectometry has been used to better understand transient phenomena in electrochemical systems. Those measurements often comprise a large number of reflectivity curves acquired over a narrow q range, with each individual curve having lower information content compared to a typical steady-state measurement. In this work, we present an approach that leverages existing reinforcement learning tools to model time-resolved data to extract the time evolution of structure parameters. Further, by mapping the reflectivity curves taken at different times as individual states, we use the Soft Actor-Critic algorithm to optimize the time series of structure parameters that best represent the evolution of an electrochemical system. We show that this approach constitutes an elegant solution to the modeling of time-resolved neutron reflectometry data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1993

Optimization by decomposition

An algorithm is presented for solving the structural optimization problem as a set of smaller subproblems that correspond to levels of nested substructures. In all three of the algorithm variants presented, the matching was assisted by means of the behavior and optimum sensitivity derivatives. The algorithm is noted to be intrinsically germane to distributed computing, since the subproblems can be concurrently addressed; the algorithm can also be generalized to those multidisciplinary systems whose subsystems can be arranged into a hierarchy of substructure-like dependencies.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRS2004

Applying Squeaky-Wheel Optimization Schedule Airborne Astronomy Observations

We apply the Squeaky Wheel Optimization (SWO) algorithm to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The problem contains complex constraints relating the feasibility of an astronomical observation to the position and time at which the observation begins, telescope elevation limits, special use airspace, and available fuel. Solving the problem requires making discrete choices (e.g. selection and sequencing of observations) and continuous ones (e.g. takeoff time and setting up observations by repositioning the aircraft). The problem also includes optimization criteria such as maximizing observing time while simultaneously minimizing total flight time. Previous approaches to the problem fail to scale when accounting for all constraints. We describe how to customize SWO to solve this problem, and show that it finds better flight plans, often with less computation time, than previous approaches.

Frank, Jeremy↗
NASA NTRS1992

Using adaptive grid in modeling rocket nozzle flow

The mechanical behavior of a rocket motor internal flow field results in a system of nonlinear partial differential equations which cannot be solved analytically. However, this system of equations called the Navier-Stokes equations can be solved numerically. The accuracy and the convergence of the solution of the system of equations will depend largely on how precisely the sharp gradients in the domain of interest can be resolved. With the advances in computer technology, more sophisticated algorithms are available to improve the accuracy and convergence of the solutions. An adaptive grid generation is one of the schemes which can be incorporated into the algorithm to enhance the capability of numerical modeling. It is equivalent to putting intelligence into the algorithm to optimize the use of computer memory. With this scheme, the finite difference domain of the flow field called the grid does neither have to be very fine nor strategically placed at the location of sharp gradients. The grid is self adapting as the solution evolves. This scheme significantly improves the methodology of solving flow problems in rocket nozzles by taking the refinement part of grid generation out of the hands of computational fluid dynamics (CFD) specialists and place it into the computer algorithm itself.

Chow, Alan S.↗
NASA NTRS1986

Optimal take-off trajectories in the presence of windshear

The present consideration of takeoff trajectory optimization in eight different fundamental problems involving wind shears assumes that the power setting is held at the maximum value, and that the aircraft is controlled with respect to angle-of-attack. While the first three problems are least-squares ones of the Bolza type, the remaining five are minimax problems of the Chebyshev type which can be converted to Bolza type by means of suitable transformations. All problems are solved on the basis of the dual sequential gradient-restoration algorithm for optimal control problems. The trajectory solutions obtained are superior to constant angle-of-attack trajectories.

Miele, A.↗
NASA NTRS2017

Computationally Efficient Motion Planning Algorithms for Agile Autonomous Vehicles in Cluttered Environments

Fast, real-time motion planning of an agile, autonomous vehicle in a cluttered environment, with many geometrically-fixed obstacles, is a very complex problem, especially because of the vehicle dynamics constraints and resource constrained computational capabilities onboard the vehicle. In this paper, we present computationally-efficient versions of our novel motion planning algorithm called the Spherical Expansion and Sequential Convex Programming (SE–SCP) algorithm. The SE–SCP algorithm first uses a spherical-expansion-based randomized sampling algorithm to explore the workspace. Oncea path is found from the start position to the goal position, the algorithm computes a locally optimal trajectory, within its homotopy class for a desired cost function, by solving a sequence of convex optimization problems. Thus, the SE–SCP algorithm is anytime locally optimal and the trajectory is globally optimal if the number of samples tends to infinity. In this paper, we further enhance the computational efficiency of the SE–SCP algorithm using uni-directional and bi-directional rewiring techniques. We also present a detailed proof of the local optimality characteristics of the new SE–SCP algorithms for aspecial case of vehicle dynamics. Simulation examples involving quadrotor and spacecraft help demonstrate the effectiveness of our new algorithms.

Bandyopadhyay, Saptarshi↗
DOE OSTI2022

Enabling DER Participation in Frequency Regulation Markets

Distributed energy resources (DERs) are playing an increasing role in ancillary services for the bulk grid, particularly in frequency regulation. In this article, we propose a framework for collections of DERs, combined to form microgrids and controlled by aggregators, to participate in frequency regulation markets. Our approach covers both the identification of bids for the market clearing stage and the mechanisms for the real-time allocation of the regulation signal. The proposed framework is hierarchical, consisting of a top layer and a bottom layer. The top layer consists of the aggregators communicating in a distributed fashion to optimally disaggregate the regulation signal requested by the system operator. The bottom layer consists of the DERs inside each microgrid whose power levels are adjusted so that the tie line power matches the output of the corresponding aggregator in the top layer. The coordination at the top layer requires the knowledge of cost functions, ramp rates, and capacity bounds of the aggregators. We develop meaningful abstractions for these quantities respecting the power flow constraints and taking into account the load uncertainties and propose a provably correct distributed algorithm for optimal disaggregation of regulation signals among the microgrids.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

"Traffic Control via Connected and Automated Vehicles: An Open-Road Field Experiment with 100 CAVs"

The CIRCLES project aims to reduce instabilities in traffic flow, which are naturally occurring phenomena due to human driving behavior. These "phantom jams" or "stop-and-go waves,"are a significant source of wasted energy. Toward this goal, the CIRCLES project designed a control system referred to as the MegaController by the CIRCLES team, that could be deployed in real traffic. Our field experiment leveraged a heterogeneous fleet of 100 longitudinally-controlled vehicles as Lagrangian traffic actuators, each of which ran a controller with the architecture described in this paper. The MegaController is a hierarchical control architecture, which consists of two main layers. The upper layer is called Speed Planner, and is a centralized optimal control algorithm. It assigns speed targets to the vehicles, conveyed through the LTE cellular network. The lower layer is a control layer, running on each vehicle. It performs local actuation by overriding the stock adaptive cruise controller, using the stock on-board sensors. The Speed Planner ingests live data feeds provided by third parties, as well as data from our own control vehicles, and uses both to perform the speed assignment. The architecture of the speed planner allows for modular use of standard control techniques, such as optimal control, model predictive control, kernel methods and others, including Deep RL, model predictive control and explicit controllers. Depending on the vehicle architecture, all onboard sensing data can be accessed by the local controllers, or only some. Control inputs vary across different automakers, with inputs ranging from torque or acceleration requests for some cars, and electronic selection of ACC set points in others. The proposed architecture allows for the combination of all possible settings proposed above. Most configurations were tested throughout the ramp up to the MegaVandertest.

Lee, Jonathan↗
NASA NTRS2019

Optimization of a Remote Sensing Energy Balance Method over Different Canopy Applied at Global Scale

Parameterization methods which calculate turbulent heat and water fluxes with thermal remote sensing data were evaluated in the revised remote sensing surface energy balance system (SEBS) model (Chen et al., 2013). The model calculates sensible heat (H) based on the Monin-Obukhov similarity theory (MOST) and determines latent heat (LE) as the residual of energy balance. We examined the uncertainties of H and LE in the SEBS model due to five key parameters at the local station point scale. Observations at 27 flux towers located in seven land cover types (needle-leaf forest, broad leaf forest, shrub, savanna, grassland, cropland, and sparsely vegetated land) and an artificial intelligence particle swarm optimization (PSO) algorithm was combined to calibrate the five parameters (leaf drag coefficient, leaf heat transfer coefficients, roughness length for soil, and two parameters for ground heat calculation) in the SEBS model. The root-mean-square error at the site scale was reduced by 9 W/sq.m for H, and 92 W/sq.m for LE, and their correlation coefficients were increased by 0.07 (H) and 0.11 (LE) after using the calibrated parameters. The updated model validation was further conducted globally for the remotely sensed evapotranspiration (ET) calculations. Overestimation of SEBS global ET was significantly improved by using the optimized values of the parameters. The results suggested PSO was able to consistently locate the global optimum of the SEBS model, and appears to be capable of solving the ET model optimization problem.

Chen, Xuelong↗
NASA NTRSDate not supplied

A NASA Perspective on Quantum AI, Error Correction, and Beyond

Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiments to quantum chips that can outperform even the largest supercomputers on specialized computational tasks, these noisy-intermediate scale quantum (NISQ) processors are still too small and non-robust to be directly useful for any real-world applications. We discuss the prospects for quantum computing and AI, highlighting advances in algorithms, both near- and longer-term. Quantum error correction is critical to the realization of any such vision. The talk with touch on some recent exciting advanced in quantum error correction, particularly in dynamical codes. The talk will conclude with an example of how the combination of quantum computing and artificial intelligence can help probe fundamental aspect of quantum physics.

quantum optimization algorithms and sampling↗
DOE OSTI2017

Planning Framework for Mesolevel Optimization of Urban Runoff Control Schemes

A planning framework is developed to optimize runoff control schemes at scales relevant for regional planning at an early stage. The framework employs less sophisticated modeling approaches to allow a practical application in developing regions with limited data sources and computing capability. The methodology contains three interrelated modules: (1)the geographic information system (GIS)-based hydrological module, which aims at assessing local hydrological constraints and potential for runoff control according to regional land-use descriptions; (2)the grading module, which is built upon the method of fuzzy comprehensive evaluation. It is used to establish a priority ranking system to assist the allocation of runoff control targets at the subdivision level; and (3)the genetic algorithm-based optimization module, which is included to derive Pareto-based optimal solutions for mesolevel allocation with multiple competing objectives. The optimization approach describes the trade-off between different allocation plans and simultaneously ensures that all allocation schemes satisfy the minimum requirement on runoff control. Our results highlight the importance of considering the mesolevel allocation strategy in addition to measures at macrolevels and microlevels in urban runoff management. (C) 2016 American Society of Civil Engineers.

Zhou, Qianqian↗
DOE OSTI2018

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successive convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1984

On-line determination of optimal flight paths for helicopters

A procedure for computing fuel optimal fixed range trajectories is developed for helicopters. The algorithm uses a simplified dynamic model and a climb-cruise-descent assumption which simplifies the variational problem to an algebraic minimization. Development of the performance model is discussed extensively and representative results for the S-61 and S-76 helicopters are presented. The results show that the model and optimization algorithm are small enough and simple enough to be incorporated into an on-line optimization algorithm.

Slater, G. L.↗
DOE OSTI2015

Artificial Neural Network as the FPGA Trigger in the Cyclone V based Front-End for a Detection of Neutrino-Origin Showers

Neutrinos play a fundamental role in the understanding of the origin of ultra-high-energy cosmic rays. They interact through charged and neutral currents in the atmosphere generating extensive air showers. However, their a very low rate of events potentially generated by neutrinos is a significant challenge for a detection technique and requires both sophisticated algorithms and high-resolution hardware. A trigger based on a artificial neural network was implemented into the Cyclone{sup R} V E FPGA 5CEFA9F31I7 - the heart of the prototype Front-End boards developed for tests of new algorithms in the Pierre Auger surface detectors. Showers for muon and tau neutrino initiating particles on various altitudes, angles and energies were simulated in CORSICA and Offline platforms giving pattern of ADC traces in Auger water Cherenkov detectors. The 3-layer 12-8-1 neural network was taught in MATLAB by simulated ADC traces according the Levenberg-Marquardt algorithm. Results show that a probability of a ADC traces generation is very low due to a small neutrino cross-section. Nevertheless, ADC traces, if occur, for 1-10 EeV showers are relatively short and can be analyzed by 16-point input algorithm. We optimized the coefficients from MATLAB to get a maximal range of potentially registered events and for fixed-point FPGA processing to minimize calculation errors. New sophisticated triggers implemented in Cyclone{sup R} V E FPGAs with large amount of DSP blocks, embedded memory running with 120 - 160 MHz sampling may support a discovery of neutrino events in the Pierre Auger Observatory. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2016

TU-FG-BRB-03: Basis Vector Model Based Method for Proton Stopping Power Estimation From Experimental Dual Energy CT Data

Purpose: This work aims at reducing the uncertainty in proton stopping power (SP) estimation by a novel combination of a linear, separable basis vector model (BVM) for stopping power calculation (Med Phys 43:600) and a statistical, model-based dual-energy CT (DECT) image reconstruction algorithm (TMI 35:685). The method was applied to experimental data. Methods: BVM assumes the photon attenuation coefficients, electron densities, and mean excitation energies (I-values) of unknown materials can be approximated by a combination of the corresponding quantities of two reference materials. The DECT projection data for a phantom with 5 different known materials was collected on a Philips Brilliance scanner using two scans at 90 kVp and 140 kVp. The line integral alternating minimization (LIAM) algorithm was used to recover the two BVM coefficient images using the measured source spectra. The proton stopping powers are then estimated from the Bethe-Bloch equation using electron densities and I-values derived from the BVM coefficients. The proton stopping powers and proton ranges for the phantom materials estimated via our BVM based DECT method are compared to ICRU reference values and a post-processing DECT analysis (Yang PMB 55:1343) applied to vendorreconstructed images using the Torikoshi parametric fit model (tPFM). Results: For the phantom materials, the average stopping power estimations for 175 MeV protons derived from our method are within 1% of the ICRU reference values (except for Teflon with a 1.48% error), with an average standard deviation of 0.46% over pixels. The resultant proton ranges agree with the reference values within 2 mm. Conclusion: Our principled DECT iterative reconstruction algorithm, incorporating optimal beam hardening and scatter corrections, in conjunction with a simple linear BVM model, achieves more accurate and robust proton stopping power maps than the post-processing, nonlinear tPFM based DECT analysis applied to conventional reconstructions of low and high energy scans. Funding Support: NIH R01CA 75371; NCI grant R01 CA 149305.

60 APPLIED LIFE SCIENCES↗