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,729 records · Page 96
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Smart Crop Farming Systems for Artemis Exploration Missions

Space crop production systems that mitigate risks of crew poor performance or illness due to inadequate food and nutrition are needed during manned Artemis exploration missions beyond LEO. Prototype farms must be designed for deployment on ISS and tested in manned platforms: Gateway, lunar habitats, and Mars trans-hab spacecraft in preparation for human missions to Mars. Food production must be optimal and safe for human consumption. Thus, plant growth facilities (i.e. Veggie and APH) can be enhanced with imaging systems (including hyperspectral, multispectral, lidar, and fluorescence imaging systems) for nondestructive monitoring of plant health, stress and assessing food safety. Databases of crop responses to stress obtained during ground studies can be used to develop novel artificial intelligence (AI) algorithms for optimizing crop production (i.e. environmental settings during growth) and for detecting crop indices that ensure food safety. Future farming systems should be sustainable and smart. Novel adaptive AI algorithms requiring limited data sets for calibration are needed for reducing crew intervention during plant cultivation except for maintenance and harvesting events. Eventually, AI driven control systems that include autonomous planting, growing, and harvesting as well as periodic sanitization need evaluation for supplementing crew diets with fresh produce during future Mars exploration missions.

O Monje↗
DOE OSTI2015

Scalable Parallel Methods for Analyzing Metagenomics Data at Extreme Scale

The field of bioinformatics and computational biology is currently experiencing a data revolution. The exciting prospect of making fundamental biological discoveries is fueling the rapid development and deployment of numerous cost-effective, high-throughput next-generation sequencing technologies. The result is that the DNA and protein sequence repositories are being bombarded with new sequence information. Databases are continuing to report a Moore’s law-like growth trajectory in their database sizes, roughly doubling every 18 months. In what seems to be a paradigm-shift, individual projects are now capable of generating billions of raw sequence data that need to be analyzed in the presence of already annotated sequence information. While it is clear that data-driven methods, such as sequencing homology detection, are becoming the mainstay in the field of computational life sciences, the algorithmic advancements essential for implementing complex data analytics at scale have mostly lagged behind. Sequence homology detection is central to a number of bioinformatics applications including genome sequencing and protein family characterization. Given millions of sequences, the goal is to identify all pairs of sequences that are highly similar (or “homologous”) on the basis of alignment criteria. While there are optimal alignment algorithms to compute pairwise homology, their deployment for large-scale is currently not feasible; instead, heuristic methods are used at the expense of quality. In this dissertation, we present the design and evaluation of a parallel implementation for conducting optimal homology detection on distributed memory supercomputers. Our approach uses a combination of techniques from asynchronous load balancing (viz. work stealing, dynamic task counters), data replication, and exact-matching filters to achieve homology detection at scale. Results for a collection of 2.56M sequences show parallel efficiencies of ~75-100% on up to 8K cores, representing a time-to-solution of 33 seconds. We extend this work with a detailed analysis of single-node sequence alignment performance using the latest CPU vector instruction set extensions. Preliminary results reveal that current sequence alignment algorithms are unable to fully utilize widening vector registers.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2019

Optimal Operation of Grid-Tied Energy Storage Systems Considering Detailed Device-Level Battery Models

The current optimization-based algorithms to operate grid-tied battery energy storage systems (BESS) typically do not look much under the hood of the BESS, i.e., the device-level characteristics of the batteries. This is often due to modeling as well as optimization complexities. However, simplified models may significantly degrade the performance of BESS operation in practice. Therefore, in this article, we propose a new BESS scheduling optimization framework that accounts for features such as cell-to-cell variations in maximum capacity, charge level balance, and internal resistance. The proposed framework is in the form of tractable mixed integer linear programs. Our approach is to estimate and update the device-level battery model parameters continuously, without the need to interrupt BESS normal operation. We validate the performance compared to an offline approach, which is based on dedicated model testing and calibration. To assure accurate performance evaluation, this article also includes developing a power hardware-in-the-loop testbed that allows for flexible operation and detailed monitoring of BESS under different design scenarios.

25 ENERGY STORAGE↗
DOE OSTI2016

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Oncentra brachytherapy planning system

In modern cancer management, treatment planning has progressed as a contemporary tool with all the advances in computing power in recent years. One of the advanced planning tools uses 3-dimensional (3D) data sets for accurate dose distributions in patient prescription. Among these planning processes, brachytherapy has been a very important part of a successful cancer management program, offering clinical benefits with specific or combined treatments with external beam therapy. In this chapter, we mainly discussed the Elekta Oncentra planning system, which is the main treatment planning tool for high-dose rate (HDR) modality in our facility and in many other facilities in the United States. HDR is a technically advanced form of brachytherapy; a high-intensity radiation source (3.6 mm in length) is delivered with step motor in submillimeter precision under computer guidance directly into the tumor areas while minimizing injury to surrounding normal healthy tissue. Oncentra planning is the key component to generate a deliverable brachytherapy procedure, which is executed on the microSelectron V3 remote afterloader treatment system. Creating a highly conformal plan can be a time-consuming task. The development of Oncentra software (version 4.5.3) offers a variety of useful tools that facilitate many of the clinical challenging tasks for planning, such as contouring and image reconstruction, as well as rapid planning calculations with dose and dose volume histogram analysis. Oncentra Brachy module creates workflow and optimizes the planning accuracy for wide varieties of clinical HDR treatments, such as skin, gynecologic (GYN), breast, prostate, and many other applications. The treatment file can also be transferred to the afterloader control station for speedy delivery. The design concept, calculation algorithms, and optimization modules presented some key characteristics to plan and treat the patients effectively and accurately. The dose distribution and accuracy of several clinical sample cases were discussed to illustrate the effectiveness and clinical efficacy. The American Association of Physicists in Medicine brachytherapy reports of TG-43 and TG-186 were also described and compared in evaluations of fundamental calculation methodologies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Optimizing Mu2e Spill Regulation System Algorithms

A slow extraction system is being developed for the Fermilab’s Delivery Ring to deliver protons to the Mu2e experiment. During the extraction, the beam on target experiences small intensity variations owing to many factors. Various adaptive learning algorithms will be employed for beam regulation to achieve the required spill quality. We discuss here preliminary results of the slow and fast regulation algorithms validation through the computer simulations before their implementation in the FPGA. Particle tracking with sextupole resonance was used to determine the fine shape of the spill profile. Fast semi-analytical simulation schemes and Machine Learning models were used to optimize the fast regulation loop.

43 PARTICLE ACCELERATORS↗
NASA NTRS1974

Gust alleviation for a STOL transport by using elevator, spoilers, and flaps

Control laws were developed to investigate methods of alleviating the response of a STOL transport to gusty air. The transport considered in the study had triple-slotted, externally blown jet flaps and a large T-tail. The control devices used were the elevator, spoilers, and flaps. A hybrid computing system was used to simulate linearized longitudinal dynamics of the aircraft and to implement a conjugate gradient optimal search algorithm. The aircraft was simulated in the low-speed approach condition only. Feedback control matrices were found which minimized the average of a quadratic functional involving passenger compartment accelerations, pitch angle and rate, flight path angle and speed variations. The optimization was performed for artificially designed gust inputs in the form of predetermined rectangular waveforms. Results were obtained for elevator, spoilers, and flaps acting singly and in combination. Additional results were obtained for unit sinusoidal gust inputs by using the gain matrices computed for the artificial test gusts. Various sensor configurations were also investigated.

Lallman, F. J.↗
DOE OSTI2020

Reverse and Forward Engineering of Local Voltage Control in Distribution Networks

The increasing penetration of renewable and distributed energy resources in distribution networks calls for real-time and distributed voltage control. As such, in this paper we investigate local Volt/VAR control with a general class of control functions, and show that the power system dynamics with non-incremental local voltage control can be seen as a distributed algorithm for solving a well-defined optimization problem (reverse engineering). The reverse engineering further reveals a fundamental limitation of the non-incremental voltage control: the convergence condition is restrictive and prevents better voltage regulation at equilibrium. This motivates us to design two incremental local voltage control schemes based on the subgradient and pseudo-gradient algorithms respectively for solving the same optimization problem (forward engineering). The new control schemes decouple the dynamical property from the equilibrium property, and have much less restrictive convergence conditions. This work presents another step towards developing a new foundation—network dynamics as optimization algorithms—for distributed real-time control and optimization of future power networks.

42 ENGINEERING↗
NASA NTRS1995

Technical report series on global modeling and data assimilation. Volume 4: Documentation of the Goddard Earth Observing System (GEOS) data assimilation system, version 1

This report describes the analysis component of the Goddard Earth Observing System, Data Assimilation System, Version 1 (GEOS-1 DAS). The general features of the data assimilation system are outlined, followed by a thorough description of the statistical interpolation algorithm, including specification of error covariances and quality control of observations. We conclude with a discussion of the current status of development of the GEOS data assimilation system. The main components of GEOS-1 DAS are an atmospheric general circulation model and an Optimal Interpolation algorithm. The system is cycled using the Incremental Analysis Update (IAU) technique in which analysis increments are introduced as time independent forcing terms in a forecast model integration. The system is capable of producing dynamically balanced states without the explicit use of initialization, as well as a time-continuous representation of non- observables such as precipitation and radiational fluxes. This version of the data assimilation system was used in the five-year reanalysis project completed in April 1994 by Goddard's Data Assimilation Office (DAO) Data from this reanalysis are available from the Goddard Distributed Active Center (DAAC), which is part of NASA's Earth Observing System Data and Information System (EOSDIS). For information on how to obtain these data sets, contact the Goddard DAAC at (301) 286-3209, EMAIL daac@gsfc.nasa.gov.

Suarez, Max J.↗
DOE OSTI2021

Application of a machine learning algorithm (XGBoost) to offline RHIC luminosity optimization

The operation parameter optimization in 2020 RHIC low energy run is difficult. First, the RHIC luminosity is affected by many RHIC operation parameters, as well as affected by many Low Energy RHIC electron Cooling (LEReC) operation parameters. Second, the luminosity signal in this run is noisy and not sensitive to these parameter changes, especially when these parameters are very close to their optimized values. It is not easy to distinguish the effects of one parameter from all other operation parameters separately. Therefore, it is difficult to optimize the luminosity by varying these parameters one by one. To find a way for luminosity optimization, we analyze some operation parameters via a machine learning algorithm - XGBoost. After constructing a black-box surrogate model from XGBoost and plotting their partial dependency plots (PDF) and SHAP value plots for different operation parameters, we can find the effects of an individual parameter on the RHIC luminosity and optimize it accordingly.

43 PARTICLE ACCELERATORS↗
DOE OSTI2026

Degenerate coupled-cluster theory

A size-extensive, converging, black-box, ab initio coupled-cluster (ΔCC) ansatz is introduced that computes the energies and wave functions of states from any degenerate or nondegenerate Slater-determinant references with any numbers of α- and β-spin electrons, any patterns of orbital occupancy, any spin multiplicities, and any spatial symmetries. For a nondegenerate reference, it reduces to the single-reference coupled-cluster ansatz. For a degenerate multireference, it is a natural coupled-cluster extension of degenerate Møller–Plesset perturbation (ΔMP) theory. For ionized and electron-attached references, it is a coupled-cluster Green’s function, although the present theory is convergent toward the full-configuration-interaction limits, while the Feynman–Dyson many-body Green’s function (MBGF) theory generally is not. Its single-excitation instance is a projection Hartree–Fock theory as per the Thouless theorem, which may be useful for core ionizations, high-spin states, and possibly electron affinities. Additionally, a new multireference coupled-cluster theory for a general model space is developed. This quasidegenerate coupled-cluster (QCC) theory is exactly converging, but not black-box, and intended for strong correlation. Determinant-based, general-order algorithms of ΔCC and QCC theories are implemented and compared with configuration-interaction (CI) and equation-of-motion coupled-cluster (EOM-CC) theories through octuple excitations and with ΔMP and MBGF theories up to the nineteenth order. An algebraic, optimal-scaling algorithm of the ΔCC theory is computer-synthesized at the levels of single excitations (ΔCCS) and of single and double excitations (ΔCCSD). As a result, the order of performance is QCC ≈ ΔCC > EOM-CC > CI at the same order or QCC ≈ ΔCC > ΔMP > MBGF at the same cost scaling.

Hirata, So [University of Illinois at Urbana-Champ↗
NASA NTRS2004

A Most Probable Point-Based Method for Reliability Analysis, Sensitivity Analysis and Design Optimization

A major step in a most probable point (MPP)-based method for reliability analysis is to determine the MPP. This is usually accomplished by using an optimization search algorithm. The minimum distance associated with the MPP provides a measurement of safety probability, which can be obtained by approximate probability integration methods such as FORM or SORM. The reliability sensitivity equations are derived first in this paper, based on the derivatives of the optimal solution. Examples are provided later to demonstrate the use of these derivatives for better reliability analysis and reliability-based design optimization (RBDO).

Hou, Gene J.-W↗
DOE OSTI2026

Optimized Gear Selection to Maximize Energy Savings in Electric Traction Drives for Medium and Heavy Duty Vehicles

Multi‑gear transmission systems are commonly used in electric traction drives for medium and heavy‑duty vehicles, while most passenger‑vehicle electric drivetrains rely on a single fixed ratio to reduce cost, weight, and complexity. Using multiple gear ratios can enable downsizing of the motor and inverter while still meeting performance requirements. Additionally, appropriately chosen ratios allow the motor to operate more frequently in high‑efficiency regions, improving overall energy usage and reducing operating costs over the drive cycle. This paper presents a systematic approach for selecting optimal gear ratios for electric drive systems. A neural‑network model is first developed to represent motor losses across the full torque–speed range using data generated from finite element analysis. This model enables fast, accurate evaluation of motor efficiency under varying operating conditions. A genetic‑algorithm‑based optimization framework is then applied to identify gear ratios that maximize energy cost savings over the drive cycle, with the resulting optimal ratios stored for real‑time implementation.

Gadiyar, Nishanth [ORNL] (ORCID:0000000348267524)↗
DOE OSTI2020

DOE Express Quantum Computing Application Teams (QCAT FY20 Report)

The QCOR project consists of 4 main research tasks: 1) scientific applications and algorithm development for machine learning (ML) and quantum theories of condensed matter systems and lattice gauge theories; 2) high-level quantum-classical (HLQC) language and domain specific language (DSL) development; 3) compiler and interfaces development for the HLQC language; and 4) hardware-level control, optimization, and algorithms libraries. In the succeeding sections we report on progress towards our research tasks during the 2020 calendar year.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
NASA NTRS1979

Evaluating and minimizing noise impact due to aircraft flyover

Existing techniques were used to assess the noise impact on a community due to aircraft operation and to optimize the flight paths of an approaching aircraft with respect to the annoyance produced. Major achievements are: (1) the development of a population model suitable for determining the noise impact, (2) generation of a numerical computer code which uses this population model along with the steepest descent algorithm to optimize approach/landing trajectories, (3) implementation of this optimization code in several fictitious cases as well as for the community surrounding Patrick Henry International Airport, Virginia.

Jacobson, I. D.↗
DOE OSTI2018

RayStation: External beam treatment planning system

RaySearch Laboratories is a world leader in the field of advanced software and creator of the RayStation treatment planning system for radiation therapy. The aim with RayStation is to deliver an unmatched user experience and leading functionality. Unique features described here include multiatlas based autosegmentation for contouring, deformable registration with 2 different algorithms, multicriteria optimization, Plan Explorer, fallback planning, ultrafast computation speed, and 4-dimensional (4D) adaptive radiation therapy. RayStation can be used to plan for electrons and photons on traditional linacs, for protons on various delivery systems, and for Accuray's helical TomoTherapy system. This paper describes some of these modalities, with reference to clinical cases and including descriptions of the impact on workflow.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2024

A Generation-Storage Coordination Dispatch Strategy for Power System Based on Causal Reinforcement Learning

In the backdrop of global energy transformation, power systems integrating high proportions of renewable energy sources are facing unprecedented challenges in operational stability and dispatch efficiency. To address these challenges, this study introduces a generation-storage coordination real-time dispatch strategy based on Causal Power System Dynamic Reinforcement Learning (CPSDRL). Diverging from traditional reinforcement learning approaches, CPSDRL innovatively incorporates causal inference within the state prediction model - the crux of model-based reinforcement learning - thereby establishing the Power Causal Dynamic Model (PCDM). Assisted by the prior knowledge of power systems, the model significantly enhances prediction accuracy and reliability through a two-stage training process. Utilizing PCDM, this study further applies a direct policy search algorithm to optimize the real-time dispatch strategy. Experimental results indicate that the proposed method improves the stability of generation-storage coordination real-time dispatch and exhibits competitive advantages in sample efficiency and computational speed, compared to traditional model-based and model-free reinforcement learning algorithms. This method is expected to enhance the practicality and adaptability of causal reinforcement learning techniques in power system scheduling and control.

causal reinforcement learning↗
DOE OSTI2016

Towards a Scalable and Adaptive Application Support Platform for Large-Scale Distributed E-Sciences in High-Performance Network Environments

The advent of large-scale collaborative scientific applications has demonstrated the potential for broad scientific communities to pool globally distributed resources to produce unprecedented data acquisition, movement, and analysis. System resources including supercomputers, data repositories, computing facilities, network infrastructures, storage systems, and display devices have been increasingly deployed at national laboratories and academic institutes. These resources are typically shared by large communities of users over Internet or dedicated networks and hence exhibit an inherent dynamic nature in their availability, accessibility, capacity, and stability. Scientific applications using either experimental facilities or computation-based simulations with various physical, chemical, climatic, and biological models feature diverse scientific workflows as simple as linear pipelines or as complex as a directed acyclic graphs, which must be executed and supported over wide-area networks with massively distributed resources. Application users oftentimes need to manually configure their computing tasks over networks in an ad hoc manner, hence significantly limiting the productivity of scientists and constraining the utilization of resources. The success of these large-scale distributed applications requires a highly adaptive and massively scalable workflow platform that provides automated and optimized computing and networking services. This project is to design and develop a generic Scientific Workflow Automation and Management Platform (SWAMP), which contains a web-based user interface specially tailored for a target application, a set of user libraries, and several easy-to-use computing and networking toolkits for application scientists to conveniently assemble, execute, monitor, and control complex computing workflows in heterogeneous high-performance network environments. SWAMP will enable the automation and management of the entire process of scientific workflows with the convenience of a few mouse clicks while hiding the implementation and technical details from end users. Particularly, we will consider two types of applications with distinct performance requirements: data-centric and service-centric applications. For data-centric applications, the main workflow task involves large-volume data generation, catalog, storage, and movement typically from supercomputers or experimental facilities to a team of geographically distributed users; while for service-centric applications, the main focus of workflow is on data archiving, preprocessing, filtering, synthesis, visualization, and other application-specific analysis. We will conduct a comprehensive comparison of existing workflow systems and choose the best suited one with open-source code, a flexible system structure, and a large user base as the starting point for our development. Based on the chosen system, we will develop and integrate new components including a black box design of computing modules, performance monitoring and prediction, and workflow optimization and reconfiguration, which are missing from existing workflow systems. A modular design for separating specification, execution, and monitoring aspects will be adopted to establish a common generic infrastructure suited for a wide spectrum of science applications. We will further design and develop efficient workflow mapping and scheduling algorithms to optimize the workflow performance in terms of minimum end-to-end delay, maximum frame rate, and highest reliability. We will develop and demonstrate the SWAMP system in a local environment, the grid network, and the 100Gpbs Advanced Network Initiative (ANI) testbed. The demonstration will target scientific applications in climate modeling and high energy physics and the functions to be demonstrated include workflow deployment, execution, steering, and reconfiguration. Throughout the project period, we will work closely with the science communities in the fields of climate modeling and high energy physics including Spallation Neutron Source (SNS) and Large Hadron Collider (LHC) projects to mature the system for production use.

97 MATHEMATICS AND COMPUTING↗