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,747 records · Page 97
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

An optimization of the FPGA trigger based on the artificial neural network for a detection of neutrino-origin showers

Observations of ultra-high energy neutrinos became a priority in experimental astro-particle physics. Up to now, the Pierre Auger Observatory did not find any candidate on a neutrino event. This imposes competitive limits to the diffuse flux of ultra-high energy neutrinos in the EeV range and above. 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 prototype Front-End boards for Auger-Beyond-2015 with Cyclone{sup R} V E can test the neural network algorithm in real pampas conditions in 2015. 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-10-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. For 100 EeV range traces are much longer, but with significantly higher amplitudes, which can be detected by standard threshold algorithms. 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. Currently used Front-End boards based on no-more produced ACEXR PLDs and obsolete Cyclone{sup R} FPGAs allow an implementation of relatively simple threshold algorithms for triggers. New sophisticated trigger implemented in Cyclone{sup R} V E FPGAs with large amount of DSP blocks, embedded memory running with 120 - 160 MHz sampling may support to discover neutrino events in the Pierre Auger Observatory. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
NASA NTRS1992

Tracing the efficient curve for multi-objective control-structure optimization

A recently developed active set algorithm for tracing parameterized optima is adapted to multiobjective optimization. The algorithm traces a path of Kuhn-Tucker points using homotopy curve tracking techniques, and is based on identifying and maintaining the set of active constraints. Second order necessary optimality conditions are used to determine nonoptimal stationary points on the path. In the bi-objective optimization case the algorithm is used to trace the curve of efficient solution (Pareto optima). As an example, the algorithm is applied to the simultaneous minimization of the weight and control force of a ten-bar truss with two collocated sensors and actuators, with some interesting results.

Rakowska, J.↗
NASA NTRS2000

Algorithmic Perspectives on Problem Formulations in MDO

This work is concerned with an approach to formulating the multidisciplinary optimization (MDO) problem that reflects an algorithmic perspective on MDO problem solution. The algorithmic perspective focuses on formulating the problem in light of the abilities and inabilities of optimization algorithms, so that the resulting nonlinear programming problem can be solved reliably and efficiently by conventional optimization techniques. We propose a modular approach to formulating MDO problems that takes advantage of the problem structure, maximizes the autonomy of implementation, and allows for multiple easily interchangeable problem statements to be used depending on the available resources and the characteristics of the application problem.

Alexandrov, Natalia M.↗
DOE OSTI2020

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

ADMM↗
DOE OSTI2020

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM: Preprint

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Interaction networks for the identification of boosted H → $b\overline b$ decays

We develop an algorithm based on an interaction network to identify high-transverse-momentum Higgs bosons decaying to bottom quark-antiquark pairs and distinguish them from ordinary jets that reflect the configurations of quarks and gluons at short distances. The algorithm's inputs are features of the reconstructed charged particles in a jet and the secondary vertices associated with them. Describing the jet shower as a combination of particle-to-particle and particle-to-vertex interactions, the model is trained to learn a jet representation on which the classification problem is optimized. The algorithm is trained on simulated samples of realistic LHC collisions, released by the CMS Collaboration on the CERN Open Data Portal. The interaction network achieves a drastic improvement in the identification performance with respect to state-of-the-art algorithms.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1990

Active rejection of persistent disturbances in flexible space structures

A dynamic compensator for active rejection of persistent disturbances in flexible space structures is designed on the principle of the H(infinity)-optimization of the sensitivity transfer function matrix. A general state space solution is formulated to the multiinput multioutput H(infinity)-optimal control problem, allowing the use of the H(infinity)-optimal synthesis algorithm for the state-space models of space structures that result from model order reduction. Disturbances encountered in flexible space structures, such as shuttle docking, are investigated using the high-mode and the reduced-order models of a cantilevered two-bay truss, demonstrating the applicability of the H(infinity)-optimal approach.

Hwang, Cheng-Neng↗
DOE OSTI2017

Understanding the Hierarchy of Dense Subgraphs in Stationary and Temporally Varying Setting

Graphs are widely used to model relationships in a wide variety of domains such as sociology, bioinformatics, infrastructure, the WWW, to name a few. One of the key observations is that while real-world graphs are often globally sparse, they are locally dense. In other words, the average degree is often quite small (say at most 10 in a million vertex graph), but vertex neighborhoods are often dense. Finding dense subgraphs is a critical aspect of graph mining It has been used for finding communities and spam link farms in web graphs, graph visualization, real-time story identification, DNA motif detection in biological networks, finding correlated genes, epilepsy prediction, finding price value motifs in financial data, graph compression, distance query indexing, and increasing the throughput of social networking site servers. However, most standard formulations of this problem (like clique, quasi-clique, k-densest subgraph) are NP-hard. Furthermore, current dense subgraph finding algorithms usually optimize some objective, and only find a few such subgraphs without providing any structural relations, whereas the goal is rarely to find the "true optimum," but to identify many (if not all) dense substructures, understand their distribution in the graph, and ideally determine relationships among them. In this project, we first aim to devise algorithms and provide 3 implementations with nice visualizations to find the hierarchy between dense subgraphs, and then understand the structure of the hierarchy to gain more insight on the hidden patterns in real-world networks. Another important aspects in graph analysis is the temporal nature of networks. Networks evolve over time and in many applications data arrives at a high velocity, and thus it is important to design algorithms that can process data efficiently. We report three main results towards identifying dense structures in large evolving graphs. First, we will show how the hierarchical connectedness structure can be maintained efficiently, where connectedness is defined by increasing levels of connectivity strength. Next, we present dense structure can be identified in bipartite graphs without building projection graphs. And finally, we present a new method for peeling algorithms This new approach avoids sequential nature of peeling algorithms and is amenable to parallelization, which is crucial for processing high velocity data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Data-driven learning of nonlocal models: from high-fidelity simulations to constitutive laws

We show that machine learning can improve the accuracy of simulations of stress waves in one-dimensional composite materials. We propose a data-driven technique to learn nonlocal constitutive laws for stress wave propagation models. The method is an optimization-based technique in which the nonlocal kernel function is approximated via Bernstein polynomials. The kernel, including both its functional form and parameters, is derived so that when used in a nonlocal solver, it generates solutions that closely match high-fidelity data. The optimal kernel therefore acts as a homogenized nonlocal continuum model that accurately reproduces wave motion in a smaller-scale, more detailed model that can include multiple materials. We apply this technique to wave propagation within a heterogeneous bar with a periodic microstructure. Several one-dimensional numerical tests illustrate the accuracy of our algorithm. The optimal kernel is demonstrated to reproduce high-fidelity data for a composite material in applications that are substantially different from the problems used as training data.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Optimization of a Residential Air Source Heat Pump using Refrigerants with GWP <150 for Improved Performance and Reduced Emission

Using low-GWP refrigerants can reduce the Green House Gas (GHG) emission of heat pump systems. Heat exchangers and compressors are the key components and have a prominent impact on system performance, significant research is devoted to reducing the cost of the heat exchangers while achieving the same or better system performance with refrigerant charge reduction.To better understand the environmental impacts of optimized systems with low-GWP refrigerants, Life Cycle Climate Performance (LCCP) evaluation method was used to evaluate the direct and indirect emissions of the system over the course of its lifetime from manufacturing to disposal. The DOE/ORNL Heat Pump Design Model (HPDM) is used to evaluate the performance of heat pumps. Multi-objective optimizations using Particle Swarm Optimization (PSO) algorithm are performed on a 3-ton R410A residential air source heat pump on market. Seven R410A alternatives, i.e., R32, R454B, R454C, R455A, R457A, R1234yf and R1234ze(E) are investigated. The last five fluids have GWP lower than 150.As a result, 5.5%-12.8% seasonal energy efficiency ratio 2 (SEER2) improvement is achieved, and the optimized systems reduce life cycle CO2 emission by 8.5%-28.6% with GWP lower than 150 refrigerants. The optimal heat exchangers can fit into the original R410A fan-coil units; therefore, the proposed design method establishes a production and installation path to produce cost-effective low-GWP heat pumps easily accepted by end users.

Li, Zhenning↗
NASA NTRS2019

Understanding Machine Learning in Earth Science: A Natural Language Processing Approach

Machine learning (ML) is being increasingly utilized in Earth science research. Benefits of ML include efficiency, reduction of human error, and ability to extract hidden patterns within data. However, the mutual lack of each other’s domain knowledge by ML and Earth science stands as a barrier to timely and effective implementation. Earth science, in particular, faces challenges in generating sample data, compared to those of traditional ML problems such as face recognition or stock predictions, where data is abundant and not lacking in ground truth, which is necessary for labeling. Earth science data are more varying in formats, such as HDF5 and image resolutions, and are not standardized across instruments, even within a given Earth science discipline. Previous studies have been done to outline the specific challenges that Earth science faces with ML, while others have focused on using existing publications to mine information efficiently. Other resources such as Scikit-Learn have developed decision trees for choosing appropriate machine learning algorithms, but application within Earth science subjects becomes much more complex. For the current study, we propose a methodology and tool that aids in implementation of ML in Earth science using natural language processing (NLP). Our work comprises three main parts: (1) analyzing existing publications related to ML and Earth science, using natural language processing: (2) extracting from the publications information on ML models subjects in Earth Science: and (3) visualizing the extracted relationships as a network graph. The resulting network graph should aid the Earth science communities in applying optimal ML algorithms and guiding data preparation through visualization of similar studies. The network graph and analysis of document similarity will be the basis of our next step, which is to develop a decision tree for selecting optimal machine learning methodologies for specified Earth science applications.

Zheng, Laura↗
DOE OSTI2024

SNNVis: Visualizing Graph Embedding of Evolutionary Optimization for Spiking Neural Networks

While Spiking Neural Networks (SNNs) show a lot of promise, it is difficult to optimize them because applying traditional gradient-based optimization techniques is difficult. Even though evolutionary algorithms (EAs) have been shown to promise to optimize SNNs, understanding the relationship between evolving the characteristics of SNNs and their performance to improve the optimization algorithm is challenging because of the complex characteristics and huge population size. We propose visual analytics with novel graph embedding for evolutionary SNNs to address the challenges. While existing graph embedding techniques have limitations in preserving the specific features of the nodes and edges, our approach maintains them. Also, we develop visual analytics for understanding the relationship between the network performance and the features of nodes and edges and exploring and analyzing the evolving SNNs to build insights into improving the EA.

Chae, Junghoon [ORNL] (ORCID:0000000206016746)↗
DOE OSTI2025

Data-Enabled Fusion Technology (Final Scientific/Technical Report)

Advancing Scientific Understanding in Fusion Energy and Machine Learning This research represented a significant step forward in machine learning (ML) applications for fusion energy experiments. The project integrated advanced data-driven modeling, optimization techniques, and artificial intelligence to enhance the predictive capabilities and operational efficiency of plasma-based fusion systems. Specifically, tasks focused on ML-enhanced diagnostics, operator guidance tools, and predictive modeling helped improve the ability to interpret complex fusion experiments. Key areas of advancement included: 1) data-driven plasma control, i.e., using ML algorithms to optimize experimental conditions and classify plasma behaviors based on historical data; 2) spectroscopy and diagnostics, i.e., applying AI models to extract previously inaccessible insights from experimental spectroscopy data; and 3) configuration mapping and operator guidance, i.e., developing a predictive framework to assist scientists in identifying the most effective experimental parameters, reducing reliance on manual adjustments. By refining these ML-driven techniques, the project contributed to the broader scientific community’s understanding of plasma dynamics and fusion energy viability. Technical Effectiveness and Economic Feasibility The methods investigated demonstrated high technical effectiveness, as reflected in milestones assessing the predictive accuracy, performance, and optimization of fusion configurations. The development of an Operator Guidance Tool (OGT), for example, led to more precise control of plasma conditions by learning from experimental data and offering real-time adjustments. From an economic standpoint, DeFT provided: 1) the ability to reduce trial-and-error experimentation, which lowered operational costs; 2) improved data interpretation methods, which enabled more efficient resource allocation in large-scale fusion research projects; and 3) the automation of key diagnostic tasks, which reduced manual labor and human error, increasing overall efficiency. 13 The final assessments of predictive models and optimization strategies demonstrated that these approaches were scalable and could be implemented across multiple fusion energy research programs. Public Benefit and Societal Impact This project contributed directly to the broader goal of achieving sustainable and commercially viable fusion energy, which had profound implications for clean energy production and climate change mitigation. The integration of AI-driven solutions into fusion research: 1) sped up scientific discovery, accelerating progress towards achieving energy breakthroughs; 2) reduced the cost of experimentation, making fusion research more accessible; and 3) provided a framework for future AI applications in high-energy physics, benefiting adjacent fields like space exploration, material science, and renewable energy. Additionally, by fostering collaborations between AI researchers and plasma physicists, this project promoted interdisciplinary innovation that could lead to broader applications beyond fusion research.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

SU-G-JeP1-10: Feasibility of CyberKnife Tracking Using the Previously-Implanted Permanent Brachytherapy Seed Cloud

Purpose: Robotic radiosurgery is a salvage treatment option for patients with recurrent prostate cancer. We explored the feasibility of tracking the bolus of permanent prostate implants (PPI) using image recognition software optimized to track spinal anatomy. Methods: Forty-five inert iodine seeds were implanted into a gelatin-based prostate phantom. Four superficial gold seeds were inserted to provide ground-truth alignment. A CT scan of the phantom (120 kVp, 1 mm slice thickness) was acquired and a single-energy iterative metal artifact reduction (MAR) algorithm was used to enhance the quality of the DRR used for tracking. CyberKnife treatment plans were generated from the MAR CT and regular CT (no-MAR) using spine tracking. The spine-tracking grid was centered on the bolus of seeds and resized to encompass the full seed cloud. A third plan was created from the regular CT scan, using fiducial tracking based on the 4 superficial gold seeds with identical align-center coordinates. The phantom was initially aligned using the fiducial-tracking plan. Then the MAR and no-MAR spine-tracking plans were loaded without moving the phantom. Differences in couch correction parameters were recorded in the case of perfect alignment and after the application of known rotations and translations (roll/pitch of 2 degrees; translations XYZ of 2 cm). Results: The spine tracking software was able to lock on to the bolus of seeds and provide couch corrections both in the MAR and no-MAR plans. In all cases, differences in the couch correction parameters from fiducial alignment were <0.5 mm in translations and <1 degree in rotations. Conclusion: We were able to successfully track the bolus of seeds with the spine-tracking grid in phantom experiments. For clinical applications, further investigation and developments to adapt the spine-tracking algorithm to optimize for PPI seed cloud tracking is needed to provide reliable tracking in patients. One of the authors (MD) has received research support and speaker honoraria from Accuray.

60 APPLIED LIFE SCIENCES↗
NASA NTRS2002

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

Sobieszczanski-Sobieski, Jaroslaw↗
NASA NTRSDate not supplied

ISRU Pilot Excavator - Development of Autonomous Excavation Algorithms

The ISRU Pilot Excavator (IPEx) is a Space Technology Mission Directorate (STMD) Game Changing Development (GCD) project to develop a robotic excavator to demonstrate excavation of up to 10 metric tons of lunar regolith. IPEx is based on the Regolith Advanced Surface Systems Operations Robot (RASSOR) excavator developed at NASA Kennedy Space Center (KSC) and utilizes a counter rotating bucket drum concept to balance excavation forces for use on reduced gravity planetary bodies. To take advantage of the counter rotating bucket drum mechanism, work is being done to develop new autonomous excavation strategies and algorithms. Referred to as “Auto-dig”, these algorithms will allow IPEx to excavate, drive, and deliver its target mass of 10 metric tons of lunar regolith during an 11-day mission semi-autonomously. Due to bandwidth and latency constraints teleoperation will be kept to a minimum, with operators periodically confirming and verifying the excavator’s high-level tasks and operations. While the work to develop optimized autodig solutions is ongoing at KSC, early tests have yielded interesting results that have led to the discovery of additional risks that need to be mitigated in autonomous excavation. Testing has also encouraged the development of new software and visualization tools that provide real-time insight into excavation loads during operation, allowing faster development and helping build better intuition to the excavation process. These tools will help in the pursuit to develop fully optimized digging algorithms that are robust enough to handle hazards such as rocks or irregular terrain.

B. C. Buckles↗
NASA NTRS1997

Biweekly Maps of Wind Stress for the North Pacific from the ERS-1 Scatterometer

The European Remote-sensing Satellite (ERS-1) was launched in July 1991 and contained several instruments for observing the Earth's ocean including a wind scatterometer. The scatterometer measurements were processed by the European Space Agency (ESA) and the Jet Propulsion Laboratory (JPL). JPL reprocessed (Freilich and Dunbar, 1992) the ERS-1 backscatter measurements to produced a 'value added' data set that contained the ESA wind vector as well as a set of up to four ambiguities. These ambiguities were further processed using a maximum-likelihood estimation (MLE) and a median filter to produce a 'selected vector.' This report describes a technique developed to produce time-averaged wind field estimates with their expected errors using only scatterometer wind vectors. The processing described in this report involved extracting regions of interest from the data tapes, checking the quality and creating the wind field estimate. This analysis also includes the derivation of biweekly average wind vectors over the North Pacific Ocean at a resolution of 0.50 x 0.50. This was done with an optimal average algorithm temporally and an over-determined biharmonic spline spatially. There have been other attempts at creating gridded wind files from ERS-1 winds, e.g., kriging techniques (Bentamy et al., 1996) and successive corrections schemes (Tang and Liu, 1996). There are several inherent problems with the ERS-1 scatterometer. Since this is a multidisciplinary mission, the satellite is flown in different orbits optimized for each phase of the mission. The scatterometer also shares several sub-systems with the Synthetic Aperture Radar (SAR) and cannot be operated while the SAR is in operation. The scatterometer is also a single-sided instrument and only measures backscatter along the right side of the satellite. The processing described here generates biweekly wind maps during the wktwo years analysis period regardless of the satellite orbit or missing data.

SYNTHETIC APERTURE RADAR↗